Computation of Approximate Symbolic Pole/Zero Expressions
The symbolic LR algorithm using simplification during LR iterations is used for the computation of the approximate symbolic pole/zero expressions. It is shown that this approach is competitive or better with respect to the best known approaches. A two transistor amplifier is redesigned using these f...
Gespeichert in:
Veröffentlicht in: | Analog integrated circuits and signal processing 2004-09, Vol.40 (3), p.255-264 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | The symbolic LR algorithm using simplification during LR iterations is used for the computation of the approximate symbolic pole/zero expressions. It is shown that this approach is competitive or better with respect to the best known approaches. A two transistor amplifier is redesigned using these formulas. 4. G. Droege and E.H. Horneber, "Symbolic calculation of poles and zeros." In Proceedings of the Workshop on Symbolic Methods and Applications to Circuit Design, Oct. 9-10, 1996, K.U. Leuven, Belgium. 5. J. Hsu and C. Sechen, "The sifting approach to symbolic analysis of large analog integrated circuits." In Proc. SMACD'94, Seville, Oct. 7, 1994, pp. 211-230. 6. E. Hennig, M. Wiese, and R. Sommer, "Symbolic pole/zero approximation using eigenvalue shift prediction." In Proc. SMACD'98, Kaiserslautern, Germany, Oct. 1999, pp. 29-35. |
---|---|
ISSN: | 0925-1030 |
DOI: | 10.1023/B:ALOG.0000034827.77155.bf |