Efficient shape curve construction in floorplan design

Ting Chi Wang; D.F. Wong

doi:10.1109/EDAC.1991.206424

Efficient shape curve construction in floorplan design

Ting Chi Wang, D.F. Wong

Office of the Provost

Research output: Chapter in book/report/conference proceeding › Conference proceeding › peer-review

3 Citations (Scopus)

Abstract

The authors present an efficient algorithm to construct shape curves for VLSI floorplans. Their algorithm is based on extensions of a tree-restructuring technique and a curve-adding technique. They assume each module in the floorplan has an infinite number of non-redundant implementations specified (or approximated) by a piecewise linear decreasing shape curve. Their algorithm constructs a shape curve that contains all non-redundant implementations of the floorplan. Experimental results indicate that the algorithm performs well.

Original language	English
Title of host publication	Proceedings of the European Conference on Design Automation
Publisher	IEEE
Pages	356-360
Number of pages	5
ISBN (Print)	9780818621307
DOIs	https://doi.org/10.1109/EDAC.1991.206424
Publication status	Published - 28 Feb 1991
Event	1991 European Design Automation Conference, EDAC 1991 - Amsterdam, Netherlands Duration: 25 Feb 1991 → 28 Feb 1991 https://ieeexplore.ieee.org/xpl/conhome/884/proceeding

Publication series

Name	Proceedings of European Conference on Design Automation

Conference

Conference	1991 European Design Automation Conference, EDAC 1991
Country/Territory	Netherlands
City	Amsterdam
Period	25/02/91 → 28/02/91
Internet address	https://ieeexplore.ieee.org/xpl/conhome/884/proceeding

User-Defined Keywords

Shape
Piecewise linear techniques
Topology
Design optimization
Tree graphs
Wheels
Very large scale integration
Algorithm design and analysis
Polynomials

Access to Document

10.1109/EDAC.1991.206424

Cite this

@inproceedings{91ce23c98d9b448fabc7e6e69c05e623,

title = "Efficient shape curve construction in floorplan design",

abstract = "The authors present an efficient algorithm to construct shape curves for VLSI floorplans. Their algorithm is based on extensions of a tree-restructuring technique and a curve-adding technique. They assume each module in the floorplan has an infinite number of non-redundant implementations specified (or approximated) by a piecewise linear decreasing shape curve. Their algorithm constructs a shape curve that contains all non-redundant implementations of the floorplan. Experimental results indicate that the algorithm performs well.",

keywords = "Shape, Piecewise linear techniques, Topology, Design optimization, Tree graphs, Wheels, Very large scale integration, Algorithm design and analysis, Polynomials",

author = "Wang, {Ting Chi} and D.F. Wong",

note = "This work was partially supported by the National Science Foundation under grant MIP-8909586, by the Texas Advanced Research Program under grant 4096, and by an IBM Faculty Development Award.; 1991 European Design Automation Conference, EDAC 1991 ; Conference date: 25-02-1991 Through 28-02-1991",

year = "1991",

month = feb,

day = "28",

doi = "10.1109/EDAC.1991.206424",

language = "English",

isbn = "9780818621307",

series = "Proceedings of European Conference on Design Automation",

publisher = "IEEE",

pages = "356--360",

booktitle = "Proceedings of the European Conference on Design Automation",

address = "United States",

url = "https://ieeexplore.ieee.org/xpl/conhome/884/proceeding",

}

TY - GEN

T1 - Efficient shape curve construction in floorplan design

AU - Wang, Ting Chi

AU - Wong, D.F.

N1 - This work was partially supported by the National Science Foundation under grant MIP-8909586, by the Texas Advanced Research Program under grant 4096, and by an IBM Faculty Development Award.

PY - 1991/2/28

Y1 - 1991/2/28

N2 - The authors present an efficient algorithm to construct shape curves for VLSI floorplans. Their algorithm is based on extensions of a tree-restructuring technique and a curve-adding technique. They assume each module in the floorplan has an infinite number of non-redundant implementations specified (or approximated) by a piecewise linear decreasing shape curve. Their algorithm constructs a shape curve that contains all non-redundant implementations of the floorplan. Experimental results indicate that the algorithm performs well.

AB - The authors present an efficient algorithm to construct shape curves for VLSI floorplans. Their algorithm is based on extensions of a tree-restructuring technique and a curve-adding technique. They assume each module in the floorplan has an infinite number of non-redundant implementations specified (or approximated) by a piecewise linear decreasing shape curve. Their algorithm constructs a shape curve that contains all non-redundant implementations of the floorplan. Experimental results indicate that the algorithm performs well.

KW - Shape

KW - Piecewise linear techniques

KW - Topology

KW - Design optimization

KW - Tree graphs

KW - Wheels

KW - Very large scale integration

KW - Algorithm design and analysis

KW - Polynomials

UR - https://ieeexplore.ieee.org/document/206424/

UR - https://dl.acm.org/doi/10.5555/951513.951590

U2 - 10.1109/EDAC.1991.206424

DO - 10.1109/EDAC.1991.206424

M3 - Conference proceeding

SN - 9780818621307

T3 - Proceedings of European Conference on Design Automation

SP - 356

EP - 360

BT - Proceedings of the European Conference on Design Automation

PB - IEEE

T2 - 1991 European Design Automation Conference, EDAC 1991

Y2 - 25 February 1991 through 28 February 1991

ER -

Efficient shape curve construction in floorplan design

Abstract

Publication series

Conference

User-Defined Keywords

Access to Document

Other files and links

Fingerprint

Cite this