We exhibit new algorithms for DFT(p; k), the discrete Fourier transform on a k-dimensional data set with

points along each array, where p is a prime. At a cost of additions only, these algorithms compute DFT(p; k) with (p
k- 1)/(p - 1) distinct DFT(p; 1) computations.