This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Carry-Save Representation Is Shift-Unsafe: The Problem and Its Solution
May 2006 (vol. 55 no. 5)
pp. 630-635
Several arithmetic circuits use Carry-Save (CS) representation of signed numbers in one's complement or two's complement. However, arithmetic right shifts of the CS form may generate incorrect results. This work presents the problem and proposes a simple solution to keep the correct CS representation of signed numbers when arithmetic right-shift operations or sign extensions are required. The authors discuss why the problem does not occur in most of the traditional implementations of arithmetic circuits and also emphasize that it may happen for some types of arithmetic algorithm and arithmetic hardware design.

[1] M.D. Ercegovac and T. Lang, Digital Arithmetic. Morgan Kaufmann, 2003.
[2] B. Parhami, Computer Arithmetic: Algorithms and Hardware Designs. Oxford, 2000.
[3] A.F. Tenca, “A Methodology to Develop Gate Networks for Redundant Digit Systems,” Proc. SPIE— Advanced Signal Processing Algorithms, Architectures, and Implementations X, F.T. Luk, ed., pp. 267-278, Aug. 2000.

Index Terms:
Carry-save, redundant representation, computer arithmetic, arithmetic shift.
Citation:
Alexandre F. Tenca, Song Park, Lo'ai A. Tawalbeh, "Carry-Save Representation Is Shift-Unsafe: The Problem and Its Solution," IEEE Transactions on Computers, vol. 55, no. 5, pp. 630-635, May 2006, doi:10.1109/TC.2006.70
Usage of this product signifies your acceptance of the Terms of Use.