ACM Home Page
Please provide us with feedback. Feedback
Analog circuit sizing based on formal methods using affine arithmetic
Full text PdfPdf (121 KB)
Source International Conference on Computer Aided Design archive
Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design table of contents
San Jose, California
Pages: 486 - 489  
Year of Publication: 2002
ISBN ~ ISSN:1092-3152 , 0-7803-7607-2
Authors
Andreas Lemke  University of Hanover, Hannover, Germany
Lars Hedrich  University of Hanover, Hannover, Germany
Erich Barke  University of Hanover, Hannover, Germany
Sponsors
: IEEE Circuits & Systems Society
IEEE-CS\DATC : IEEE Computer Society
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 44,   Citation Count: 7
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/774572.774643
What is a DOI?

ABSTRACT

We present a novel approach to optimization-based variation-tolerant analog circuit sizing. Using formal methods based on affine arithmetic, we calculate guaranteed bounds on the worst-case behavior and deterministically find the global optimum of the sizing problem by means of branch-and-bound optimization. To solve the nonlinear circuit equations with parameter variations, we define a novel affine-arithmetic Newton operator that gives a significant improvement in computational efficiency over an implementation using interval arithmetic. The calculation of guaranteed worst-case bounds and the global optimization are demonstrated by a prototype implementation.


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
L. H. de Figueiredo and J. Stolfi. Self-Validated Numerical Methods and Applications. Brazilian Mathematics Colloquium monographs. IMPA/CNPq, Rio de Janeiro, Brazil, 1997.
 
2
N. Femia and G. Spagnuolo. True worst-case circuit tolerance analysis using genetic algorithms and affine arithmetic. IEEE Trans. on Circuits and Systems I, 47(9):1285--1296, Sept. 2000.
 
3
E. Hansen. Global optimization using interval analysis--the multi-dimensional case. Numerische Mathematik, 34(1):247--270, 1980.
 
4
 
5
D. M. W. Leenaerts. Application of interval analysis for circuit design. IEEET Trans. on CAD, 37(6):803--807, June 1990.
 
6
R. E. Moore. Interval Analysis. Prentice-Hall, 1966.
 
7
 
8
F. Romeo and A. F. Sangiovanni-Vincentelli. A theoretical framework for simulated annealing. Algorithmica, 6(3):302--345, 1991.
 
9
S. Skelboe. Computation of rational interval functions. BIT, 14(1):87--95, 1974.

CITED BY  7

Collaborative Colleagues:
Andreas Lemke: colleagues
Lars Hedrich: colleagues
Erich Barke: colleagues