2005/03/21 by J.G. Vargas-Rubio, Balu Santhanam · 2 citations
Mathematics · Computer Science · #Mathematical Analysis and Transform Methods #Digital Filter Design and Implementation #Image and Signal Denoising Methods
paper · doi:10.1109/lsp.2005.843762
openalex publication_date 2005/03/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/06/11
Existing versions of the discrete fractional Fourier transform (DFRFT) are based on the discrete Fourier transform (DFT). These approaches need a full basis of DFT eigenvectors that serve as discrete versions of Hermite-Gauss functions. In this letter, we define a DFRFT based on a centered version of the DFT (CDFRFT) using eigenvectors derived from the Gru/spl uml/nbaum tridiagonal commutor that serve as excellent discrete approximations to the Hermite-Gauss functions. We develop a fast and efficient way to compute the multiangle version of the CDFRFT for a discrete set of angles using the FFT algorithm. We then show that the associated chirp-frequency representation is a useful analysis tool for multicomponent chirp signals.