A method for the independent/parallel decomposition of the n-D discrete Fourier transform (DFT) is presented. The method, which is based on fast Nussbaumer's polynomial transform, requires fewer 1-D DFT than the classical separable radix fast Fourier transform approach. It has ν times smaller multiplicatively complex ν-D DFT compared to the row/column approach. It introduces a fast, direct and exact inversion algorithm for discrete Radon transform.