Optimal ladder filters

Authors:
Gerrit Groenewold
Affiliations:
Qualcomm, San Diego, CA
Venue:
IEEE Transactions on Circuits and Systems II: Express Briefs
Year:
2009

Citing 5
Cited 1

Matrix analysis

Matrix analysis
A heuristic selection strategy for lexicographic Gröner bases?

ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
“One sugar cube, please” or selection strategies in the Buchberger algorithm

ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Efficient computation of zero-dimensional Gro¨bner bases by change of ordering

Journal of Symbolic Computation
Walking Faster

DISCO '96 Proceedings of the International Symposium on Design and Implementation of Symbolic Computation Systems

IC-constrained optimization of continuous-time Gm–C filters

International Journal of Circuit Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Optimizing the dynamic range of active filters through filter network optimization can lead to significant savings in chip area and power consumption. By restricting the filters to be ladder filters, it is possible to limit the complexity of the optimized networks.