Computationally efficient pseudo QMF filter bank for a multi-compatible HDTV codec
- 1 January 1991
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2849-2852 vol.4
- https://doi.org/10.1109/icassp.1991.150996
Abstract
A review is presented of methods usable in a coding scheme to obtain compatible images (images with lower resolution) based on the discrete cosine transform (DCT), quadrature mirror filters (QMF), conjugate quadrature filters (CQF) and pseudo quadrature mirror filters (PQMF). Compared to QMF or CQF, PQMF gives better frequency selectivity for a much lower computational cost. The theory of PQMF is reviewed and new results are described, especially regarding computational cost, hardware implementation, and constraints on the length of the prototype filter used to generate the modulated filter bank. Both cases of NF even and NF odd, where NF is the prototype filter number of taps, are then checked, and optimal implementations using fast transforms (a classical DCT for NF odd and a type IV DCT for NF even) are explained for the encoder and the compatible decoders.Keywords
This publication has 5 references indexed in Scilit:
- Flexible design of computationaly efficient nearly perfect QMF filter banksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Subband coding of imagesIEEE Transactions on Acoustics, Speech, and Signal Processing, 1986
- Exact reconstruction techniques for tree-structured subband codersIEEE Transactions on Acoustics, Speech, and Signal Processing, 1986
- Fast decimation-in-time algorithms for a family of discrete sine and cosine transformsCircuits, Systems, and Signal Processing, 1984
- Multi-dimensional sub-band coding: Some theory and algorithmsSignal Processing, 1984