ACM Home Page
Please provide us with feedback. Feedback
Analog performance space exploration by Fourier-Motzkin elimination with application to hierarchical sizing
Full text PdfPdf (877 KB)
Source International Conference on Computer Aided Design archive
Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design table of contents
Pages: 847 - 854  
Year of Publication: 2004
ISBN:0-7803-8702-3
Authors
G. Stehr  Inst. for Electron. Design Autom., TU Munich, Germany
H. Graeb  Inst. for Electron. Design Autom., TU Munich, Germany
K. Antreich  Inst. for Electron. Design Autom., TU Munich, Germany
Publisher
IEEE Computer Society  Washington, DC, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 24,   Citation Count: 7
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: 10.1109/ICCAD.2004.1382693

ABSTRACT

Analog performance space exploration identifies the range of feasible performance values of a given circuit topology. It is an extremely challenging task of great importance to topology selection and hierarchical sizing. In this paper, a novel technique for the efficient simulation-based exploration of high-dimensional performance spaces is presented. To this end, fundamental circuit design knowledge is described by constraint functions. Based on a linearization of the latter and of the circuit performance functions, a description of the feasible performance range in the form of a polytope is derived. Moreover, the approach is integrated into a hierarchical sizing method, where it propagates topological and technological constraints bottom-up. Practical application results demonstrate the efficiency and usefulness of the new method.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
[1] H. Chang, E. Charbon, U. Choudhury, A. Demir, E. Felt, E. Liu, E. Malavasi, A. Sangiovanni-Vincentelli, and I. Vassiliou. A Top-Down, Constraint-Driven Design Methodology for Analog Integrated Circuits. Kluwer Acad. Pub., 1997.
 
2
[2] T. Christof and G. Reinelt. Combinatorial optimization and small polytopes. Top (Spanish Statistical and Operations Research Society), 1996.
 
3
[3] G. Dantzig and B. Eaves. Fourier-Motzkin elimination and its dual. Journal of Combinatorial Theory (A), 1973.
4
5
 
6
[6] M. del Mar Hershenson, S. P. Boyd, and T. H. Lee. Optimal design of a CMOS Op-Amp via geometric programming. IEEE Trans. CAD, 2001.
 
7
[7] A. Fuad Mas'ud, T. Ohtsuka, and H. Kunieda. Translation of specifications in hierarchical analog LSI design. In IEEE ISCAS, 1996.
 
8
[8] G. J. Gómez, S. H. K. Embabi, E. Sánchez-Sinencio, and M. C. Lefebvre. A nonlinear macromodel for CMOS OTAs. In IEEE ISCAS, 1995.
 
9
 
10
[10] R. Harjani, R. Rutenbar, and L. Carley. OASYS: A framework for analog circuit synthesis. IEEE Trans. CAD, 1989.
 
11
 
12
[12] M. Jimenez, J. Llaberia, and A. Fernandez. Loop bounds computation for multilevel tiling. In Sixth Euromicro Workshop on Parallel and Distributed Processing, 1998.
 
13
[13] B. D. Smedt and G. G. E. Gielen, WATSON: Design space boundary exploration and model generation for analog and RFIC design. IEEE Trans. CAD, 2003.
14
 
15
 
16
 
17
[17] G. M. Ziegler. Lectures on Polytopes. Springer Verlag, New York, 1995.

CITED BY  7
Collaborative Colleagues:
G. Stehr: colleagues
H. Graeb: colleagues
K. Antreich: colleagues