Sparse Eigenvectors of the Discrete Fourier Transform

2009/11/15 by William F. Bradley, Bradley, William F.
Computer Science · Engineering · Mathematics · #FOS: Computer and information sciences #Image and Signal Denoising Methods #Information Theory (cs.IT) #Mathematical Analysis and Transform Methods #Sparse and Compressive Sensing Techniques

paper · pdf · doi:10.48550/arxiv.0911.2922

openalex publication_date 2009/11/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• Explicit Hermite-type eigenvectors of the discrete Fourier transform
• Minimal Hermite-type eigenbasis of the discrete Fourier transform
• The discrete Fourier transform: A canonical basis of eigenfunctions
• On the eigenvectors of the 5D discrete Fourier transform number operator in Newtonian basis
• Nearly Optimal Sparse Fourier Transform