Abstract
A computationally efficient matched filter for Frank polyphase and similar Discrete Fourier Transform (DFT) related codes is proposed. It is based on converting any available efficient Short Time Fourier Transform (STFT) algorithm into a related matched filter. This results in significant computational advantage over the existing methods. In comparison to the Goertzel algorithm, it offers guaranteed stability and reduced roundoff noise, in addition to reducing the required computation by half. The best known non-recursive methods, in which an FFT is applied for each new input, require O( N log N) multiplications per output instead of the O( N) for the proposed STFT based matched filters.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
