DocumentCode :
2889226
Title :
A cell-replicating approach to minicut-based circuit partitioning
Author :
Kring, C. ; Newton, A.R.
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA, USA
fYear :
1991
fDate :
11-14 Nov. 1991
Firstpage :
2
Lastpage :
5
Abstract :
An extension to the Fiduccia and Mattheyses minicut algorithm (1982) allows cells to be replicated in both sides of the partition. This technique can substantially reduce the number of cut nets in a partitioned network below what can be obtained without replication. The extensions to the algorithm to permit replication are easily implemented and maintain the linear-time complexity of the algorithm. This technique is dependent solely upon the interconnect topology and the direction of signal flows between cells and nets. The formulation of cell gains is extended to model the effect of cell replication, and the necessary modifications to the algorithm are described.<>
Keywords :
circuit layout CAD; computational complexity; minimisation of switching nets; cell gains; cell replication; cut nets; interconnect topology; linear-time complexity; minicut-based circuit partitioning; partitioned network; signal flow direction; Circuit faults; Circuit testing; Iterative algorithms; Partitioning algorithms; Redundancy;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer-Aided Design, 1991. ICCAD-91. Digest of Technical Papers., 1991 IEEE International Conference on
Conference_Location :
Santa Clara, CA, USA
Print_ISBN :
0-8186-2157-5
Type :
conf
DOI :
10.1109/ICCAD.1991.185175
Filename :
185175
Link To Document :
بازگشت