A Practical Approach to the Synthesis of Arithmetic Circuits using Carry-Save Adders

Cited 6 time in webofscience Cited 0 time in scopus
  • Hit : 266
  • Download : 0
Carry-save-adder (CSA) is one of the most widely used types of operation in implementing a fast computation of arithmetics. An inherent limitation of the conventional CSA applications is that the applications are confined to the sections of arithmetic circuit that can be directly translated into addition expressions. To overcome this limitation, from the analysis of the structures of arithmetic circuits found in industry, we derive a set of simple, but effective CSA transformation techniques other than the existing ones. Those are 1) optimization across multiplexors, 2) optimization across design boundaries, and 3) optimization across multiplications. Based on the techniques, we develop a new timing-driven CSA transformation algorithm that is able to utilize CSA's extensively throughout the whole circuits. Experimental data for practical testcases are provided to show the effectiveness of our algorithm.
Publisher
IEEE-Inst Electrical Electronics Engineers Inc
Issue Date
2000-05
Language
English
Article Type
Article
Keywords

OPTIMIZATION

Citation

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, v.19, no.5, pp.615 - 624

ISSN
0278-0070
URI
http://hdl.handle.net/10203/68305
Appears in Collection
RIMS Journal Papers
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 6 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0