Novel Recursive Solution for Area-Time Efficient Systolization of Discrete Fourier Transform
- 1 July 2007
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 139, 1-4
Abstract
A new recursive solution based on Clenshaw's recurrence relation is formulated for computation of the discrete Fourier transform (DFT). The proposed recursive formulation is used further to derive a simple, regular and locally connected linear array architecture for systolic implementation of the DFT. The proposed structure offers nearly twice the throughput and involves nearly the same area-complexity as that of the corresponding existing DFT structure based on Clenshaw's recurrence relation.Keywords
This publication has 6 references indexed in Scilit:
- Highly concurrent reduced-complexity 2-D systolic array for discrete Fourier transformIEEE Signal Processing Letters, 2006
- Computation of discrete cosine transform using Clenshaw's recurrence formulaIEEE Signal Processing Letters, 1995
- On the real-time computation of DFT and DCT through systolic architecturesIEEE Transactions on Signal Processing, 1994
- A new systolic realization for the discrete Fourier transformIEEE Transactions on Signal Processing, 1993
- On the design of VLSI arrays for discrete Fourier transformIEE Proceedings G Circuits, Devices and Systems, 1992
- Why systolic architectures?Computer, 1982