DocumentCode
3342089
Title
Incremental node extraction algorithms for incremental layout system
Author
Cynn, Myong H. ; Kang, S.M.
Author_Institution
Coordinated Sci. Lab., Illinois Univ., Champaign, IL, USA
Volume
3
fYear
1995
fDate
30 Apr-3 May 1995
Firstpage
1691
Abstract
In this paper, we propose incremental node extraction algorithms for incremental layout system. The algorithms are based on corner stitching data structure. The algorithm for insertion visits each connected tile the recursively with depth-first search while the algorithm for deletion uses the expanded area enumeration. To warrant the local searching space for the incremental constraint generation, planes are generated from the given design rules and used for incremental node extraction
Keywords
circuit layout CAD; data structures; integrated circuit layout; IC layout; corner stitching data structure; depth-first search; expanded area enumeration; incremental constraint generation; incremental layout system; incremental node extraction algorithms; local searching space; Circuits; Compaction; Data mining; Data structures; Tiles;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1995. ISCAS '95., 1995 IEEE International Symposium on
Conference_Location
Seattle, WA
Print_ISBN
0-7803-2570-2
Type
conf
DOI
10.1109/ISCAS.1995.523737
Filename
523737
Link To Document