A Generic Scalable DFT Calculation Method for Vectors and Matrices Using Matrix Multiplications

Computation of Discrete Fourier Transform (DFT) is a challenging task. Especially, on computational machines/embedded systems where resources are limited. The importance of Fourier Transform (FT) cannot be denied in the field of signal processing. In this paper, we propose a technique that can compute Discrete Fourier Transforms for a matrice or vector with the help of matrix multiplication. Moreover, we discuss the trivial methods used for computation of DFT along with methods based on matrix multiplication used to compute discrete Fourier Transform. Furthermore, we explain the shortcomings. Our method can help in the calculation of a Discrete Fourier Transformation matrix by truncation of values from our proposed generic method which can help in computing DFT of varying lengths of vectors. On computing machines and programming environments, having support for matrix multiplication, our proposed methodology can be implemented.