 Therefore, the Fast Fourier Transform(FFT) is used to compute the DFT as it reduces the computational complexity significantly to O(formula_46formula_49...formula_408formula_409formula_46formula_49...formula_408) and at the same time other Discrete Transforms are preferred over the DFT.For a multidimensional array formula_388 that is a function of p discrete variables formula_389 for formula_390 in formula_391, the P-Dimensional Discrete Forward Cosine Transform is defined by