Issue No. 12 - December (1986 vol. 35)
M.S. Krishnan , Xerox Corporation
A new methodology for the layout design of several classes of useful VLSI structures is proposed. The approach produces a structured layout for commonly found computation structures, using regular elements called layout slices. Algorithms for optimal array realization are described that offer several significant advantages over existing layout schemes. Any network that can be decomposed into instances of these structures can therefore be realized using layout slices. Algorithms for the array realization of a class of arbitrary networks are also described. Several well-known structures such as trees, carry-save adders and cube-connected cycles can be realized using the proposed array layout methodology, not only with optimal area but also with several features necessary for practical implementation, e.g., access to key nodes, high area utilization and global signal routing. The proposed methodology is illustrated with actual layouts of useful circuits.
VLSI design, Area-efficient layouts, array realization, binary adder, carry-save adder, integrated circuit layout, layout algorithms, layout complexity, minimum spanning tree, tree networks
J. Hayes and M. Krishnan, "An Array Layout Methodology for VLSI Circuits," in IEEE Transactions on Computers, vol. 35, no. , pp. 1055-1067, 1986.