By Topic

An accurate exploration of timing and area trade-offs in arithmetic optimization using carry-save adder cells

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

2 Author(s)
Young-Tae Kim ; Dept. of Electr. Eng. & Comput. Sci., Korea Adv. Inst. of Sci. & Technol., Taejon, South Korea ; Taewhan Kim

Timing and area of circuits are two of the most important design criteria to be optimized in data path synthesis. Further, carry-save adder (CSA) cell has been proven to be one of the most effective hardware units in optimizing timing and area of the circuits. However, the prior approaches have only been concerned with the optimization of a single operation tree using CSAs, and have not been able to optimize multiple operation trees properly. This paper proposes a practical solution to the problem of an accurate exploration of trade-offs between timing and area in optimizing arithmetic circuit using CSAs. The application of the approach leads to finding a best CSA implementation of circuit in terms of both timing and area

Published in:

Circuits and Systems, 2000. Proceedings of the 43rd IEEE Midwest Symposium on  (Volume:1 )

Date of Conference: