An efficient RNS parity checker for moduli set \2ⁿ - 1, 2ⁿ + 1, 2²ⁿ + 1\ and its applications

DOI10.1007/S11432-008-0097-YMaRDI QIDQ954477zbMATHOpenAlexFDO

Authors Shang Ma, Jianhao Hu, Lin Zhang, 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

zbMATH Keywords

VLSIRNSsign determinationoverflow detectionnumber comparisonparity check

Mathematics Subject Classification ID

Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Recommendations

• An efficient parity detection technique using the two-moduli set \(\{2^{h} - 1, 2^{h} + 1\}\)
• An improved Chen's parity detection technique for the two-moduli set
• A high-speed division algorithm in residue number system using parity-checking technique
• scientific article; zbMATH DE number 5360581
• scientific article; zbMATH DE number 5899803

Cites work

• A high-speed residue-to-binary converter for three-moduli \((2^k, 2^k -1, 2^{k-1} -1)\) RNS and a scheme for its VLSI implementation
• A study of the residue-to-binary converters for the three-moduli sets
• Binary Logic for Residue Arithmetic Using Magnitude Index
• The Basis for Implementation of Ad idive Operations in the Residue Number System

Cited in

(3)

• Efficient CRT-based residue-to-binary converter for the arbitrary moduli set
• An efficient parity detection technique using the two-moduli set \(\{2^{h} - 1, 2^{h} + 1\}\)
• An improved Chen's parity detection technique for the two-moduli set

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

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