7 June 1995 Mixed-radix approach to incremental DFT refinement
Author Affiliations +
Abstract
Incremental refinement algorithms can quickly produce approximate results and may then improve the quality of those results in subsequent stages of computation. They offer promise for the development of real-time systems whose performance degrades gracefully under diminishing hard deadlines. We present a new class of incremental refinement algorithms which employ mixed-radix signal representations for the calculation of successive approximations to the DFT. This class includes algorithms with a wide range of cost/quality tradeoff characteristics. This work generalized a previously reported class of algorithms which employ binary signal representations only. The mixed-radix formulation allows solutions of a given level of quality to be achieved using significantly fewer arithmetic operations in many instances. Under certain restrictions, these algorithms can also be implemented with no computational overhead using fixed-point binary hardware.
© (1995) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Joseph M. Winograd, Joseph M. Winograd, S. Hamid Nawab, S. Hamid Nawab, } "Mixed-radix approach to incremental DFT refinement", Proc. SPIE 2563, Advanced Signal Processing Algorithms, (7 June 1995); doi: 10.1117/12.211417; https://doi.org/10.1117/12.211417
PROCEEDINGS
12 PAGES


SHARE
RELATED CONTENT


Back to Top