Efficient matched filters for DFT based codes

DOI10.1016/J.SIGPRO.2010.04.018zbMath1195.94024OpenAlexW2069660575MaRDI QIDQ994217

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

short time Fourier transformmatched filters

Mathematics Subject Classification ID

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

Cites Work

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

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