Title :
The prime-graph and Q-sequence for coding the floorplan
Author :
Kajitani, Yoji ; Sakanushi, Keishi
Author_Institution :
Univ. of Kitakyusyu, Fukuoka, Japan
Abstract :
Characterization of the floorplan has been a classical subject in combinatorics and is now a hot topic in VLSI layout design, both towards an efficient generation of floorplans. But so far no promising way has been obtained. This paper presents an answer providing an elegant representation by the name of prime-graph, and mentions an equivalent string code the Q-sequence, which was previously presented. This code has many advantages in handling the floorplans, some of which are briefly mentioned. A review is included on characterization of floorplans since it may be interesting to know how our result revived a historical contribution by Abe (see Journal of Japan Mathematical Physics, vol. 4, no. 4, p. 359-366, 1930)
Keywords :
VLSI; encoding; graph theory; integrated circuit layout; network topology; sequences; Q-sequence; VLSI layout design; equivalent string code; floorplan characterization; floorplan coding; prime graph; Combinatorial mathematics; Computational complexity; Costs; Labeling; Routing; Very large scale integration; Wire;
Conference_Titel :
Circuits and Systems, 2002. ISCAS 2002. IEEE International Symposium on
Conference_Location :
Phoenix-Scottsdale, AZ
Print_ISBN :
0-7803-7448-7
DOI :
10.1109/ISCAS.2002.1010338
