2D grid architectures for the DFT and the 2D DFT

Abstract

New algorithms for the DFT and the 2-dimensional DFT are presented. The DFT and the 2-dimensional DFT matrices can be expressed as the Kronecker product of DFT matrices of smaller dimension. These algorithms are synthesized by combining the efficient factorization of the Kronecker product of matrices with the highly hardware efficient recursive implementation of the smaller DFT matrices, to yield these algorithms. The architectures of the processors implementing these algorithms consist of 2-dimensional grid of processing elements, have temporal and spatial locality of connections. For computing the DFT of size N or for the 2D DFT of size N = N~ by N~, these algorithms require 2N multipliers and adders, take approximately 2x/-N computational steps for computing a transform vector, and take approximately x/--N computation steps between the computation of two successive transform vectors.

Age-Limited Capacity of Massive MIMO

“…Here, U ∈ C K×K is the 2D DFT matrix obtained as the Kronecker product of a smaller dimension DFT matrix [44]:…”

Maximum Entropy Power Spectrum Estimation for 2-D Multirate Systems

“…where F is a 2-D DFT matrix which is defined by the Kronecker product of 1-D N -point DFT matrices [4]:…”

A 64-point Fourier transform chip for video motion compensation using phase correlation

“…In calculating a 64-point DFT using the decimation-in-timeand-frequency algorithm, the time and frequency sequences of the transform and hence the transform matrix, are first permuted into a base-4, digit-reversed order using (5) (5) From (6), shown at the bottom of the page, the permuted 64-by-64 matrix, which is not appropriate to be shown explicitly here, can be partitioned into four 16-by-16 matrices as illustrated in (7) (7) where and…”