Ephraim Feig
IEEE Transactions on Communications
We exhibit new algorithms for DFT(p; k), the discrete Fourier transform on a k- dimensional data set with p points along each array, where p is a prime. At a cost of additions only, these algorithms compute DFT(p; k) with (pk - 1)1 (p - 1) distinct DFT(p; 1) computations. Copyright © 1983 by The Institute of Electrical and Electronics Engineers, Inc.
Ephraim Feig
IEEE Transactions on Communications
Ephraim Feig, Elliot Linzer
Advances in Applied Mathematics
Ephraim Feig
Journal of Algorithms
Shmuel Winograd
Communications on Pure and Applied Mathematics