Efficient computation of DFT commuting matrices by a closed-form infinite order approximation to the second differentiation matrix

DOI10.1016/j.sigpro.2010.05.002zbMath1203.94052OpenAlexW1977041852MaRDI QIDQ612647

Lutfiye Durak-Ata, Ahmet Serbes

Publication date: 29 December 2010

Published in: Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.sigpro.2010.05.002

zbMATH Keywords

commuting matricesDFT commuting matricesDFT matrixdiscrete fractional Fourier transformHermite-Gauss functions

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (1)

The discrete fractional Fourier transform based on the DFT matrix

Cites Work

• The eigenvectors of the discrete Fourier transform: A version of the Hermite functions
• On discrete Gauss-Hermite functions and eigenvectors of the discrete Fourier transform
• Discrete fractional Fourier transform based on orthogonal projections
• The discrete fractional Fourier transform
• Eigenvectors and functions of the discrete Fourier transform
• Generalized Commuting Matrices and Their Eigenvectors for DFTs, Offset DFTs, and Other Periodic Operations
• DFT-Commuting Matrix With Arbitrary or Infinite Order Second Derivative Approximation
• Discrete Fractional Fourier Transform Based on New Nearly Tridiagonal Commuting Matrices

This page was built for publication: Efficient computation of DFT commuting matrices by a closed-form infinite order approximation to the second differentiation matrix