Parallel canonical recoding

The author introduces a parallel algorithm for generating the canonical signed-digit expansion of an n-bit number in O(logn) time using O(n) gates. The algorithm is similar to the computation of the carries in a carry look-ahead circuit. It is also proven that if the binary number x + ⌋x/2⌊ is given, then the canonical signed-digit recoding of x can be computed in O(1) time using O(n) gates.

[1]  Ömer Egecioglu,et al.  Exponentiation Using Canonical Recoding , 1994, Theor. Comput. Sci..

[2]  H. T. Kung,et al.  A Regular Layout for Parallel Adders , 1982, IEEE Transactions on Computers.

[3]  I. Koren.  Computer arithmetic algorithms , 2018 .

[4]  Kai Hwang,et al.  Computer arithmetic: Principles, architecture, and design , 1979 .