Optimal orientations of transistor chains

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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. They have implemented their algorithm 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 (US)
Title of host publication1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers
PublisherPubl by IEEE
Pages524-527
Number of pages4
ISBN (Print)0818620552
StatePublished - Dec 1 1990
Externally publishedYes
Event1990 IEEE International Conference on Computer-Aided Design - ICCAD-90 - Santa Clara, CA, USA
Duration: Nov 11 1990Nov 15 1990

Publication series

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

Other

Other1990 IEEE International Conference on Computer-Aided Design - ICCAD-90
CitySanta Clara, CA, USA
Period11/11/9011/15/90

Fingerprint

Transistors
Satellites
Industry

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Her, T. W., Wong, D. F., & Freeman, T. H. (1990). Optimal orientations of transistor chains. In 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers (pp. 524-527). (1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers). Publ by IEEE.

Optimal orientations of transistor chains. / Her, T. W.; Wong, D. F.; Freeman, T. H.

1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers. Publ by IEEE, 1990. p. 524-527 (1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Her, TW, Wong, DF & Freeman, TH 1990, Optimal orientations of transistor chains. in 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers. 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers, Publ by IEEE, pp. 524-527, 1990 IEEE International Conference on Computer-Aided Design - ICCAD-90, Santa Clara, CA, USA, 11/11/90.
Her TW, Wong DF, Freeman TH. Optimal orientations of transistor chains. In 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers. Publ by IEEE. 1990. p. 524-527. (1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers).
Her, T. W. ; Wong, D. F. ; Freeman, T. H. / Optimal orientations of transistor chains. 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers. Publ by IEEE, 1990. pp. 524-527 (1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers).
@inproceedings{33be28df490843b1b942bf13f21ba269,
title = "Optimal orientations of transistor chains",
abstract = "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. They have implemented their algorithm 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.",
author = "Her, {T. W.} and Wong, {D. F.} and Freeman, {T. H.}",
year = "1990",
month = "12",
day = "1",
language = "English (US)",
isbn = "0818620552",
series = "1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers",
publisher = "Publ by IEEE",
pages = "524--527",
booktitle = "1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers",

}

TY - GEN

T1 - Optimal orientations of transistor chains

AU - Her, T. W.

AU - Wong, D. F.

AU - Freeman, T. H.

PY - 1990/12/1

Y1 - 1990/12/1

N2 - 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. They have implemented their algorithm 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.

AB - 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. They have implemented their algorithm 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.

UR - http://www.scopus.com/inward/record.url?scp=0025536227&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0025536227&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0025536227

SN - 0818620552

T3 - 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers

SP - 524

EP - 527

BT - 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers

PB - Publ by IEEE

ER -