An efficient RNS parity checker for moduli set \(\{2^n - 1, 2^n + 1, 2^{2n} + 1\}\) and its applications
From MaRDI portal
Publication:954477
DOI10.1007/s11432-008-0097-yzbMath1151.68055OpenAlexW1974601904MaRDI QIDQ954477
Lin Zhang, Jianhao Hu, Shang Ma, Xiang Ling
Publication date: 10 November 2008
Published in: Science in China. Series F (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11432-008-0097-y
Related Items (2)
An improved Chen's parity detection technique for the two-moduli set ⋮ Efficient CRT-based residue-to-binary converter for the arbitrary moduli set
Cites Work
- 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 study of the residue-to-binary converters for the three-moduli sets
- The Basis for Implementation of Ad idive Operations in the Residue Number System
- Binary Logic for Residue Arithmetic Using Magnitude Index
This page was built for publication: An efficient RNS parity checker for moduli set \(\{2^n - 1, 2^n + 1, 2^{2n} + 1\}\) and its applications
