Publication Type:

Journal Article

Source:

Circuits, Systems, and Signal Processing, Volume 34, Number 10, p.3221–3239 (2015)

URL:

http://dx.doi.org/10.1007/s00034-015-9990-y

Abstract:

Realization of N -point discrete Fourier transform (DFT) using one-dimensional or two-dimensional systolic array structures has been developed for power of two DFT sizes. DFT algorithm, which can be represented as a triple-matrix product, can be realized by decomposing N into smaller lengths. Triple-matrix product form of representation enables to map the N -point DFT on a 2D systolic array. In this work, an algorithm is developed and is mapped to a two-dimensional systolic structure where DFT size can be non-power of two. The proposed work gives flexibility to choose N for an application where N is a composite number. The total time required to compute N -point DFT is 2 ( N <sub>1</sub> - 1 ) + N <sub>2</sub> + N for any N = N <sub>1</sub> N<sub> 2</sub> . The array can be used for matrix–matrix multiplication and also to compute the diagonal elements of triple-matrix multiplication for other applications. The proposed architecture produces in-order stream of DFT sequence at the output avoiding need for reordering buffer. Large sized DFT can be computed by repeatedly using the proposed systolic array architecture.

Notes:

cited By 0

Cite this Research Publication

I. Mamatha, T.S.B. Sudarshan, Tripathi, S., and Bhattar, N., “Triple-Matrix Product-Based 2D Systolic Implementation of Discrete Fourier Transform”, Circuits, Systems, and Signal Processing, vol. 34, pp. 3221–3239, 2015.