Abstract | ||
---|---|---|
An efficient algorithm is presented for ordering the sections of a cascade structure digital filter in such a way as to minimize the output noise power due to internal multiplier roundoff error. The algorithm is applicable to either recursive or non-recursive filters, and is not limited to a particular section form or method of intersection scaling. Computation time estimates are given for recursive filters as a function of order. Implications of the technique relative to the theory of dynamic programming are discussed. |
Year | DOI | Venue |
---|---|---|
1976 | 10.1109/ICASSP.1976.1169983 | Acoustics, Speech, and Signal Processing, IEEE International Conference ICASSP '76. |
Keywords | Field | DocType |
transfer functions,writing,polynomials,poles and zeros,digital filter,concurrent computing,arithmetic,digital filters | Dynamic programming,Digital biquad filter,Digital filter,Round-off error,Computer science,Network synthesis filters,Algorithm,Multiplier (economics),Cascade,Adaptive filter | Conference |
Volume | Citations | PageRank |
1 | 0 | 0.34 |
References | Authors | |
1 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Theodore R. Lapp | 1 | 0 | 0.34 |
Robert A. Gabel | 2 | 0 | 1.35 |