Solutions to the module orientation and rotation problems by neural computation networks

Authors:
R. Libeskind-Hadas;C. L. Liu
Affiliations:
Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL;Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL
Venue:
DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
Year:
1989

Citing 2
Cited 8

A new approach to the pin assignment problem

DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

NP-Hard Module Rotation Problems

IEEE Transactions on Computers
A simple yet effective genetic approach for the orientation assignment on cell-based layout

VLSID '96 Proceedings of the 9th International Conference on VLSI Design: VLSI in Mobile Communication
Solution of a module orientation and rotation problem

EURO-DAC '90 Proceedings of the conference on European design automation
Wirelength optimization by optimal block orientation

ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
Optimal cell flipping in placement and floorplanning

Proceedings of the 43rd annual Design Automation Conference
Block flipping and white space distribution for wirelength minimization

Integration, the VLSI Journal
Paper: An application of neural networks on channel routing problem

Parallel Computing
Application of a novel evolutionary neural network for macro-cell placement optimization in VLSI physical design

ICIC'06 Proceedings of the 2006 international conference on Intelligent Computing - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we study two strategies for modifying a given placement of modules in order to improve the quality of the routing results in the next stage of design. We assume that the modules have already been placed. The first strategy seeks to minimize the total wire length by flipping each module about its vertical and/or horizontal axes of symmetry. The second strategy seeks to minimize the total wire length by rotating each module by a multiple of 90 degrees. We introduce a new algorithm based on the Hopfield-Tank neural-net model to solve these problems. Our algorithm performs better than the best algorithms known for these problems. Both problems are shown to be NP-Complete.