Carry-save and binary sign-digit representations conversion

Computer arithmetic operations based on the binary sign-digit (BSD) numbers and carry-save addition (CSA) representation systems provide them with high-speed computations due to carry-propagation free features. However, in the previous researches, these two representations are treated respectively. In this paper, the algorithms and implementation structures are proposed for the conversion between them, thus, the arithmetic developed for one representation can be easily adapted to the other. The conversion overheads in the area and speed are also studied