Fast fourier transforms over poor fields

  title={Fast fourier transforms over poor fields},
  author={Alexey Pospelov},
We present a new algebraic algorithm for computing the discrete Fourier transform over arbitrary fields. It computes DFTs of infinitely many orders n in O(n log n) algebraic operations, while the complexity of a straightforward application of the known FFT algorithms can be Ω(n1.5) for such n. Our algorithm is a novel combination of the classical FFT algorithms, and is never slower than any of the latter. As an application we come up with an efficient way of computing DFTs of high orders in… CONTINUE READING
Highly Cited
This paper has 42 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
32 Citations
5 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 32 extracted citations


Publications referenced by this paper.
Showing 1-5 of 5 references

Discrete Fourier transforms when the number of data samples is prime

  • C. M. Rader
  • Proc. IEEE, 56:1107–1108
  • 1968
Highly Influential
18 Excerpts

Using a computer to solve problems in physics

  • L. H. Thomas
  • Applications of Digital Computers, Ginn and Co…
  • 1963
Highly Influential
4 Excerpts

The interaction algorithm and practical Fourier analysis

  • I. J. Good
  • J. R. Statist. Soc. B, 20
  • 1958
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…