Accurate Exploration of Timing and Area Trade-offs in Arithmetic Optimization using Carry-Save-Adders

Cited 1 time in webofscience Cited 0 time in scopus
  • Hit : 281
  • Download : 0
Carry-save adder (CSA) is one of the most widely used implementation units for arithmetic circuits. However, the existing approaches to the CSA transformation have an inherent limitation in the scope of CSA application, i.e., transforming each of operation trees separately without any interaction among them, which results in a locally optimized CSA circuit. To overcome the limitation, we introduce a new concept called tree-boundary optimization techniques, based on which we propose a practically efficient algorithm for exploring timing and area trade-offs in optimizing arithmetic circuits using CSAs. The proposed algorithm is applicable to any arithmetic circuits with multiple operation trees, which appear in most filter designs. From experimentations on a number of digital filter designs, we confirm that the proposed algorithm reduces the circuit timing by 4%-40% without any area increase compared to those produced by the conventional CSA transformations.
Publisher
World Scientific Publ Co Pte Ltd
Issue Date
2001-10
Language
English
Article Type
Article
Citation

JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS, v.10, no.5, pp.279 - 292

ISSN
0218-1266
URI
http://hdl.handle.net/10203/80130
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 1 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0