A vlsi chip for the winograd/prime factor algorithm to compute the discrete fourier transform

IEEE Transactions on Acoustics, Speech, and Signal Processing

Volumn 34, Issue 4, 1986, Pages 979-989

  Owens, Robert Michael ^a   Ja’Ja’, Joseph ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84939734428     PISSN: 00963518     EISSN: None     Source Type: Journal    
DOI: 10.1109/TASSP.1986.1164888     Document Type: Article

References (14)

1. R. Agarwal and J. Cooley, “New algorithms for digital convolution,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-25, 25, pp. 392–410, 1977
2. D. E. Atkins, “Introduction to the role of redundancy in computer arithmetic,” Computer, vol. 8, pp. 74–76, June 1975
3. A. Avizienis, “Signed-digit number representations for fast parallel arithmetic,” IRE Trans. Electron. Comput., p. 389, 1961
4. J. Cooley and J. Tukey, “An algorithm for the machine calculation of complex Fourier series,” Math. Comput., vol. 19, pp. 297–301, 1965
5. D. Elliot and K. Rao, Fast Transforms Algorithms, Analyses, Applications. New York: Academic, 1982
6. I. Good, “The interaction algorithm and practical Fourier analysis,” J. Roy. Stat. Soc., ser. B, vol. 20, pp. 361–372, 1958. “Addendum,” vol. 22, pp. 372–375, 1960
7. J. Jai’Ja’, “High-speed networks for computing the discrete Fourier transform,” in Proc. Adv. Res. VLSI, Mass. Inst. Technol., Cambridge, Jan. 1984
8. D. Kolba and I. Parks, “A prime factor FFT algorithm using high speed convolution,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-25, pp. 281–294, 1977
9. R. M. Owens, “Techniques to reduce the inherent limitations of fully digit on-line arithmetic,” IEEE Trans. Comput., vol. C-32, pp. 406–411, 411, Apr. 1983
10. H. F. Silverman, “An introduction to programming the Winograd-Fourier Fourier transform algorithm (WFTA),“ IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-25, pp. 152–165, 1977
11. C. D. Thompson, “Area time complexity for VLSI,” in Proc. 11th Annu. ACM Symp. Theory Comput., Atlanta, GA. New York: ACM 1979, pp. 81–88
12. S. Winograd, “On computing the discrete Fourier transform,” in Proc. Nat. Acad. Sci. USA, vol. 73, 1976, pp. 1005–1006
13. S. Winograd, “On computing discrete Fourier transform,” Math. Comput., vol. 32, pp. 175–195, 1978
14. S. Winograd, “On the multiplicative complexity of the discrete Fourier transform,” Adv. Math., vol. 32, pp. 83–117, 1979