English

Sparse Eigenvectors of the Discrete Fourier Transform

Information Theory 2009-11-17 v1 math.IT

Abstract

We construct a basis of sparse eigenvectors for the N-dimensional discrete Fourier transform. The sparsity differs from the optimal by at most a factor of four. When N is a perfect square, the basis is orthogonal.

Cite

@article{arxiv.0911.2922,
  title  = {Sparse Eigenvectors of the Discrete Fourier Transform},
  author = {William F. Bradley},
  journal= {arXiv preprint arXiv:0911.2922},
  year   = {2009}
}
R2 v1 2026-06-21T14:11:54.780Z