Efficient CRT-based residue-to-binary converter for the arbitrary moduli set
From MaRDI portal
Publication:543164
DOI10.1007/s11432-010-4133-3zbMath1284.68039OpenAlexW1982681713MaRDI QIDQ543164
Publication date: 17 June 2011
Published in: Science China. Information Sciences (Search for Journal in Brave)
Full work available at URL: http://engine.scichina.com/doi/10.1007/s11432-010-4133-3
Chinese remainder theoremmodular arithmeticRNSarbitrary moduli setdifference correctionresidue-to-binary
Congruences; primitive roots; residue systems (11A07) Mathematical problems of computer architecture (68M07)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An efficient algorithm and parallel implementations for binary and residue number systems
- An efficient RNS parity checker for moduli set \(\{2^n - 1, 2^n + 1, 2^{2n} + 1\}\) and its applications
- 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.
- A new high dynamic range moduli set with efficient reverse converter
- Residue-to-binary converters based on new Chinese remainder theorems
- A high-speed residue-to-binary converter for three-moduli (2/sup k/, 2/sup k/-1, 2/sup k-1/-1) RNS and a scheme for its VLSI implementation
- A modular approach to the computation of convolution sum using distributed arithmetic principles
- Log Depth Circuits for Division and Related Problems
- Fast and flexible architectures for RNS arithmetic decoding
- A Residue-to-Binary Converter for a New Five-Moduli Set
- RNS-to-Binary Converters for Two Four-Moduli Sets <formula formulatype="inline"><tex>$\{2^{n}-1,2^{n},2^{n}+1,2^{{n}+1}-1\}$</tex></formula> and <formula formulatype="inline"><tex>$\{2^{n}-1,2^{n},2^{n}+1,2^{{n}+1}+1\}$</tex></formula>
This page was built for publication: Efficient CRT-based residue-to-binary converter for the arbitrary moduli set
