Cell area minimization by transistor folding

T. W. Her, D. F. Wong

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

Abstract

Tall transistors can be folded into shorter ones to reduce the layout area. In this paper, we are given two rows of transistors, one for P-type transistors and the other for N-type transistors, and our objective is to determine an optimal folding for each transistor to minimize the layout area. We present a time transistor folding algorithm to minimize the layout area relating the parameter K which is the number of implementations of each transistor due to folding, and L considered here the channel length.

Original languageEnglish (US)
Title of host publicationEuropean Design Automation Conference - Proceedings
Editors Anon
PublisherPubl by IEEE
Pages172-177
Number of pages6
ISBN (Print)0818643528
StatePublished - Dec 1 1993
Externally publishedYes

Publication series

NameEuropean Design Automation Conference - Proceedings

ASJC Scopus subject areas

  • Control and Systems Engineering

Fingerprint Dive into the research topics of 'Cell area minimization by transistor folding'. Together they form a unique fingerprint.

  • Cite this

    Her, T. W., & Wong, D. F. (1993). Cell area minimization by transistor folding. In Anon (Ed.), European Design Automation Conference - Proceedings (pp. 172-177). (European Design Automation Conference - Proceedings). Publ by IEEE.