2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/213542The 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 discrete oscillator transform in certain cases.Accepted for publication in the journal "Applied and Computational Harmonic Analysis": Appl. Comput. Harmon. Anal. (2009), doi:10.1016/j.acha.2008.11.003. Key words: Discrete Fourier Transform, Weil Representation, Canonical Eigenvectors, Oscillator Transform, Fast Oscillator TransformInformation TheoryDiscrete MathematicsRepresentation Theorytext