A New Linear Systolic Array for FFT Computation

IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing

Volumn 39, Issue 4, 1992, Pages 236-239

  Choi, Jaeyoung ^a   Boriakoff, Valentin ^b  

^a Department of Obstetrics Gynecology   (United States)

^b WORCESTER POLYTECHNIC INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SYSTEMS, DIGITAL - PIPELINE PROCESSING;

LINEAR SYSTOLIC ARRAY; PEASE ALGORITHM;

MATHEMATICAL TRANSFORMATIONS;

EID: 0026852136     PISSN: 10577130     EISSN: None     Source Type: Journal    
DOI: 10.1109/82.136573     Document Type: Article

References (14)

1. J. W. Cooley and J. W. Tukey, “An algorithm for the machine calculation of complex Fourier series”, Math. Comp., vol. 19, pp. 297–301, 1965.
2. P. D. Gader, “Bidiagonal factorization of Fourier matrices and systolic algorithms for computing discrete Fourier transforms”, IEEE Trans. Acoust., Speech, Signal Processing, vol. 37, pp. 1280–1283, 1989.
3. W. M. Gentleman and G. Sande, “Fast Fourier transforms for fun and profit”, in Proc. Joint Computer Conf. AFIPS, vol. 29, pp. 563–578, 1966.
4. H. T. Kung, “Why systolic architectures?” IEEE Comp., vol. 15, pp. 37–46, 1982.
5. H. T. Kung and M. Lam, “Wafer-scale integeration and two-level pipelined implementation of systolic arrays”, J. Parallel and Distributed Computing, vol. 1, pp. 32–63, 1984.
6. A. V. Oppenheim and R. W. Schafer, Digital Signal Processing. Englewood Cliffs, NJ: Prentice Hall, 1975.
7. R. M. Owen and J. Ja'Ja', “A VLSI chip for the Winograd/prime factor algorithm to compute the discrete Fourier transform”, IEEE Trans. Acoust., Speech, Signal Processing, vol. 34, pp. 979–988, 1986.
8. M. C. Pease, Methods of Matrix Algebra. New York: Academic, 1965.
9. M. C. Pease, “An adaptation of the fast Fourier transform for parallel processing”, J. ACM, vol. 15, pp. 252–264, 1968.
10. K. Sapiecha and R. Jarocki, “Modular architecture for high performance implementation of the FFT”, IEEE Trans. Comput., vol. 39, pp. 1464–1468, 1990.
11. R. C. Singleton, “A method for computing the fast Fourier transform with auxiliary memory and limited high-speed storage”, IEEE Trans. Audio Electroacoust., vol. AU-15, pp. 91–97, 1967.
12. T. G. Stockham, “High-speed convolution and correlation”, in Proc. Joint Computer Conf. AFIPS, vol. 28, pp. 229–233, 1966.
13. H. S. Stone, “Parallel processing with the perfect shuffle”, IEEE Trans. Comput., vol. 20, pp. 153–161, 1971.
14. E. E. Swartzlander and J. Eldon, “Arithmetic for high speed FFT implementation”, in Proc. Seventh Symp. Computer Arithmetic, pp. 223–230, 1985.