Generating Incremental VLSI Compaction Spacing Constraints,

Abstract

This paper describes using adjacency lists to incrementally generate design rule spacing constraints. The algorithm generates the smallest complete set of constraints for a design, yielding fast compaction, and is as fast or faster than ordinary constraint generation methods even when the incremental features are not used. The adjacency list data structure allows one to very quickly move, insert or delete objects and generate an updated set of constraints.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1986
Accession Number
ADA182460

Entities

People

  • Clyde W. Carpenter
  • Mark Horowitz

Organizations

  • Stanford University

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Automation
  • Crossings
  • Demographic Cohorts
  • Diffusion
  • Fabrication
  • Lists (Data Structures)
  • New Mexico
  • Theses
  • Translations
  • Two Dimensional
  • Universities

Fields of Study

  • Engineering

Readers

  • Database Systems and Applications
  • Graph Algorithms and Convex Optimization.

Technology Areas

  • Space
  • Space - Space Objects
  • Space - Spacecraft Maneuvers