Complexity of pruning strategies for the frequency domain LMS algorithm

DOI10.1016/J.SIGPRO.2005.11.015MaRDI QIDQ1031364zbMATH OpenOpenAlexFDO

Authors Vasanthan Raghavan, K. M. M. Prabhu, Piet C. W. Sommen

Publication date 29 October 2009

Published in Signal Processing (Search for Journal in Brave)

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

zbMATH Keywords

adaptive algorithmcomputational complexityFBNLMSFFT pruningLMStransform decomposition

Mathematics Subject Classification ID

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

Recommendations

• Complexity considerations for transform-domain adaptive filters
• Unconstrained frequency-domain adaptive filter
• scientific article; zbMATH DE number 1547694
• LMS-Newton adaptive filtering using FFT
• Pruning fast Fourier transform algorithm design using group-based method

Cited in

(1)

• On the properties of the reduction-by-composition LMS algorithm

This page was built for publication: Complexity of pruning strategies for the frequency domain LMS algorithm

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