 The DFT is also used as a building block for techniques that take advantage of properties of signals frequency-domain representation, such as the overlap-save and overlap-add fast convolution algorithms.However the computational complexity increases if Discrete Fourier Transform is used as the Discrete Transform.The computational complexity of the DFT is way higher than the other Discrete Transforms and for P-D DFT, the computational complexity is given by O(formula_403formula_404...formula_405).