Convolution, Product and Correlation Theorems for Simplified Fractional Fourier Transform: A Mathematical Investigation
Sanjay Kumar

TL;DR
This paper develops simplified convolution, product, and correlation theorems for the fractional Fourier transform, making their mathematical properties more elegant and generalizable, akin to classical Fourier transform theorems.
Contribution
It introduces simplified and elegant theorems for SmFrFT that generalize classical Fourier transform properties, enhancing mathematical clarity and applicability.
Findings
Theorems are mathematically derived for SmFrFT.
Theorems generalize classical Fourier transform properties.
Enhanced mathematical elegance in fractional Fourier analysis.
Abstract
The notion of fractional Fourier transform (FrFT) has been used and investigated for many years by various research communities, which finds widespread applications in many diverse fields of research study. The potential applications includes ranging from quantum physics, harmonic analysis, optical information processing, pattern recognition to varied allied areas of signal processing. Many significant theorems and properties of the FrFT have been investigated and applied to many signal processing applications, most important among these are convolution, product and correlation theorems. Still many magnificent research works related to the conventional FrFT lacks the elegance and simplicity of the convolution, product and correlation theorems similar to the Euclidean Fourier transform (FT), which for convolution theorem states that the FT of the convolution of two functions is the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Analysis and Transform Methods · Image and Signal Denoising Methods · Digital Filter Design and Implementation
