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

Ahmet Serbes*, Lutfiye Durak-Ata

*Bu çalışma için yazışmadan sorumlu yazar

Araştırma sonucu: Dergiye katkıMakalebilirkişi

19 Atıf (Scopus)

Özet

In order to define the discrete fractional Fourier transform, Hermite Gauss-like eigenvectors are needed and one way of extracting these eigenvectors is to employ DFT commuting matrices. Recently, Pei et al. exploited the idea of obtaining higher order DFT-commuting matrices, which was introduced by Candan previously. The upper bound of O(h2k) approximation to N×N commuting matrix is 2k1≤N in Candan's work and Pei et al. improved the proximity by removing this upper bound at the expense of higher computational cost. In this paper, we derive an exact closed form expression of infinite-order Taylor series approximation to discrete second derivative operator and employ it in the definition of excellent DFT commuting matrices. We show that in the limit this Taylor series expansion converges to a trigonometric function of second-order differentiating matrix. The commuting matrices possess eigenvectors that are closer to the samples of HermiteGaussian eigenfunctions of DFT better than any other methods in the literature with no additional computational cost.

Orijinal dilİngilizce
Sayfa (başlangıç-bitiş)582-589
Sayfa sayısı8
DergiSignal Processing
Hacim91
Basın numarası3
DOI'lar
Yayın durumuYayınlandı - Mar 2011
Harici olarak yayınlandıEvet

Parmak izi

Efficient computation of DFT commuting matrices by a closed-form infinite order approximation to the second differentiation matrix' araştırma başlıklarına git. Birlikte benzersiz bir parmak izi oluştururlar.

Alıntı Yap