ACM Home Page
Please provide us with feedback. Feedback
Gate matrix layout synthesis with two-dimensional folding
Full text PdfPdf (850 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 26th ACM/IEEE Design Automation Conference table of contents
Las Vegas, Nevada, United States
Pages: 37 - 42  
Year of Publication: 1989
ISBN:0-89791-310-8
Authors
I. Lin  Department of Computer Science, University of Minnesota, Minneapolis, MN
D. H. C. Du  Department of Computer Science, University of Minnesota, Minneapolis, MN
S. H. C. Yen  Department of Computer Science, University of Minnesota, Minneapolis, MN
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
IEEE-CS\TCDA : TC Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 12,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/74382.74390
What is a DOI?

ABSTRACT

We have developed a gate matrix layout synthesis tool which utilizes folding technique on both rows and columns. The conventional interval graph model and the recently proposed dynamic net-list representation can not fully depict circuit schematics such as inter-net connections. The incomplete representations may mislead the search process for an optimal solution during the layout partitioning and the gate ordering phases. We propose a new graph-based model called hierarchical dynamic net-list to improve the schematic representation. Based on the new model, the folded layout area in the partitioning phase can be more accurately estimated. The new gate ordering algorithm proposed by us also takes the advantages of the hierarchical dynamic net-list model to handle the gate placement in the folded layouts. The experimental results show 12% to 15% improvement in layout area for small circuits and 30% improvement for a large circuit.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
Lopez80
A.Lopez, H.Law, "A dense gate matrix layout method for MOS VLSI", IEEE Trans. Electron Devices, pp 1671-167,5, Aug 1980.
 
Wing85
O.Wing, S.Huang, R.Wang, "Gate Matrix Layout", IEEE Trans. CAD, voi CAD-4, no.3, pp 220-231, July 1985.
 
Hwang86
D.Hwang, W.Fuchs, S.Kang, "An efficient approach to gate matrix layout", Proc. IEEE Int. Conf. on CAD, pp 312-315, 1986.
 
Leong86
H.Leong, "A new algorithm for gate matrix layout", Proc. IEEE Int. Conf. on CAD, pp 316-319, 1986.
 
Hwang87
D.Hwang, W.Fuchs, S.Kang, "An efficient approach to gate matrix layout", IEEE Trans. on CAD, vol CAD-6, no.5, pp.802-809, Sep 1987.
Wong87
 
Deva87
S.Srinivas and R.Newton, "Topological Optimization of Multiple-Level Array Logic", IEEE Trans. CAD, vol CAD-6, no.6, pp 915-941, Nov. 1987.
Chang87
 
Kirk83
S.Kirkpatrick, C.D.Gelatt Jr. and M.P.Vecchi, "Optimization by Simulated Annealing", Science, voi. 220, pp.671-680, 1983.

Collaborative Colleagues:
I. Lin: colleagues
D. H. C. Du: colleagues
S. H. C. Yen: colleagues