Synthesis of Extremal Wavelet-Generating Filters Using Gaussian Quadrature

IEEE Transactions on Signal Processing

Volumn 43, Issue 5, 1995, Pages 1045-1057

  Aas, Knut C ^a   Duell, Kenneth A ^b   Mullis, Clifford T ^b  

^a TELENOR RESEARCH   (Norway)

^b UNIVERSITY OF COLORADO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EXTREMAL WAVELET GENERATING FILTERS; GAUSSIAN QUADRATURE; INTEGRAL CRITERION; LEVINSON RECURSIONS; PERFECT RECONSTRUCTION FILTERS;

ALGORITHMS; ELECTRIC NETWORK SYNTHESIS; POLES AND ZEROS; RECURSIVE FUNCTIONS; SAMPLING; SIGNAL FILTERING AND PREDICTION; WAVELET TRANSFORMS;

DIGITAL FILTERS;

EID: 0029309676     PISSN: 1053587X     EISSN: 19410476     Source Type: Journal    
DOI: 10.1109/78.382392     Document Type: Article

References (19)

1. R. E. Blahut, Fast Algorithms for Digital Signal Processing. Reading, MA: Addison Wesley, 1985. Reprinted with corrections, June 1987.
2. E. W. Cheney, Introduction to Approximation Theory. New York: McGraw Hill, 1966.
3. I. Daubechies, “Orthonormal bases of compactly supported wavelets,” Commun. Pure Appl. Math., vol. 41, pp. 909-996, 1988.
4. P. Delsarte and Y. V. Genin, “The split Levinson algorithm,” IEEE Trans. Acoust., Speech Signal Processing, vol. ASSP-34, pp. 470-478, June 1986.
5. C. J. Demeure and C. T. Mullis, “The Euclid algorithm and the fast computation of cross-covariance and autocovariance sequences,” IEEE Trans. Acoust., Speech Signal Processing, vol. 37, pp. 545-552, Apr. 1989.
6. A Newton-Raphson method for moving average spectral factorization using the Euclid algorithm,” IEEE Trans. Acoust. Speech Signal Processing, vol. 38, pp. 1697-1709, Oct. 1990.
7. U. Grenander and G. Szegö, Toeplitz Forms and Their Applications. Berkeley, CA: University of California Press, 1958.
8. L. W. Johnson and R. D. Riess, Numerical Analysis, Reading, MA: Addison-Wesley, 1982, 2nd ed.
9. V. I. Krylov, Approximate Calculation of Integrals. New York: Macmillan, 1962.
10. D. G. Luenberger, Optimization by Vector Space Methods. New York: Wiley, 1969.
11. S. G. Mallat, “A theory for multiresolution signal decomposition: The wavelet representation,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 11, pp. 674-693, July 1989.
12. E. D. Rainville, Special Functions. New York: Macmillan, 1960.
13. T. J. Rivlin, Chebyshev Polynomials. New York: Wiley, 1990, 2nd ed.
14. R. A. Roberts and C. T. Mullis, Digital Signal Processing. Reading, MA: Addison-Wesley, 1987.
15. H. L. Royden, “Bounds on a distribution function when its first n moments are given,” Ann. Math. Stat., vol. 24, pp. 361-376, 1953.
16. D. Slepian, “Prolate spheroidal wave functions, Fourier analysis, and uncertainty-V: The discrete case,” Bell Syst. Tech. J., vol. 57, pp. 1371-1430, 1978.
17. M. J. T. Smith and T. P. Barnwell, III, “Exact reconstruction techniques for tree-structured subband coders,” IEEE Trans. Acoust. Speech Signal Processing, vol. ASSP-34, pp. 434-441, June 1986.
18. F. G. Tricomi, Vorlesungen über Orthogonalreihen. Berlin: Springler-Verlag, 1970, 2nd ed.
19. P. P. Vaidyanathan, T. Q. Nguyen, Z. Doganata, and T. Saramaki, “Improved technique for design of perfect reconstruction FIR QMF banks with lossless polyphase matrices,” IEEE Trans. Acoust. Speech Signal Processing, vol. 37, pp. 1042-1056, July 1989.