Files in this item
|(no description provided)|
|Title:||Incremental algorithms for General Purpose Layout System|
|Author(s):||Cynn, Myong Heon|
|Doctoral Committee Chair(s):||Kang, Sung Mo|
|Department / Program:||Computer Science|
|Degree Granting Institution:||University of Illinois at Urbana-Champaign|
|Subject(s):||Engineering, Electronics and Electrical
|Abstract:||General Purpose Layout System (GPLS) is proposed as a bidirectional layout conversion system. GPLS can translate layout to stick diagram, stick diagram to layout, layout to layout, mixed input to layout. To achieve these goals, the input format should accept both layout and stick diagram. The corner stitch data structure is used to represent the unified input and output. A new algorithm for area updating of the corner stitch data structure is presented using non-recursive area enumeration. The system consists of three stages: node extraction, constraint generation, and resolution. As a result, the system can be used to apply the new design rules to the existing layouts and to extract the stick diagram from the final layout, as well as to translate the stick diagram into the final layout.
Incremental Layout System is proposed to utilize the previous calculation results for the minor changes in design cycles. In order to limit the search space, the plane generation algorithm is presented. Each stage of GPLS includes incremental algorithms. The incremental approach takes advantage of the maximal horizontal property of the data structure to generate the necessary constraint graph.
|Rights Information:||Copyright 1994 Cynn, Myong Heon|
|Date Available in IDEALS:||2011-05-07|
|Identifier in Online Catalog:||AAI9512342|