DocumentCode
2891593
Title
Approximate signal processing using incremental refinement and deadline-based algorithms
Author
Nawab, S. Hamid ; Winograd, Joseph M.
Author_Institution
Dept. of Electr. Comput. & Syst. Eng., Boston Univ., MA, USA
Volume
5
fYear
1995
fDate
9-12 May 1995
Firstpage
2857
Abstract
A framework for approximate signal processing is introduced which can be used to design novel classes of algorithms for performing DFT and STFT calculations. In particular, we focus on the derivation of multi-stage incremental refinement algorithms that meet a variety of design criteria on the tradeoff achieved at each stage between solution quality and computational cost
Keywords
Fourier transforms; computational complexity; discrete Fourier transforms; real-time systems; signal processing; DFT calculations; STFT calculations; approximate signal processing; computational cost; deadline-based algorithms; design criteria; incremental refinement; short time Fourier transform; solution quality; Algorithm design and analysis; Approximation algorithms; Computational efficiency; Costs; Discrete Fourier transforms; Equations; Problem-solving; Refining; Signal design; Signal processing algorithms;
fLanguage
English
Publisher
ieee
Conference_Titel
Acoustics, Speech, and Signal Processing, 1995. ICASSP-95., 1995 International Conference on
Conference_Location
Detroit, MI
ISSN
1520-6149
Print_ISBN
0-7803-2431-5
Type
conf
DOI
10.1109/ICASSP.1995.479440
Filename
479440
Link To Document