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. This paper proposes a technique that can compute Discrete Fourier Transforms for a matrice or vector with the help of matrix multiplication. Moreover, this paper discusses the trivial methods used for computation of DFT along with methods based on matrix multiplication used to compute discrete Fourier Transform in addition to the shortcomings. The proposed method can help in the calculation of a Discrete Fourier Transformation matrix by truncation of values from the proposed generic method which can help in computing DFT of varying lengths of vectors. On legacy computing machines and programming environments, having support for matrix multiplication, the proposed methodology can be implemented.