By Topic

Hybrid number representations with bounded carry propagation chains

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
D. S. Phatak ; Dept. of Electr. & Comput. Eng., Massachusetts Univ., Amherst, MA, USA ; I. Koren ; H. Choi

A novel, hybrid number representation is proposed. It includes the two's complement representation and the signed-digit representation as special cases. Such a hybrid representation is capable of bounding the maximum length of carry propagation chains during addition. Thus, one can select a specific hybrid number representation that limits the maximum length of all the carry propagation chains to any desired value between one and the entire word length. The framework reveals a continuum of number representations between the two extremes of two's complement and signed-digit number systems and allows a unified performance analysis of the entire spectrum of adders based on the representation selected

Published in:

Computer Design: VLSI in Computers and Processors, 1993. ICCD '93. Proceedings., 1993 IEEE International Conference on

Date of Conference:

3-6 Oct 1993