DocumentCode :
2768919
Title :
Timing optimization for multi-level combination networks
Author :
Chen, Kuang-Chien ; Muroga, Saburo
Author_Institution :
Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA
fYear :
1990
fDate :
24-28 Jun 1990
Firstpage :
339
Lastpage :
344
Abstract :
A timing optimization algorithm SDLR (SYLON-DREAM level-reduction) is presented, which is used in the SYLON-DREAM logic synthesizer for speeding up combinational multilevel networks. In SDLR, gates on critical paths are identified and their level numbers counted from the inputs of the network are maximally reduced by a level-reduction procedure. Gates which are not on the critical paths are processed by an area-reduction procedure to reduce network area without increasing its maximum depth. SDLR uses the concept of permissible functions in both level and area reduction procedures, and it can directly process networks consisting of simple gates or negative gates (i.e., MOS cells). Experimental results obtained for benchmark functions show that SDLR is an effective algorithm which can reduce network delay with no or minimal area increase
Keywords :
circuit analysis computing; combinatorial circuits; logic CAD; optimisation; MOS; SYLON-DREAM level-reduction; area-reduction procedure; benchmark functions; critical paths; logic synthesizer; multi-level combination networks; network delay; timing optimization algorithm SDLR; Circuit synthesis; Computer science; Delay effects; Delay estimation; Design optimization; Logic circuits; Logic design; Network synthesis; Synthesizers; Timing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Design Automation Conference, 1990. Proceedings., 27th ACM/IEEE
Conference_Location :
Orlando, FL
ISSN :
0738-100X
Print_ISBN :
0-89791-363-9
Type :
conf
DOI :
10.1109/DAC.1990.114878
Filename :
114878
Link To Document :
بازگشت