2015/06/24 by Ayush Bhandari, Bhandari, Ayush, Ahmed I. Zayed +1
Computer Science · Mathematics · #Digital Filter Design and Implementation #FOS: Computer and information sciences #FOS: Physical sciences #Image and Signal Denoising Methods #Information Theory (cs.IT) #Mathematical Analysis and Transform Methods #Mathematical Physics (math-ph)
paper · pdf · doi:10.48550/arxiv.1506.07240
openalex publication_date 2015/06/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The Special Affine Fourier Transform or the SAFT generalizes a number of well known unitary transformations as well as signal processing and optics related mathematical operations. Unlike the Fourier transform, the SAFT does not work well with the standard convolution operation. Recently, Q. Xiang and K. Y. Qin introduced a new convolution operation that is more suitable for the SAFT and by which the SAFT of the convolution of two functions is the product of their SAFTs and a phase factor. However, their convolution structure does not work well with the inverse transform in sofar as the inverse transform of the product of two functions is not equal to the convolution of the transforms. In this article we introduce a new convolution operation that works well with both the SAFT and its inverse leading to an analogue of the convolution and product formulas for the Fourier transform. Furthermore, we introduce a second convolution operation that leads to the elimination of the phase factor in the convolution formula obtained by Q. Xiang and K. Y. Qin.