An optimal allocation of carry-save-adders in arithmetic circuits

2001 ◽  
Vol 50 (3) ◽  
pp. 215-233 ◽  
Author(s):  
Junhyung Um ◽  
Taewhan Kim
2000 ◽  
Vol 10 (05n06) ◽  
pp. 279-292
Author(s):  
YOUNG-TAE KIM ◽  
TAEWHAN KIM

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.


1985 ◽  
Vol 24 (3-4) ◽  
pp. 551-563
Author(s):  
Tariq Riaz

Any system of ideas which underlies economic policy recommendations needs to be made explicit so that its doctrinal premise may be examined and debated. Section I of this paper, therefore, explicitly states the philosophical under -pinning of this study. Section 2 presents the central energy problem in a general mathematical form whereas the solution of the specific energy problem for the Pakistani economy is presented in Section 3, in which policy guidelines for obtaining the desired solution have also been discussed. Finally, Section 4 briefly presents our concluding remarks.


Sign in / Sign up

Export Citation Format

Share Document