Proceedings of International Conference on Computer Aided Design
DOI: 10.1109/iccad.1996.571346
|View full text |Cite
|
Sign up to set email alerts
|

Width minimization of two-dimensional CMOS cells using integer programming

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
17
0

Publication Types

Select...
5

Relationship

1
4

Authors

Journals

citations
Cited by 15 publications
(17 citation statements)
references
References 13 publications
0
17
0
Order By: Relevance
“…Gupta and Hayes [3] [4] proposed the CMOS cell width minimization via Integer Linear Programming (ILP). This method solves the width minimization of two dimensional transistor placement exactly.…”
Section: Imentioning
confidence: 99%
See 2 more Smart Citations
“…Gupta and Hayes [3] [4] proposed the CMOS cell width minimization via Integer Linear Programming (ILP). This method solves the width minimization of two dimensional transistor placement exactly.…”
Section: Imentioning
confidence: 99%
“…The layouts generated by our method are equal to or smaller than the one dimensional layout generated by Gupta and Hayes' method [3] which treats complementary P-/NMOSFETs pair. For example the width of the full adder fad1 in Table II is 15 using our method whereas the minimum width of the one dimensional layout of the full adder described in [3] is 16.…”
Section: E Rmentioning
confidence: 99%
See 1 more Smart Citation
“…In the same manner as stated in [10], we summarize in Table I the assumptions underlying the 2-D array layout. Fig.…”
Section: B Layout Generationmentioning
confidence: 99%
“…An Integer Linear Programming(ILP) method is used in the automatic layout generation of CMOS cells [10], where the 2-D array height minimization problem for CMOS cells is dened as a covering problem { a subset of chains that covers each transistor and has the minimum cell height, needs to be determined. However, the set of all chains which are generated from an n-side graph is too large to be solved by ILP.…”
Section: B Layout Generationmentioning
confidence: 99%