2021 | OriginalPaper | Chapter
Optimum Coefficients for Recursively Computing DFTs
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
The recursive computation of prime length DFTs has very simple structure and needs only one coefficient. The signal-to-noise ratio for fixed-point implementation of this algorithm is discussed. The optimum coefficients with maximum S/N ratio are presened.