Probabilistic Complexity Analysis for a Class of Approximate DFT Algorithms

Journal of VLSI Signal Processing Systems for Signal, Image, and Video Technology

Volumn 14, Issue 2, 1996, Pages 193-205

  Winograd, Joseph M ^a   Amid Nawab, S H ^a  

^a BOSTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; FAST FOURIER TRANSFORMS; INTEGRATED CIRCUIT LAYOUT; PROBABILITY; REAL TIME SYSTEMS; VLSI CIRCUITS;

DISCRETE FOURIER TRANSFORM (DFT); PROBABILISTIC COMPLEXITY ANALYSIS;

DIGITAL SIGNAL PROCESSING;

EID: 0030286354     PISSN: 09225773     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF00925499     Document Type: Article

References (21)

1. D.F. Elliott and K.R. Rao, Fast Transforms: Algorithms, Analyses, Applications, Academic Press, New York, 1982.
2. J.D. Markel, "FFT pruning," IEEE Trans. Audio and Electroacoustics, Vol. AU-19, pp. 305-310, Dec. 1971.
3. D.P. Skinner, "Pruning the decimation in-time FFT algorithm," IEEE Trans. Acoust., Speech, and Signal Processing, pp. 193-194, April 1976.
4. T.V. Sreenivas and P.V.S. Rao, "FFT algorithm for both input and output pruning," IEEE Trans. Acoust., Speech, and Signal Processing, Vol. ASSP-27, pp. 291-292, June 1979.
5. G. Goertzel, "An algorithm for the evaluation of finite trigonometric series," Amer. Math. Monthly, Vol. 65, pp. 34-35, Jan. 1958.
6. H.V. Sorensen and C.S. Burrus, "Efficient computation of the DFT with only a subset of input or output points," IEEE Trans. Signal Processing, Vol. 41, pp. 1184-1200, March 1993.
7. G.F. Boudreaux-Bartels and T.W. Parks, "Discrete Fourier transform using summation by parts," in Proc. IEEE Int. Conf. Acoust., Speech, and Signal Processing, Vol. 3, Dallas, TX, 1987 pp. 1827-1830.
8. M.P. Lamoureux, "The Poorman's transform: Approximating the Fourier transform without multiplication," IEEE Trans. Signal Processing, Vol. 41, pp. 1413-1415, March 1993.
9. S.H. Nawab and E. Dorken, "Efficient STFT approximation using a quantization and differencing method," in Proc. IEEE Int. Conf. Acoust., Speech, and Signal Processing, Minneapolis, MN, April 1993.
10. J.M. Winograd and S.H. Nawab, "Incremental refinement of DFT and STFT approximations," IEEE Signal Processing Letters, Vol. 2, pp. 25-28, Feb. 1995.
11. S.H. Nawab and E. Dorken, "A framework for quality versus efficiency tradeoffs in STFT analysis," IEEE Trans. Signal Processing, Vol. 43, pp. 998-1001, April 1995.
12. S.A. White, "Applications of distributed arithmetic to digital signal processing: A tutorial review," IEEE ASSP Magazine, Vol. 6, pp. 4-19, July 1989.
13. S. Chu and C.S. Burrus, "A prime factor FFT algorithm using distributed arithmetic," IEEE Trans. Signal Processing, Vol. ASSP-30, pp. 217-226, April 1982.
14. F.J. Taylor, "An RNS discrete Fourier transform implementation," IEEE Trans. Acoust., Speech, and Signal Processing, Vol. 38, pp. 1386-1394, Aug. 1990.
15. R.R. Bahadur, "A representation of the joint distribution of responses to n dichotomous items," in Studies in Item Analysis and Prediction, H. Solomon (Ed.), pp. 158-168, Stanford Univ. Press, Stanford, CA, 1961.
16. L.L. Kupper and J.K. Haseman, "The use of a correlated binomial model for the analysis of certain toxicological experiments," Biometrics, Vol. 34, pp. 69-76, March 1978.
17. 1," Ann. Math. Statist., Vol. 34, pp. 792-828, 1963.
18. T.G. Donnelly, "Algorithm 462 - Bivariate normal distribution," Comm. ACM, Vol. 16, p. 638, Oct. 1973.
19. M.J. Schervish, "Multivariate normal probabilities with error bound," Applied Statistics, Vol. 33, pp. 81-103, 1984.
20. Corrections published in Applied Statistics, Vol. 35, p. 104, 1985.
21. D. Byrne et al., "An international comparison of long-term average speech spectra," J. Acoust. Soc. Am., Vol. 96, pp. 2108-2120, Oct. 1994.