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.

DOI10.1016/S0898-1221(02)00280-8zbMath1034.68001MaRDI QIDQ1416365

D. Massart

Publication date: 14 December 2003

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

AlgorithmChinese remainder theoremResidue number systemArithmeticCircuit and systems

Mathematics Subject Classification ID

Analytic circuit theory (94C05) Mathematical problems of computer architecture (68M07)

Related Items (2)

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 ⋮ Efficient CRT-based residue-to-binary converter for the arbitrary moduli set

Cites Work

• Unnamed Item
• Residue-to-binary converters based on new Chinese remainder theorems
• Residue-to-binary number converters for three moduli sets
• An efficient residue to binary converter design
• An RNS to binary converter in a three moduli set with common factors

This page was built for publication: 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.