A topologically adaptable cellular router

  • Authors:
  • James R. Allen

  • Affiliations:
  • -

  • Venue:
  • DAC '76 Proceedings of the 13th Design Automation Conference
  • Year:
  • 1976

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper describes a printed circuit routing program based on a cellular least-cost path finding algorithm. The program uses four bits of random access storage per cell and provides a mechanism for programming the path-cost function to model a variety of physical constraints.