Semi-detailed bus routing with variation reduction

  • Authors:
  • Fan Mo;Robert K. Brayton

  • Affiliations:
  • Synplicity, Sunnyvale, CA;UC Berkeley, Berkeley, CA

  • Venue:
  • Proceedings of the 2007 international symposium on Physical design
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

A bus routing algorithm is presented which not only minimizes wire length but also selects the bits in the bus to avoid twisting and conflicts. The resulting bus routes are regular, thus having strong immunity to variations. Minimization for wire length/delay differences between different bits is also implemented.