• DocumentCode
    2092813
  • Title

    Solution of a module orientation and rotation problem

  • Author

    Yao, Xianjin ; Liu, C.L.

  • Author_Institution
    Dept. of Comput. Sci., Illinois Univ., Urbana-Champaign, IL, USA
  • fYear
    1990
  • fDate
    12-15 Mar 1990
  • Firstpage
    584
  • Lastpage
    588
  • Abstract
    The authors study a module orientation and rotation problem. They assume that a set of rectangular modules has been placed according to proximity requirements while they 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. They propose a fast heuristic algorithm to solve the problem, minimising the total length of the connecting wires. Their algorithm produces very good experimental results in no more than two minutes of computation time for problems with hundreds and even thousands of modules
  • Keywords
    circuit layout CAD; fast heuristic algorithm; module orientation; proximity requirements; rotation problem; Bismuth; Computer science; Heuristic algorithms; Joining processes; Pins; Wires;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Design Automation Conference, 1990., EDAC. Proceedings of the European
  • Conference_Location
    Glasgow
  • Print_ISBN
    0-8186-2024-2
  • Type

    conf

  • DOI
    10.1109/EDAC.1990.136714
  • Filename
    136714