An improved Chen's parity detection technique for the two-moduli set

DOI10.1080/00207160.2010.488689MaRDI QIDQ2995490zbMATH OpenOpenAlexFDO

Authors Chih-Cheng Hsueh, Chien-Yuan Chen

Publication date 21 April 2011

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207160.2010.488689

Mathematics Subject Classification ID

Congruences; primitive roots; residue systems (11A07) Arithmetic functions; related numbers; inversion formulas (11A25) Numerical algorithms for computer arithmetic, etc. (65Y04)

Recommendations

• An efficient RNS parity checker for moduli set \(\{2^n - 1, 2^n + 1, 2^{2n} + 1\}\) and its applications
• An efficient parity detection technique using the two-moduli set \(\{2^{h} - 1, 2^{h} + 1\}\)
• RNS sign detector based on Chinese remainder theorem II (CRT II)
• A high-speed division algorithm in residue number system using parity-checking technique
• Efficient Implementations of the Chinese Remainder Theorem for Sign Detection and Residue Decoding

Cites work

• scientific article; zbMATH DE number 3269473 (Why is no real title available?)
• A high-speed division algorithm in residue number system using parity-checking technique
• An efficient RNS parity checker for moduli set \(\{2^n - 1, 2^n + 1, 2^{2n} + 1\}\) and its applications
• An efficient parity detection technique using the two-moduli set \(\{2^{h} - 1, 2^{h} + 1\}\)
• Computer arithmetic algorithms.
• Efficient Implementations of the Chinese Remainder Theorem for Sign Detection and Residue Decoding

Cited in

(2)

• An efficient RNS parity checker for moduli set \(\{2^n - 1, 2^n + 1, 2^{2n} + 1\}\) and its applications
• An efficient parity detection technique using the two-moduli set \(\{2^{h} - 1, 2^{h} + 1\}\)

This page was built for publication: An improved Chen's parity detection technique for the two-moduli set

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