Open AccessFast algorithm for zero‐phase linear filter using discrete cosine transform
Author(s) -
Deng G.
Publication year - 2019
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
ISSN - 1350-911X
DOI - 10.1049/el.2019.0166
Subject(s) - algorithm , fast fourier transform , discrete fourier transform (general) , discrete sine transform , prime factor fft algorithm , filter (signal processing) , discrete cosine transform , linear phase , mathematics , non uniform discrete fourier transform , split radix fft algorithm , signal processing , digital filter , filter design , fractional fourier transform , fourier transform , computer science , digital signal processing , fourier analysis , artificial intelligence , computer vision , mathematical analysis , computer hardware , image (mathematics)
This Letter deals with a practical signal processing problem where the filter is zero‐phase and is specified by the frequency response. The authors show that if the signal is symmetrically extended, then the fast Fourier transform (FFT)‐based algorithm can be efficiently implemented by using the discrete cosine transform without signal extension. They extend the proposed algorithm to 2D filters and show that computationally it is at least four times more efficient than the FFT‐based algorithm. A practical application of the new algorithm is a fast Wiener inverse filter, which is used to estimate images taken under the condition of air turbulence.