zbMATH — the first resource for mathematics

Linear filtering in DCT IV/DST IV and MDCT/MDST domain. (English) Zbl 1161.94364
Summary: Expressions for convolution multiplication properties of DCT IV and DST IV are derived starting from equivalent DFT representations. Using these expressions methods for implementing linear filtering through block convolution in the DCT IV and DST IV domain are proposed. Techniques developed for DCT IV and DST IV are further extended to MDCT and MDST where the filter implementation is near exact for symmetric filters and approximate for non-symmetric filters. No additional overlapping is required for implementing the symmetric filtering in the MDCT domain and hence the proposed algorithm is computationally competitive with DFT based systems. Moreover, inherent 50% overlap between the adjacent frames used for MDCT/MDST domain reduces the blocking artifacts due to block processing or quantization. The techniques are computationally efficient for symmetric filters and provides a new alternative to DFT based convolution.

94A12 Signal theory (characterization, reconstruction, filtering, etc.)
93E11 Filtering in stochastic control theory
94A11 Application of orthogonal and other special functions
65T50 Numerical methods for discrete and fast Fourier transforms
Full Text: DOI
[1] Strang, G.: The discrete cosine transform, SIAM review 41, No. 1, 135-147 (March 1999) · Zbl 0939.42021
[2] Rao, K. R.; Yip, P.: Discrete cosine transforms: algorithms, advantages, applications, (1990) · Zbl 0726.65162
[3] Chitprasert, B.; Rao, K. R.: Discrete cosine transform filtering, Signal processing 19, 233-245 (March 1990) · Zbl 0718.93056
[4] Martucci, S. A.: Symmetric convolution and the discrete sine and cosine transforms, IEEE transactions on signal processing 42, No. 5, 1038-1051 (May 1994)
[5] Reju, V. G.; Koh, S. N.; Soon, I. Y.: Convolution using discrete sine and cosine transforms, IEEE signal processing letters 14, No. 7, 445-448 (July 2007)
[6] Kresch, R.; Merhav, N.: Fast DCT domain filtering using the DCT and the DST, IEEE transactions on image processing 8, No. 6, 821-833 (June 1999)
[7] Bongiovanni, G.; Corsini, P.; Frosini, G.: One-dimensional and two-dimensional generalized discrete Fourier transforms, IEEE transactions on acoustics speech and signal processing 24, 97-99 (February 1976) · Zbl 0342.42006
[8] Oppenheim, A. V.; Schafer, R. W.; Buck, J. R.: Discrete time signal processing 2/e, (1999)
[9] Johnson, A. W.; Bradley, A. B.: Adaptive transform coding incorporating time domain aliasing cancellation, Speech communication 6, 299-308 (1987)
[10] H.S. Malvar, Signal Processing with Lapped Transforms, Artech House, Norwood MA, 1992. · Zbl 0948.94505
[11] Princen, J.; Bradley, A.: Analysis/synthesis filter bank design based on time domain aliasing cancellation, IEEE transactions on acoustics speech and signal processing 34, No. 5, 1153-1161 (October 1986)
[12] Princen, J.; Johnson, A.; Bradley, A.: Subband/transform coding using filter bank designs based on time domain aliasing cancellation, , 2161-2164 (1987)
[13] Sorensen, H. V.; Jones, D. L.; Heideman, M. T.; Burrus, C. S.: Real-valued fast Fourier transform algorithms, IEEE transactions on acoustics speech and signal processing 35, 849-863 (1987)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.