Efficient matched filters for DFT based codes

DOI10.1016/J.SIGPRO.2010.04.018MaRDI QIDQ994217zbMATH OpenOpenAlexFDO

Authors Adly T. Fam

Publication date 17 September 2010

Published in Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.sigpro.2010.04.018

zbMATH Keywords

matched filtersshort time Fourier transform

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• Area and power efficient mismatched filters based on sidelobe inversion
• Hardware efficient fast computation of the discrete Fourier transform
• Efficient polyphase DFT filter banks with fading memory
• The design of optimal DFT algorithms using dynamic programming
• Fast, prime factor, discrete Fourier transform algorithms over \(\text{GF}(2^m)\) for \(8 \leqslant m \leqslant 10\)

Cites work

• A comment on the computational complexity of sliding FFT
• The synthesis of perfect sequences

Cited in

(1)

• A unified treatment of compact symmetric FFT code generation

This page was built for publication: Efficient matched filters for DFT based codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q994217)