Fast algorithms for fractional Fourier transforms
نویسندگان
چکیده
The fractional Fourier transform (FRFT) is a one-parametric generalization of the classical Fourier transform. The FRFT was introduced in the 80th and has found a lot of applications and is now used widely in signal processing. Both the space and the spatial frequency domains, respectively, are special cases of the fractional Fourier domains. They correspond to the 0th and 1st fractional Fourier domains, respectively. In this paper, we brie y introduce the multi-parametrical FRFT and its fast algorithms.
منابع مشابه
A fast algorithm for the linear canonical transform
In recent years there has been a renewed interest in finding fast algorithms to compute accurately the linear canonical transform (LCT) of a given function. This is driven by the large number of applications of the LCT in optics and signal processing. The well-known integral transforms: Fourier, fractional Fourier, bilateral Laplace and Fresnel transforms are special cases of the LCT. In this p...
متن کاملSimulation of an Airy Beam with Optical Vortex under Fractional Fourier Transforms
First, this study obtained the fields of an Airy beam (AiB) with optical vortex (OV) for a Fourier transform (FT) system and a fractional Fourier transform (fractional FT) system; thereafter, their intensity and phase patterns were simulated numerically. The splitting on each line of the phase pattern indicates the position of an OV. The results show that the OV position will change when the po...
متن کاملFast Fourier Analysis for Abelian Group Extensions
Let G be a nite group and f any complex-valued function deened on G and an irreducible complex matrix representation of G. The Fourier transform of f at is deened to be the matrix P s2G f(s)(s). The Fourier transforms of f at all the irreducible representations of G determine f via the Fourier inversion formula f(s) = 1 j Gj P d trace(b f()(s ?1)): Direct computation of all Fourier transforms o...
متن کاملThe Partial Fast Fourier Transform
An efficient algorithm for computing the one-dimensional partial fast Fourier transform fj = ∑c(j) k=0 e Fk is presented. Naive computation of the partial fast Fourier transform requires O(N) arithmetic operations for input data of length N . Unlike the standard fast Fourier transform, the partial fast Fourier transform imposes on the frequency variable k a cutoff function c(j) that depends on ...
متن کاملFast Infinitesimal Fourier Transform for Signal and Image Processing via Multiparametric and Fractional Fourier Transforms
The fractional Fourier transforms (FrFTs) is one-parametric family of unitary transformations {F} α=0. FrFTs found a lot of applications in signal and image processing. The identical and classical Fourier transformations are both the special cases of the FrFTs. They correspond to α = 0 (F = I) and α = π/2 (F = F), respectively. Up to now, the fractional Fourier spectra Fi = Fi {f} , i = 1, 2, ....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999