论文信息 - HWP: a new insight into canonical signed digit

HWP: a new insight into canonical signed digit

A new Hamming weight pyramid (HWP) that resembles the Pascal triangle is proposed to succinctly compress the information about the distribution of the Hamming weight in canonical signed digit (CSD) represented numbers in a visually appealing manner for analysis and synthesis. Many interesting properties are discovered in this regularly structured HWP. These properties lead to a novel and elegant way to convert decimal numbers to their binary equivalence, which is an ineluctable intermediate process in the conventional decimal to CSD conversion algorithms.

Chip-Hong Chang | Fei Xu | Ching-Chuen Jong

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

[2] Sajal K. Das,et al. Fast VLSI circuits for CSD coding and GNAF coding , 1996 .

[3] R. Hartley. Subexpression sharing in filters using canonic signed digit multipliers , 1996 .

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

[5] Sos S. Agaian,et al. SBNR processor for stack filters , 1994, Proceedings of 1994 28th Asilomar Conference on Signals, Systems and Computers.

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

[7] L. Wanhammar,et al. Design of high-speed multiplierless filters using a nonrecursive signed common subexpression algorithm , 2002 .

[8] George W. Reitwiesner,et al. Binary Arithmetic , 1960, Adv. Comput..

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

[10] R. Hashemian. A new method for conversion of a 2's complement to canonic signed digit number system and its representation , 1996, Conference Record of The Thirtieth Asilomar Conference on Signals, Systems and Computers.