The discrete fractional Fourier transformation

Files

Discrete fractional Fourier transformation.pdf (250.7 KB)

Date

1996

Authors

Editor(s)

Advisor

Supervisor

Co-Advisor

Co-Supervisor

Instructor

BUIR Usage Stats
3
views
24
downloads

Citation Stats

  • Share

Series

Abstract

Based on the fractional Fourier transformation of sampled periodic functions, the discrete form of the fractional Fourier transformation is obtained. It is found that only for a certain dense set of fractional orders such a discrete transformation is possible to define. Also, for its efficient computation a fast algorithm, which has the same complexity as the FFT, is given.

Source Title

Proceedings of the 3rd International Symposium on Time-Frequency and Time-Scale Analysis, IEEE 1996

Publisher

IEEE

Course

Other identifiers

Book Title

Keywords

Algorithms, Computational complexity, Computational methods, Fractals, Signal processing, Signal theory, Discrete fractional Fourier transformations, Fractional Fourier transform, Sampled periodic functions, Fourier transforms

Degree Discipline

Degree Level

Degree Name

Citation

Permalink

http://hdl.handle.net/11693/27756

Published Version (Please cite this version)

https://doi.org/10.1109/TFSA.1996.547217

Collections

Scholarly Publications - Electrical and Electronics Engineering

Language

English

Type

Conference Paper