Optimal orientations of transistor chains

T.W. Her, D.F. Wong, T.H. Freeman

Research output: Chapter in book/report/conference proceedingConference proceeding

3 Citations (Scopus)


A description is given of an O(NL+L log L) time algorithm, where N is the total number of transistor chains and L is the channel length, to determine the orientation of each transistor chain such that the channel density is minimized. It is shown that the problem of flipping chains and subchains to minimize channel density can also be solved optimally. Finally, it is observed that the algorithm can be used to optimally solve a generalized channel routing problem. The algorithm has been implemented in the custom cell synthesis system of the MCC Physical Satellite. For the cells selected from industry, the algorithm reduced channel density by 18%. They also tested the algorithm on several channel routing problems and reductions of up to 30% in channel density were obtained.
Original languageEnglish
Title of host publication1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers
Number of pages4
ISBN (Print)0818620552
Publication statusPublished - 15 Nov 1990
Event1990 IEEE International Conference on Computer-Aided Design, ICCAD 1990 - Santa Clara, United States
Duration: 11 Nov 199015 Nov 1990

Publication series

NameIEEE International Conference on Computer-Aided Design


Conference1990 IEEE International Conference on Computer-Aided Design, ICCAD 1990
Country/TerritoryUnited States
CitySanta Clara
Internet address

User-Defined Keywords

  • Routing
  • Transistors
  • Drives
  • Testing
  • Polynomials


Dive into the research topics of 'Optimal orientations of transistor chains'. Together they form a unique fingerprint.

Cite this