| Abstrakt: |
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 $$2\sqrt N $$ computational steps for computing a transform vector, and take approximately $$\sqrt N $$ computation steps between the computation of two successive transform vectors. [ABSTRACT FROM AUTHOR] |
Full text from SpringerLink