Non-stacked-via maze ruting for module generation

모듈 합성을 위한 비아 겹침이 없는 미로 배선

  • 권성훈 (한양대학교 전자공학과) ;
  • 오명섭 (한양대학교 전자공학과) ;
  • 신현철 (한양대학교 전자공학과)
  • Published : 1995.01.01

Abstract

For effective module generation, a detailed router which can handle complicated routing regions on multimple layers of interconnection under various constraints is necessary. In this paper, a new improved maze routing technique is described, which can find the shortest path for each net without allowing stacked vias. In this method, two cost values are stored at each grid point. The cost values represent the routing costs from the terminal of the net being routed to the grid point. One cost value shows the cost of the shortest path without making a via at the grid point and the other cost value shows that with making a via at the grid point. This is the first systematic maze routing technique which can find the shortest path without via-stacking.

Keywords