| Automatic layout algorithms for function blocks of CMOS gate arrays |
| Full text |
Pdf
(621 KB)
|
| Source
|
Annual ACM IEEE Design Automation Conference
archive
Proceedings of the 22nd ACM/IEEE Design Automation Conference
table of contents
Las Vegas, Nevada, United States
Pages: 46 - 52
Year of Publication: 1985
ISBN:0-8186-0635-5
|
|
Authors
|
|
Shigeo Noda
|
VLSI Development Division, NEC Corporation, Kawasaki, 211 Japan
|
|
Hitoshi Yoshizawa
|
VLSI Development Division, NEC Corporation, Kawasaki, 211 Japan
|
|
Etsuko Fukuda
|
VLSI Development Division, NEC Corporation, Kawasaki, 211 Japan
|
|
Haruo Kato
|
VLSI Development Division, NEC Corporation, Kawasaki, 211 Japan
|
|
Hiroshi Kawanishi
|
VLSI Development Division, NEC Corporation, Kawasaki, 211 Japan
|
|
Takashi Fujii
|
Faculty of Engineering, Hiroshima University, Higashi-hiroshima, 724 Japan
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 1, Downloads (12 Months): 6, Citation Count: 1
|
|
|
ABSTRACT
Automatic layout algorithms, placement and routing, for function blocks of CMOS gate arrays are presented.
The placement algorithm assigns transistors to basic cells so as to minimize the number of cells used and to minimize the number of interconnections crossing cut-lines. The former objective is achieved by finding a maximum matching and the latter is achieved by iterative interchanges of transistor pairs. A new routing technique based on channel routing methods is introduced to handle the internal cell area. It intends to route with the primary use of the first layer and with the least use of tracks.
A program based on the algorithms has been developed and applied to many block designs for up to 200 transistors. The results show that the presented algorithms could realize as good a layout as manual.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
S. Yabe, et al., "MASTER2:A Hierarchical Layout System for Gate Arrays," Proc. ICCAD, pp46-48, (1983)
|
| |
2
|
H. Miyashita, et al., "Cell Pattern Generation for CMOS Masterslice LSI," Trans. IECE, VoI.J66-C No.12, ppi140-i147 (1983) (in Japanese)
|
| |
3
|
|
| |
4
|
|
| |
5
|
|
| |
6
|
S. Even, et al., An O(N2"5) Algorithm for Maximum Matching in General Graphs," 16th Annual Symp. on Foundation of Computer Science, ppl00-112 (1975)
|
Peer to Peer - Readers of this Article have also read:
-
Data structures for quadtree approximation and compression
Communications of the ACM
28, 9
Hanan Samet
-
A hierarchical single-key-lock access control using the Chinese remainder theorem
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee
, Huizhu Lu
, D. D. Fisher
-
The GemStone object database management system
Communications of the ACM
34, 10
Paul Butterworth
, Allen Otis
, Jacob Stein
-
Putting innovation to work: adoption strategies for multimedia communication systems
Communications of the ACM
34, 12
Ellen Francik
, Susan Ehrlich Rudman
, Donna Cooper
, Stephen Levine
-
An intelligent component database for behavioral synthesis
Proceedings of the 27th ACM/IEEE Design Automation Conference on
Gwo-Dong Chen
, Daniel D. Gajski
|