Pruning fast Fourier transform algorithm design using group-based method

DOI10.1016/J.SIGPRO.2007.05.012MaRDI QIDQ971085zbMATH OpenOpenAlexFDO

Authors Chih-Peng Fan, Guo-An Su

Publication date 19 May 2010

Published in Signal Processing (Search for Journal in Brave)

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

zbMATH Keywords

fast Fourier transformarithmetic complexitydata transfer costgrouped schemepruning FFT algorithmselective transformed outputs

Mathematics Subject Classification ID

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

Recommendations

• A split-radix partial input/output fast Fourier transform algorithm
• Modified FFTs for Fused Multiply-Add Architectures
• scientific article; zbMATH DE number 5876376
• The design of optimal DFT algorithms using dynamic programming
• Hardware efficient fast computation of the discrete Fourier transform

Cited in

(2)

• Complexity of pruning strategies for the frequency domain LMS algorithm
• An optimal algorithm for grouping in NEDA

This page was built for publication: Pruning fast Fourier transform algorithm design using group-based method

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