Computer Science – Information Theory
Scientific paper
2009-11-15
Computer Science
Information Theory
Scientific paper
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.
No associations
LandOfFree
Sparse Eigenvectors of the Discrete Fourier Transform does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Sparse Eigenvectors of the Discrete Fourier Transform, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sparse Eigenvectors of the Discrete Fourier Transform will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-498324