Corner Stitching: A Data-Structuring Technique for VLSI Layout Tools

  title={Corner Stitching: A Data-Structuring Technique for VLSI Layout Tools},
  author={John K. Ousterhout},
  journal={IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems},
  • J. Ousterhout
  • Published 1984
  • Computer Science
  • IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Corner stitching is a technique for representing rectangular two-dimensional objects. [] Key Method The algorithms are presented under a simplified model of VLSI circuits, and the storage requirements of the structure are discussed. Corner stitching has been implemented in a working layout editor. Initial measurements indicate that it requires about three times as much memory space as the simplest possible representation.

Expanded rectangles: a new VLSI data structure

  • M. QuayleJon A. Solworth
  • Computer Science
    [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers
  • 1988
Initial measurements indicate that expanded rectangles is a viable data structure for use in a complete VLSI layout system.

Parallel algorithms for corner stitching

This paper develops efficient algorithms for basic corner stitching operations under the message-passing paradigm using C and PVM on a distributed network composed of SUN workstations.

Wall-stitching: yet another data-structuring technique for VLSI tools at both topological and geometric levels

  • C. YingJ.S.L. Wong
  • Computer Science
    Proceedings. VLSI and Computer Peripherals. COMPEURO 89
  • 1989
The experimental results show that the wall-stitching technique helps to solve the misalignment problem in path search in most cases.

Corner-stitched tiles with curved boundaries [circuit layout]

Two generalizations of the classic corner-stitched data structure for planar polygonal layouts to geometrics including circles or arbitrary curved shapes are introduced and analyzed. Such an extended

Corner stitching for L-shaped tiles

  • George BlustD. Mehta
  • Engineering
    [1993] Proceedings Third Great Lakes Symposium on VLSI-Design Automation of High Performance VLSI Systems
  • 1993
The corner-stitching technique proposed by J.K. Ousterhout (1984) is extended for rectangular objects in interactive VLSI layout editors to L-shaped objects, thus providing added flexibility in the

A data-structuring technique for gridded VLSI layouts

  • S. M. HaiderP. Ang
  • Computer Science
    Proceedings of the European Design Automation Conference, 1990., EDAC.
  • 1990
The linked array data structure for storing rectangular structures which are constrained to a grid is presented, which has been used to implement a prototype layout system which has significant memory usage and timing response advantages for large layouts.

The Magic VLSI Layout System

Magic is a new IC layout system that includes several facilities traditionally contained in separate batch-processing programs. Magic incorporates expertise about design rules, connectivity, and

Tailor: a layout system based on trapezoidal corner stitching

A VLSI layout design system named Tailor, which consists of a well-integrated set of tools, including a window-driven editor, an incremental design rule checker, a circuit extractor, a one-dimensional compactor, a channel-based global router, and a transistor size optimizer.

An Efficient Data Structure Layout Design for Spatial Data Organization in Geographic Information System

The aim of this paper is to explore the extent to which the use of Corner Stitching can be helpful in GIS based system.

The MADMACS layout system




Measurements of a VLSI Design

This paper presents data about three facets of a recently-completed VLSI design containing 45000 transistors, showing that composite cells have a different structure from primitive cells, and that, outside of arrays, cells are rarely re-used.

Lyra: A New Approach to Geometric Layout Rule Checking

Lyra is a layout rule checking program for Manhattan VLSI circuits that translates symbolic rules into efficient code for checking those rules, and permits the system to be retargeted for different processes.

The quad-cif tree a data structure for h

The quad-CIF tree data structure is described and it is outlined how one can use the data structure in order to implement hierarchical, on-line design rule checking and node extraction.

Data Structures for Range Searching

The purpose of this paper is to acquaint the reader with the structures currently avadable for solving the particular problem of range searching, and to display a set of general methods for attacking multikey searching problems.

A survey of algorithms and data structures for range searching

A set of “loGical structures” is described and ‘then their implementation in primary and secondary memories is discussed, and a set of algorithms for efficiently answering range queries are surveyed.