Home           Contact us           FAQs           
     Journal Home     |     Aim & Scope    |    Author(s) Information      |     Editorial Board     |     MSP Download Statistics
2013 (Vol. 6, Issue: 11)
Article Information:

Review of Computing Algorithms for Discrete Fractional Fourier Transform

Muhammad Irfan, Liying Zheng and Haroon Shahzad
Corresponding Author:  Muhammad Irfan 

Key words:  Computing algorithm, discrete fractional Fourier transform, Fourier transform, time-frequency representation, time varying signals, ,
Vol. 6 , (11): 1911-1919
Submitted Accepted Published
October 04, 2012 December 09, 2012 July 25, 2013

Discrete Fractional Fourier Transform (DFRFT) has received lots of attention in last two decades because of its superior benefits and wide applications in various fields. In this study we present a comparative analysis of the most famous algorithms for the computation of DFRFT. Analysis is done on the parameters like time complexity, accuracy, consistency, basic mathematical properties and generalization of Discrete Fourier Transform (DFT) and approximation of continuous Fractional Fourier Transform (FRFT). Main objective of the research is to portray the major advantages and disadvantages of the previously proposed algorithms so that appropriate algorithm may be selected as per requirements. On the basis of study it has been observed that there exist several definitions and algorithm for computing the DFRFT. These algorithms are based on different techniques, such as eigenvectors, chirp convolution, spectral decomposition, non-Fresnel integral, or orthogonal projection. Each of these algorithms has its own advantages and disadvantages. Despite of these developments, we still feel that there has been dire need of a standard definition and computing method for accurate and efficient computation of DFRFT.
Abstract PDF HTML
  Cite this Reference:
Muhammad Irfan, Liying Zheng and Haroon Shahzad, 2013. Review of Computing Algorithms for Discrete Fractional Fourier Transform.  Research Journal of Applied Sciences, Engineering and Technology, 6(11): 1911-1919.
    Advertise with us
ISSN (Online):  2040-7467
ISSN (Print):   2040-7459
Submit Manuscript
   Current Information
   Sales & Services
Home  |  Contact us  |  About us  |  Privacy Policy
Copyright © 2015. MAXWELL Scientific Publication Corp., All rights reserved