Solution of a module orientation and rotation problem

  • Authors:
  • Xianjin Yao;C. L. Liu

  • Affiliations:
  • University of Illinois at Urbana-Champaign, Urbana, Illinois;University of Illinois at Urbana-Champaign, Urbana, Illinois

  • Venue:
  • EURO-DAC '90 Proceedings of the conference on European design automation
  • Year:
  • 1990

Quantified Score

Hi-index 0.00

Visualization

Abstract

We study in this paper a module orientation and rotation problem. We assume that a set of rectangular modules has been placed according to proximity requirements while we still have the freedom to choose the orientation of the modules, to rotate the modules, and to shift the pins along the boundary of each module. We propose a fast heuristic algorithm to solve the problem, minimizing the total length of the connecting wires. Our algorithm produces very good experimental results in no more than two minutes to computation time for problems with hundreds and even thousands of modules.