Fast parallel implementation of DFT using configurable devices

  • Andreas Dandalis
  • Viktor K. Prasanna
Signal Processing
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1304)


In this paper we propose a fast parallel implementation of Discrete Fourier Transform (DFT) using FPGAs. Our design is based on the Arithmetic Fourier Transform (AFT) using zero-order interpolation. For a given problem of size N, AFT requires only O(N2) additions and O(N) real multiplications with constant factors. Our design employes 2p + 1 PEs (1 ≤ pN), O(N) memory and fixed 1/O with the host. It is scalable over p (1 ≤ pN) and can solve larger problems with the same hardware by increasing the memory. All the PEs have fixed architecture. Our implementation is faster than most standard DSP designs for FFT. It also outperforms other FPGA-based implementations for FFT, in terms of speed and adaptability to larger problems.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    K. Bondalapati and V. K. Prasanna, “Reconfigurable Meshes: Theory and Practice”, Reconfigurable Architectures Workshop, Int. Parallel Processing Symposium (IPPS), April 1997.Google Scholar
  2. 2.
    K. Chapman, “Constant Coefficient Multipliers for the XC4000C”, XILINX Application Note 054, Dec. 1996.Google Scholar
  3. 3.
    S. Choi, Y. Chung and V. K. Prasanna, “Configurable Hardware for Symbolic Search Operations”, submitted to Int. Conf. Parallel and Distributed Systems, Dec. 1997.Google Scholar
  4. 4.
    Y. Chung S. Choi and V. K. Prasanna, “Parallel Object Recognition on an FPGA-based Configurable Computing Platform”, submitted to Int. Workshop on Computer Architecture for Machine Perception, Oct. 1997.Google Scholar
  5. 5.
    L. K. Hua, “Introduction to Number Theory”, New York: Springer-Verlag, 1982.Google Scholar
  6. 6.
    B. New, “Estimating the Performance of XC4000E Adders and Counters”, XILINX Application Note 018, July 1996.Google Scholar
  7. 7.
    H. Park and V. K. Prasanna, “Modular VLSI Architectures for Computing the Arithmetic Fourier Transform”, IEEE Trans. Signal Processing, vol. 41, no. 6, pp. 2236–2246, June 1993.CrossRefGoogle Scholar
  8. 8.
    R. J. Petersen and B. L. Hutchings, “An Assessment of the Suitability of FPGA-Based Systems for use in Digital Signal Processing”, in Proc. Int. Workshop on Field-Programmable Logic and Applications, Aug. 1995.Google Scholar
  9. 9.
    I. S. Reed, D. W. Tufts, X. Yu, T. K. Truong, M. Shih and X. Yin, “Fourier analysis and signal processing by use of the Möbius inversion formula”, IEEE Trans. Acoust., Signal Processing, vol.38, no. 3, pp. 458–470, Mar. 1990.Google Scholar
  10. 10.
    I. S. Reed, M. T. Shih, T. K. Truong, E. Hendon and D. W. Tufts, “A VLSI architecture for simplified arithmetic Fourier transform algorithm”, in Proc. Int. Conf. Application Specific Array Processor, 1990.Google Scholar
  11. 11.
    R. Wilson, “Reprogrammable FPGA-based techniques provide prototyping aid”, Electronic Engineering Times, Mar. 11, 1996.Google Scholar
  12. 12.
    XILINX DSP Application notes, “The Fastest FFT in the West”, Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Andreas Dandalis
    • 1
  • Viktor K. Prasanna
    • 1
  1. 1.Department of Electrical Engineering-SystemsUniversity of Southern CaliforniaLos AngelesUSA

Personalised recommendations