Circular Convolution and Product Theorem for Affine Discrete Fractional Fourier Transform
Amir R. Nafchi, Eric Hamke, Cristina Pereyra, Ramiro Jordan

TL;DR
This paper introduces a new affine discrete fractional Fourier transform with a circular convolution property, generalizing the discrete Fourier transform and enhancing signal processing applications.
Contribution
It presents a closed-form affine discrete fractional Fourier transform and demonstrates its circular convolution property, expanding the theoretical framework for Fourier-based signal processing.
Findings
Proposed a versatile affine discrete fractional Fourier transform.
Established the circular convolution property for the new transform.
Generalized the discrete Fourier transform to fractional domain.
Abstract
The Fractional Fourier Transform is a ubiquitous signal processing tool in basic and applied sciences. The Fractional Fourier Transform generalizes every property and application of the Fourier Transform. Despite the practical importance of the discrete fractional Fourier transform, its applications in digital communications have been elusive. The convolution property of the discrete Fourier transform plays a vital role in designing multi-carrier modulation systems. Here we report a closed-form affine discrete fractional Fourier transform and we show the circular convolution property for it. The proposed approach is versatile and generalizes the discrete Fourier transform and can find applications in Fourier based signal processing tools.
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
MethodsConvolution
