Abstract
For a large numberN of data points, linear FFT arrays consisting of Θ(log2 N) processors provide significant economy in hardware. In this paper we discuss the radix-2 decimation-in-frequency Cooley-Tukey algorithm implemented on linear arrays, thereby allowing a continuous real-time application using a word-serial input data stream to the linear arrays. In order to avoid memory access and data path switching under central control, we present a novel data-driven scheme permitting the proposed linear arrays to correctly operate on arbitrarily arriving signal sequences. This distributed control scheme incorporates a control signal propagated with the data signals, in the form of a tag attached to data items. The tag provides control information to initiate the access to the memory containing the coefficients and to select and appropriate data path so that regular data flow can be achieved within the linear array. The cascade structures are well suited for the computation and can operate in pipeline fashion at extremely high data rates. The proposed data-driven control scheme can be used with both synchronous and asynchronous (wavefront) processor arrays.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
C.D. Thompson, “Fourier transform in VLSI”,IEEE Transactions on Computers, Vol. C-32 pp. 1047–1057, 1983.
H.T. Kung and C.E. Leiserson, “Algorithms for VLSI processor arrays,” inIntroduction to VLSI Systems, C. Mead and L. Conway (eds.), Reading, MA: Addison-Wesley, pp. 271–292, 1980.
C. Van Loan,Computational Franeworks for the Fast Fourier Transform, Philadelphia, PA: Society for Industrial and Applied Mathematics, 1992.
A.L. Fisher and H.T. Kung, “Synchronizing large VLSI processor arrays”IEEE Transactions on Computers, Vol. C-34, pp. 734–740, 1985.
R. Gupta, R. Gupta, and M.A. Breuer, “The BALLAST methodology for structured partial scan design,”IEEE Transactions on Computers, Vol. 39, pp. 538–544, 1990.
K. Yamashita et al., “A wafer-scale 170000-gate FFT processor with built-in test circuits,”IEEE Journal of Solid-State Circuits, Vol. 23, pp. 336–342, 1988.
J. Choi and V. Boriakoff, “A new linear systolic array for FFT computation,”IEEE Transactions on Circuits and Systems—II: Analog and Digital Signal Processing, Vol. 39, pp. 236–239, 1992.
V. Boriakoff, “FFT computation with systolic arrays, a new architecture,”IEEE Transactions on Circuits and Systems—II: Analog and Digital Signal Processing, Vol. 41, pp. 278–284, 1994.
M. Aloqeely and C.Y. Chen, “Sequencer-based data path synthesis of regular iterative algorithms,”Proc. 31st ACM/IEEE Design Automation Conf., pp. 155–160, 1994.
D.-M. Kwai and B. Parhami, “A data-driven control scheme for linear processor arrays,” Submitted for publication.
H.L. Groginsky and G.A. Works, “A pipeline fourier transform,”IEEE Transactions on Computers, Vol. 19, pp. 1015–1019, 1970.
S. Sarkar and A.K. Majumdar, “Fast fourier transform using linear tagged systolic array,”IEEE Region 10 Conf. Computer and Communication Systems, pp. 289–293, 1990.
D. Audet, Y. Savaria, and N. Arel, “Pipelining communications in large VLSI/ULSI systems,”IEEE Trans. Very Large Integration (VLSI) Systems, Vol 2, pp. 1–10, 1994.
M.O. Ahmad and D.V. Poornalah, “Design of an efficient VLSI inner-product processor for real-time DSP applications,”IEEE Transactions on Circuits and Systems, Vol. 36, pp. 324–329, 1989.
S.Y. Kung, “On supercomputing with systolic/wavefront array processors,”Proceedings IEEE Vol. 72, pp. 867–884, 1984.
S.Y. Kung,VLSI Array Processors, Englewood Cliffs, NJ: Prentice-Hall, 1988.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kwai, DM., Parhami, B. FFT computation with linear processor arrays using a data-driven control scheme. J VLSI Sign Process Syst Sign Image Video Technol 13, 57–66 (1996). https://doi.org/10.1007/BF00930667
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF00930667