1996
DOI: 10.1109/78.536672
|View full text |Cite
|
Sign up to set email alerts
|

Digital computation of the fractional Fourier transform

Abstract: Abstract-An algorithm for efficient and accurate computation of the fractional Fourier transform is given. For signals with time-bandwidth product N , the presented algorithm computes the fractional transform in O( N log N ) time. A definition for the discrete fractional Fourier transform that emerges from our analysis is also discussed.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
609
0
9

Year Published

2001
2001
2024
2024

Publication Types

Select...
4
3

Relationship

1
6

Authors

Journals

citations
Cited by 1,028 publications
(619 citation statements)
references
References 39 publications
1
609
0
9
Order By: Relevance
“…In other words, any th-order FrFT of , including the signal itself and its ordinary Fourier transform, has negligible energy outside the symmetric interval . For a signal with approximate time and frequency supports of and , respectively, the required scaling is , where [36]. After the scaling, the double-sided bandwidth of is .…”
Section: B Efficient Computation Of the Ambiguity Function Samples Amentioning
confidence: 99%
See 3 more Smart Citations
“…In other words, any th-order FrFT of , including the signal itself and its ordinary Fourier transform, has negligible energy outside the symmetric interval . For a signal with approximate time and frequency supports of and , respectively, the required scaling is , where [36]. After the scaling, the double-sided bandwidth of is .…”
Section: B Efficient Computation Of the Ambiguity Function Samples Amentioning
confidence: 99%
“…After the discretization, the obtained form lends itself for an efficient digital computation since the required samples of the FrFT [ ] can be computed using the recently developed fast computation algorithm [36] in flops. The summation in (12) can be recast into a -point discrete Fourier transformation (DFT), which can be computed in flops using the fast Fourier transform algorithm.…”
Section: B Efficient Computation Of the Ambiguity Function Samples Amentioning
confidence: 99%
See 2 more Smart Citations
“…FrFT is the generalization of ordinary Fourier transform (FT) that depends on a parameter α and can be interpreted as a rotation by an angle α in the time-frequency plane [2,11,12]. It is represented by R α and α=aπ/2, where α is the angle of rotation and a is the fractional order parameter.…”
Section: Fractional Fourier Transformmentioning
confidence: 99%