Structured Placement with Topological Regularity Evaluation

This paper introduces a new concept of floorplanning and block placement, called structured placement. Regularity is a key criterion of structured placement so that placement can make progress beyond constraint-driven approaches. This paper formulates the topological regularity that is extractable from a sequence-pair. Regular structures like arrays and rows are defined on a single-sequence that is a kind of standard representation of a sequence-pair. We extract regular structures from a single-sequence in 0(n), and then evaluate the structures by quantifying the regularity as an objective function. Besides, we propose a new simulated annealing (SA) framework, called dual SA, where we convey a constructive feature to an SA framework, so that it attains a placement balancing the size of regular structures against the area efficiency. In experiments, we apply our structured placement to analog block designs, and reveal the definite advantage that our placements contain many regular structures such as rows and arrays without increasing the chip area and the wire length, compared to the existing placement.

[1]  Takeshi Yoshimura,et al.  An O-tree representation of non-slicing floorplan and its applications , 1999, DAC '99.

[2]  Yoji Kajitani,et al.  Theory of T-junction floorplans in terms of single-sequence , 2004, 2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512).

[3]  Yoji Kajitani,et al.  VLSI module placement based on rectangle-packing by the sequence-pair , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[4]  Yici Cai,et al.  Corner block list: an effective and efficient topological representation of non-slicing floorplan , 2000, IEEE/ACM International Conference on Computer Aided Design. ICCAD - 2000. IEEE/ACM Digest of Technical Papers (Cat. No.00CH37140).

[5]  C. L. Liu,et al.  A New Algorithm for Floorplan Design , 1986, DAC 1986.

[6]  Yoji Kajitani,et al.  Module packing based on the BSG-structure and IC layout applications , 1998, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[7]  Yoji Kajitani,et al.  A device-level placement with multi-directional convex clustering , 2004, GLSVLSI '04.

[8]  Dinesh P. Mehta,et al.  The quarter-state-sequence floorplan representation , 2003 .

[9]  Yoji Kajitani,et al.  Multi-level placement with circuit schema based clustering in analog IC layouts , 2004 .

[10]  Yao-Wen Chang,et al.  TCG: A transitive closure graph-based representation for general floorplans , 2005, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[11]  Yao-Wen Chang,et al.  TCG-S: orthogonal coupling of P/sup */-admissible representations for general floorplans , 2002, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[12]  Chikaaki Kodama,et al.  Selected sequence-pair: an efficient decodable packing representation in linear time using sequence-pair , 2003, ASP-DAC '03.

[13]  Yao-Wen Chang,et al.  B*-Trees: a new representation for non-slicing floorplans , 2000, DAC.

[14]  Yao-Wen Chang,et al.  TCG-S: orthogonal coupling of P/sup */-admissible representations for general floorplans , 2004, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..