论文信息 - Fast VLSI circuits for CSD coding and GNAF coding

Fast VLSI circuits for CSD coding and GNAF coding

The generations of the canonical signed digit (CSD) and of the generalised non-adjacent (GNAF) forms are investigated. The coding of these forms is reduced to a suitable prefix operation which requires O(log t) time to codify a sequence of t digits.

Sajal K. Das | M. C. Pinotti

[1] Ferrell S. Wheeler,et al. Signed Digit Representations of Minimal Hamming Weight , 1993, IEEE Trans. Computers.

[2] A. Herrfeld,et al. Look-ahead circuit for CSD-code carry determination , 1995 .

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

[4] W. Edwin Clark,et al. On arithmetic weight for a general radix representation of integers (Corresp.) , 1973, IEEE Trans. Inf. Theory.

[5] Earl E. Swartzlander,et al. Computer Arithmetic , 1980 .