An efficient parity detection technique using the two-moduli set \(\{2^{h} - 1, 2^{h} + 1\}\) (Q2509242)

The paper deals with analysis of RNS (Residue Number System) numbers, allowing for high speed arithmetic operations. Due to some interesting properties the RNS numbers can be used in cryptography, image processing, digital filtering, etc. In the paper a parity detection technique to speed up RNS operation in number comparison is developed. The author proposes an efficient parity detection method, based on the two-moduli set, leading to a more useful representation of RNS numbers than that obtained with the use of the Chinese remainder theorem. This new approach eliminates the need for table space for recording the parity of elements and limits the time for computing fractions.