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.
Optimum Coefficients for Recursively Computing DFTs
Footprints in Cambridge and Aviation Industries of China ; Kapitel : 7 ; 88-93
2021-09-20
6 pages
Aufsatz/Kapitel (Buch)
Elektronische Ressource
Englisch
Fast Implementation of Recursive DFTs
Springer Verlag | 2021
|MTI Improvement Factors for Weighted DFTs
IEEE | 1980
|British Library Online Contents | 2016
|