The discrete Fourier transform: A canonical basis of eigenfunctions
classification
💻 cs.IT
cs.DMmath.ITmath.RT
keywords
basistransformcanonicaldiscretefourieractsalgorithmcall
read the original abstract
The discrete Fourier transform (DFT) is an important operator which acts on the Hilbert space of complex valued functions on the ring Z/NZ. In the case where N=p is an odd prime number, we exhibit a canonical basis of eigenvectors for the DFT. The transition matrix from the standard basis to the canonical basis defines a novel transform which we call the "discrete oscillator transform" (DOT for short). Finally, we describe a fast algorithm for computing the DOT in certain cases.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.