Digital computation of the fractional Fourier transform
Date
1996-09
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
BUIR Usage Stats
2
views
views
270
downloads
downloads
Citation Stats
Series
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(NlogN) time. A definition for the discrete fractional Fourier transform that emerges from our analysis is also discussed.
Source Title
IEEE Transactions on Signal Processing
Publisher
Institute of Electrical and Electronics Engineers
Course
Other identifiers
Book Title
Degree Discipline
Degree Level
Degree Name
Citation
Permalink
Published Version (Please cite this version)
Language
English