Efficient architectures for modulo 2ⁿ−1 squares

Another Implementation of Efficient Recoding Circuit for Signed Digit to Residue Canonical Signed Digit on Modulo 2ⁿ-1

“…Especially, the residue number system using modulo set {2 n , 2 n − 1, 2 n + 1} is widely studied. Therefore, various arithmetic circuits such as adders and multipliers have been proposed [1,2,3].…”