An efficient design of residue to binary converter for four moduli set (2ⁿ-1,2ⁿ + 1,2²ⁿ-2,2²ⁿ+1-3) based on New CRT II

DOI10.1016/J.INS.2007.05.040MaRDI QIDQ2465982zbMATH OpenOpenAlexFDO

Authors Wei Zhang, Pepe Siy

Publication date 11 January 2008

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2007.05.040

zbMATH Keywords

residue number systemresidue to binary converternew Chinese remainder theorem 2

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07)

Recommendations

• Four-moduli set (\(2, 2^{n}-1, 2^{n}+2^{n-1}-1, 2^{n+1}+2^{n}-1\)) simplifies the residue to binary converters based on CRT II.
• High speed residue to binary converter for the new four-moduli set \(\{2^{2n},2^n+1,2^{n/2}+1,2^{n/2}-1\}\)
• Efficient CRT-based residue-to-binary converter for the arbitrary moduli set
• Efficient reverse converters for 4-moduli sets \(\{2^{2n-1}-1, 2^n,2^n+1,2^n-1\}\) and \(\{2^{2n-1},2^{2n-1}-1, 2^n+1,2^n-1\}\) based on CRTs algorithm
• An efficient residue to binary converter design

Cites work

• scientific article; zbMATH DE number 4061135 (Why is no real title available?)
• scientific article; zbMATH DE number 3269473 (Why is no real title available?)
• An efficient parity detection technique using the two-moduli set \(\{2^{h} - 1, 2^{h} + 1\}\)
• An efficient reverse converter for the 4-moduli set [2/sup n/ - 1, 2/sup n, 2/sup n + 1, 2/sup 2n/ + 1] based on the new chinese remainder theorem
• Four-moduli set (\(2, 2^{n}-1, 2^{n}+2^{n-1}-1, 2^{n+1}+2^{n}-1\)) simplifies the residue to binary converters based on CRT II.
• Residue-to-binary converters based on new Chinese Remainder Theorems
• Residue-to-binary number converters for three moduli sets

Cited in

(6)

• An efficient reverse converter for the 4-moduli set [2/sup n/ - 1, 2/sup n, 2/sup n + 1, 2/sup 2n/ + 1] based on the new chinese remainder theorem
• Reverse converters for the moduli set \(\{2^n, 2^{n-1}-1,2^{n}-1, 2^{n+1}-1\}\) (\(n\) even)
• Efficient CRT-based residue-to-binary converter for the arbitrary moduli set
• High speed residue to binary converter for the new four-moduli set \(\{2^{2n},2^n+1,2^{n/2}+1,2^{n/2}-1\}\)
• Four-moduli set (\(2, 2^{n}-1, 2^{n}+2^{n-1}-1, 2^{n+1}+2^{n}-1\)) simplifies the residue to binary converters based on CRT II.
• Efficient reverse converter design for five moduli set \(\{2^n,2^{2n+1}-1,2^{n/2}-1,2^{n/2}+1,2^n+1\}\)

This page was built for publication: An efficient design of residue to binary converter for four moduli set \((2^{n}-1,2^n + 1,2^{2n}-2,2^{2n+1}-3)\) based on New CRT II

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2465982)