An efficient parity detection technique using the two-moduli set {2 − 1, 2 + 1}

Lu and Chiang used both the table lookup and fractional number approaches to discover the parity of an RNS number. To eliminate the need for table space and time for computing fractions, a two-moduli set {2^h − 1, 2^h + 1} is used to speed up the technique proposed by Lu and Chiang. Based on this modified two-moduli set, it is found that the parity of an RNS number X = (x₁, x₂) is if x₁ ? x₂. On the contrary, if x₁ < x₂, the parity of X is .