Layout placement for sliced architecture

The authors define a new, sliced layout architecture for compilation of arbitrary schematics (netlists) into layout for CMOS technology. This sliced architecture uses over-the-cell routing on the second metal layer. The authors define three different architectures with simple folding, interleaved folding, and unrestricted folding and give algorithms for optimizing the layout area for several variants of the selected architecture. A proof demonstrating that the architecture with interleaved folding is as good as the architecture with unrestricted folding with respect to area minimization of the total layout is given. The authors also present results of random benchmarks as well as several real benchmarks. >

[1]  Richard M. Karp,et al.  An efficient approximation scheme for the one-dimensional bin-packing problem , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[2]  J.R. Armstrong Chip-level modeling with HDLs , 1988, IEEE Design & Test of Computers.

[3]  Daniel D. Gajski,et al.  Silicon compilation from register-transfer schematics , 1990, IEEE International Symposium on Circuits and Systems.

[4]  Daniel Gajski,et al.  Partitioning algorithms for layout synthesis from register-transfer netlists , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[5]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6]  Daniel D. Gajski,et al.  Synthesis from VHDL , 1988, Proceedings 1988 IEEE International Conference on Computer Design: VLSI.

[7]  David Lawrence Johannsen Silicon compilation , 1989 .