A hierarchical methodology to improve channel routing by pin permutation

Cliff Yungchin Hou, C. Y.Roger Chen

Research output: Chapter in Book/Entry/PoemConference contribution

3 Scopus citations

Abstract

A hierarchical pin permutation algorithm is presented which is used as a preprocessor of conventional channel routing algorithms. This algorithm determines the proper positions of permutable gates and cell terminals such that the results of the subsequent channel, routing can be significantly improved. First, gates and terminals are interchanged to maximize the number of aligned terminal pairs and reduce the channel density. Then, terminals that are not aligned are interchanged to remove cyclic constraints in the vertical constraint graph (VCG). Experimental results show that the proposed algorithm considerably reduces the number of tracks and vias.

Original languageEnglish (US)
Title of host publication1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers
PublisherIEEE Computer Society
Pages440-443
Number of pages4
ISBN (Print)0818621575
StatePublished - 1992
Event1991 IEEE International Conference on Computer-Aided Design - ICCAD-91 - Santa Clara, CA, USA
Duration: Nov 11 1991Nov 14 1991

Publication series

Name1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers

Other

Other1991 IEEE International Conference on Computer-Aided Design - ICCAD-91
CitySanta Clara, CA, USA
Period11/11/9111/14/91

ASJC Scopus subject areas

  • General Engineering

Fingerprint

Dive into the research topics of 'A hierarchical methodology to improve channel routing by pin permutation'. Together they form a unique fingerprint.

Cite this