Abstract
The Fractional Fourier transform (FRFT), which provides generalization of conventional Fourier Transform was introduced many years ago in mathematics literature by Namias. In this paper, definition, properties of fractional Fourier transform and its relationship with other transforms is discussed. Various definitions of discrete version of FRFT and their comparison is presented. FRFT falls under the category of Linear time frequency representations. Some of the applications of FRFT such as detection of signals in noise, image compression, reduction of side lobe levels using convolutional windows, and time-frequency analysis are illustrated with examples. It has been observed that FRFT can be used in more effective manner compared to Fourier transform with additional degrees of freedom.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
