Optimal module implementation and its application to transistor placement

T. W. Her, D. F. Wong

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

Abstract

The authors present an algorithm for selecting implementations for rectangular modules given a placement of the modules in multiple rows. A module is a rectangle with terminals located on the top and the bottom edges. An implementation of a module is specified by its dimension and a placement of the terminals along the top and bottom edges of the module. The algorithm accepts as input a placement of the modules and a set of possible implementations of each module, and selects an implementation for each module to minimize the total height of the layout. The time complexity of the algorithm is specified. The authors also present two extensions of the algorithm. The algorithm can be applied to CMOS transistor placement and has been implemented in the custom cell synthesis system of the MCC Physical Satellite. The algorithm was tested on cells selected from the MCNC benchmarks and industry, and reductions of up to 19% in layout area were obtained.

Original languageEnglish (US)
Title of host publication1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers
PublisherPubl by IEEE
Pages98-101
Number of pages4
ISBN (Print)0818621575
StatePublished - Dec 1 1992
Externally publishedYes
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

Fingerprint

Transistors
Satellites
Industry

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Her, T. W., & Wong, D. F. (1992). Optimal module implementation and its application to transistor placement. In 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers (pp. 98-101). (1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers). Publ by IEEE.

Optimal module implementation and its application to transistor placement. / Her, T. W.; Wong, D. F.

1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers. Publ by IEEE, 1992. p. 98-101 (1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers).

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

Her, TW & Wong, DF 1992, Optimal module implementation and its application to transistor placement. in 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers. 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers, Publ by IEEE, pp. 98-101, 1991 IEEE International Conference on Computer-Aided Design - ICCAD-91, Santa Clara, CA, USA, 11/11/91.
Her TW, Wong DF. Optimal module implementation and its application to transistor placement. In 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers. Publ by IEEE. 1992. p. 98-101. (1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers).
Her, T. W. ; Wong, D. F. / Optimal module implementation and its application to transistor placement. 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers. Publ by IEEE, 1992. pp. 98-101 (1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers).
@inproceedings{5085b4a24c1a43d3a3094889b29e41fa,
title = "Optimal module implementation and its application to transistor placement",
abstract = "The authors present an algorithm for selecting implementations for rectangular modules given a placement of the modules in multiple rows. A module is a rectangle with terminals located on the top and the bottom edges. An implementation of a module is specified by its dimension and a placement of the terminals along the top and bottom edges of the module. The algorithm accepts as input a placement of the modules and a set of possible implementations of each module, and selects an implementation for each module to minimize the total height of the layout. The time complexity of the algorithm is specified. The authors also present two extensions of the algorithm. The algorithm can be applied to CMOS transistor placement and has been implemented in the custom cell synthesis system of the MCC Physical Satellite. The algorithm was tested on cells selected from the MCNC benchmarks and industry, and reductions of up to 19{\%} in layout area were obtained.",
author = "Her, {T. W.} and Wong, {D. F.}",
year = "1992",
month = "12",
day = "1",
language = "English (US)",
isbn = "0818621575",
series = "1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers",
publisher = "Publ by IEEE",
pages = "98--101",
booktitle = "1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers",

}

TY - GEN

T1 - Optimal module implementation and its application to transistor placement

AU - Her, T. W.

AU - Wong, D. F.

PY - 1992/12/1

Y1 - 1992/12/1

N2 - The authors present an algorithm for selecting implementations for rectangular modules given a placement of the modules in multiple rows. A module is a rectangle with terminals located on the top and the bottom edges. An implementation of a module is specified by its dimension and a placement of the terminals along the top and bottom edges of the module. The algorithm accepts as input a placement of the modules and a set of possible implementations of each module, and selects an implementation for each module to minimize the total height of the layout. The time complexity of the algorithm is specified. The authors also present two extensions of the algorithm. The algorithm can be applied to CMOS transistor placement and has been implemented in the custom cell synthesis system of the MCC Physical Satellite. The algorithm was tested on cells selected from the MCNC benchmarks and industry, and reductions of up to 19% in layout area were obtained.

AB - The authors present an algorithm for selecting implementations for rectangular modules given a placement of the modules in multiple rows. A module is a rectangle with terminals located on the top and the bottom edges. An implementation of a module is specified by its dimension and a placement of the terminals along the top and bottom edges of the module. The algorithm accepts as input a placement of the modules and a set of possible implementations of each module, and selects an implementation for each module to minimize the total height of the layout. The time complexity of the algorithm is specified. The authors also present two extensions of the algorithm. The algorithm can be applied to CMOS transistor placement and has been implemented in the custom cell synthesis system of the MCC Physical Satellite. The algorithm was tested on cells selected from the MCNC benchmarks and industry, and reductions of up to 19% in layout area were obtained.

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

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

M3 - Conference contribution

AN - SCOPUS:0027045307

SN - 0818621575

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

SP - 98

EP - 101

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

PB - Publ by IEEE

ER -