A VLSI-oriented parallel FFT algorithm

IEEE Transactions on Signal Processing

Volumn 44, Issue 2, 1996, Pages 445-448

  Ma, Yu Tai ^a  

^a INSTITUTE OF COMPUTING TECHNOLOGY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

DATA TRANSFER; DIGITAL SIGNAL PROCESSING; FAST FOURIER TRANSFORMS; MULTIPLYING CIRCUITS; PARALLEL PROCESSING SYSTEMS; RANDOM ACCESS STORAGE; ROM; VLSI CIRCUITS;

COMPLEX MULTIPLIER; HIGH PROCESSING RATE; MEMORY ACCESS TIME; TWIDDLE FACTORS;

PARALLEL ALGORITHMS;

EID: 0030083210     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/78.485944     Document Type: Article

References (8)

1. G. D. Bergland, "A fast Fourier transform algorithm for a global, highly parallel processor," IEEE Trans. Audio Electroacoust., vol. AU-17, no. 2, pp. 125-127, 1969.
2. D. R. Bungard, L. Lau, and T. L. Rorabaugh, "New programmable FFT implementations for radar signal processing," in Proc. IEEE ISCAS, vol. 2, 1989, pp. 1323-1327.
3. A. Dukey, M. Zubair, and C. E. Grosch, "Practical aspects and experiences: A general purpose subroutine for fast Fourier transform on a distributed memory parallel machine," Parallel Computing, vol. 20, no. 12, pp. 1697-1710, Dec. 1994.
4. D. L. Jones and H. V. Sorenson, "A bus-oriented multiprocessor fast Fourier transform," IEEE Trans. Signal Processing, vol. 39, no. 11, pp. 2547-2551, 1991.
5. R. Shenhav, "The decomposition of long FFT's for high throughput implementation," in Proc. IEEE ICASSP, 1987, pp. 1043-1046.
6. G. Sunada, J. Jin, M. Berzins, and T. Chen, "COBRA: An 1.2 million transistor expandable Column FFT chip," in Proc. IEEE ICCD, 1994, pp. 546-550.
7. K. Tanno, T. Taketa, and S. Horiguchi, "Parallel FKT algorithms using radix 4 butterfly computation on an eight-neighbor processor array," Parallel Computing, vol. 21, no. 1, pp. 121-136, Jan. 1995.
8. B. L. Troutman, G. W. McIver, W. E. Kingsley, and B. H. Whalen, "A 2μ CMOS/LSI 32-point fast Fourier transform processor," in Proc. IEEE Int. Solid-State Circuits Conf., 1982, pp. 26-27, 282-283.