Share Email Print

Proceedings Paper

Mixed-radix approach to incremental DFT refinement
Author(s): Joseph M. Winograd; S. Hamid Nawab
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 7 June 1995
PDF: 12 pages
Proc. SPIE 2563, Advanced Signal Processing Algorithms, (7 June 1995); doi: 10.1117/12.211417
Show Author Affiliations
Joseph M. Winograd, Boston Univ. (United States)
S. Hamid Nawab, Boston Univ. (United States)

Published in SPIE Proceedings Vol. 2563:
Advanced Signal Processing Algorithms
Franklin T. Luk, Editor(s)

© SPIE. Terms of Use
Back to Top