DocumentCode
2600190
Title
A path sensitization approach to area reduction
Author
Chen, Hsi-Chuan ; Cheng, Siu Wing ; Hsu, Yaun-chung ; Du, David H C
Author_Institution
Dept. of Comput. Sci., Minnesota Univ., Minneapolis, MN, USA
fYear
1993
fDate
3-6 Oct 1993
Firstpage
73
Lastpage
76
Abstract
We study the problem of choosing gate implementations to reduce circuit area while retaining the circuit performance. To incorporate timing analysis into area reduction, we propose to utilize the information provided by a sensitization criterion in computing the slacks of the gates. Not all sensitization criteria can be adopted in our approach. Some conditions were imposed to define a class of sensitization criteria which can guarantee that the circuit performance will be preserved. A greedy area reduction heuristic is proposed, and then an improved version of the Brand-Iyengar and the static sensitization criteria are plugged into the heuristic to obtain results for comparison (D. Brand, V. Iyengar, 1986)
Keywords
logic circuits; sensitivity analysis; area reduction; circuit performance; gate implementations; greedy area reduction heuristic; path sensitization approach; sensitization criterion; timing analysis; Circuit optimization; Computer science; Delay estimation; Equations; Libraries; Mathematical programming; Performance analysis; Power dissipation; Size control; Timing;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Design: VLSI in Computers and Processors, 1993. ICCD '93. Proceedings., 1993 IEEE International Conference on
Conference_Location
Cambridge, MA
Print_ISBN
0-8186-4230-0
Type
conf
DOI
10.1109/ICCD.1993.393402
Filename
393402
Link To Document