An algorithm is presented, for the computation of multidimensional Fourier and Fourier-like discrete transforms, which offers substantial savings in the number of multiplications over the conventional fast Fourier transform method. Implementation of this algorithm, and the use of it to compute discrete Fourier transforms of real sequences, are also described.