2021 | OriginalPaper | Chapter
Fast DFT Algorithm with [N–1]/2 Multiplications
Author : Yanzhong Zhang
Published in: Footprints in Cambridge and Aviation Industries of China
Publisher: Springer Singapore
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
A fast algorithm is proposed for recursively computing the DFTs of prime length. Only (N-1)/2 real multiplications are required to compute all N frequency components in terms of permuting the input data.