For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Overlapped Decompositions for Communication Complexity Driven Multilevel Logic Synthesis
Kuo-Hua WANG Ting-Ting HWANG Cheng CHEN
IEICE TRANSACTIONS on Information and Systems
Publication Date: 1993/09/25
Print ISSN: 0916-8532
Type of Manuscript: Special Section PAPER (Special Issue on Synthesis and Verification of Hardware Design)
Category: Logic Synthesis
communication complexity, functional decomposition, overlapped decomposition, globals, Decomposition Don't Cares (DDC).,
Full Text: PDF>>
Reducing communication complexity is a viable approach to multilevel logic synthesis. A communication complexity based approach was proposed previously. In the previous works, only disjoint input decomposition was considered. However, for certain types of circuits, the circuit size can be reduced by using overlapped decomposition. In this paper, we consider overlapped decompositions. Some design issues for overlapped decompositions such as detecting globals" and deriving subfunctions are addressed. Moreover, the Decomposition Don't Cares (DDC) is considered for improving the decomposed results. By using these techniques together, the area and delay of circuits can be further minimized.