Pin assignment with global routing for VLSI building block layout

In this paper, we will consider global routing and pin assignment in VLSI building block layout, and present an efficient algorithm which integrates global routing, pin assignment, block reshaping and positioning. The general flow of the proposed algorithm is the same as the one proposed in by Cong in 1991 [1] and consists of two main phases. The first phase is to determine not only global routes and coarse pin assignment in the same way as [1], but also shapes and positions of blocks. The second phase is to compute the final pin assignment for channels. We generalize the channel pin assignment (CPA) problem in [1], in which the CPA problem is formulated for only channels formed by two blocks, to the CPA problem for channels formed by multiple blocks. We will propose a linear time optimal channel pin assignment algorithm, which is an extension of the algorithm in [1]. Experimental results show the effectiveness of the proposed algorithm.

[1]  Jason Cong,et al.  Pin assignment with global routing for general cell designs , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[2]  Prithviraj Banerjee,et al.  ESp: Placement by simulated evolution , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[3]  Chak-Kuen Wong,et al.  Optimal Wiring of Movable Terminals , 1983, IEEE Transactions on Computers.

[4]  Shin'ichi Wakabayashi,et al.  An integrated approach to pin assignment and global routing for VLSI building-block layout , 1993, 1993 European Conference on Design Automation with the European Event in ASIC Design.

[5]  Jason Cong,et al.  A provable near-optimal algorithm for the channel pin assignment problem , 1991, [1991 Proceedings] IEEE International Conference on Computer Design: VLSI in Computers and Processors.

[6]  John J. Shedletsky,et al.  An Experimental Delay Test Generator for LSI Logic , 1980, IEEE Transactions on Computers.

[7]  Sudhakar M. Reddy,et al.  On Delay Fault Testing in Logic Circuits , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[8]  Corot W. Starke,et al.  Built-In Test for CMOS Circuits , 1984, ITC.

[9]  Slawomir Pilarski,et al.  BIST and delay fault detection , 1993, Proceedings of IEEE International Test Conference - (ITC).

[10]  C. L. Liu,et al.  A new approach to the pin assignment problem , 1988, DAC '88.

[11]  Ronald L. Rivest,et al.  A "Greedy" Channel Router , 1982, DAC 1982.

[12]  Tetsuo Asano,et al.  Routing Region Definition and Ordering Scheme for Building-Block Layout , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[13]  C. L. Liu,et al.  Permutation Channel Routing , 1988 .

[14]  Yang Cai,et al.  Optimal channel pin assignment , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[15]  Malgorzata Marek-Sadowska,et al.  Floorplanning with pin assignment , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[16]  Sudhakar M. Reddy,et al.  On path selection in combinational logic circuits , 1988, DAC '88.

[17]  Yang Cai,et al.  Channel density minimization by pin permutation , 1992, Proceedings 1992 IEEE International Conference on Computer Design: VLSI in Computers & Processors.

[18]  Gordon L. Smith,et al.  Model for Delay Faults Based upon Paths , 1985, ITC.

[19]  David N. Deutsch,et al.  A “DOGLEG” channel router , 1976, DAC '76.

[20]  Shu Lin,et al.  Error control coding : fundamentals and applications , 1983 .

[21]  Jacob Savir,et al.  AT-SPEED TEST IS NOT NECESSARILY AN AC TEST , 1991, 1991, Proceedings. International Test Conference.

[22]  Abraham Lempel,et al.  Design of universal test sequences for VLSI , 1985, IEEE Trans. Inf. Theory.

[23]  R.L. Rivest,et al.  A "Greedy" Channel Router , 1982, 19th Design Automation Conference.

[24]  Ralph Michael Kling,et al.  Placement by Simulated Evolution , 1987 .

[25]  Thomas Lengauer,et al.  Combinatorial algorithms for integrated circuit layout , 1990, Applicable theory in computer science.

[26]  Shin'ichi Wakabayashi,et al.  An optimal channel pin assignment with multiple intervals for building block layout , 1992, Proceedings EURO-DAC '92: European Design Automation Conference.

[27]  H. Nelson Brady.  An Approach to Topological Pin Assignment , 1984, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[28]  Edward J. McCluskey.  Verification Testing - A Pseudoexhaustive Test Technique , 1984, IEEE Trans. Computers.

[29]  Ioannis G. Tollis,et al.  River routing and density minimization for channels with interchangeable terminals , 1993, Integr..

[30]  Ron Y. Pinter,et al.  On minimizing channel density by lateral shifting , 1983 .

[31]  Nobuyuki Nishiguchi,et al.  A VLSI floorplanner based on 'balloon' expansion , 1990, Proceedings of the European Design Automation Conference, 1990., EDAC..

[32]  Martin D. F. Wong,et al.  Channel ordering for VLSI layout with rectilinear modules , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[33]  Spyros Tragoudas,et al.  Interchanging terminals for improved channel routing , 1990, IEEE International Symposium on Circuits and Systems.