Multiplicative filtering in the fractional Fourier domain

作者：Wei Deyun^*; Ran Qiwen

来源：Signal, Image and Video Processing, 2013, 7(3): 575-580.

DOI：10.1007/s11760-011-0261-5

• Multiplicative filtering
• Fractional Fourier transform
• Convolution theorem
• Computational complexity

In this article, we investigate the multiplicative filtering in the fractional Fourier transform (FRFT) domain based on the generalized convolution theorem which states that the convolution of two signals in time domain results in simple multiplication of their FRFTs in the FRFT domain. In order to efficiently implement multiplicative filtering, we express the generalized convolution structure by the conventional convolution operation. Utilizing the generalized convolution structure, we convert the multiplicative filtering in the FRFT domain easily to the time domain. Based on the model of multiplicative filtering in the FRFT domain, a practical method is proposed to achieve the multiplicative filtering through convolution in the time domain. This method can be realized by classical Fast Fourier transform (FFT) and has the same capability compared with the method achieved in the FRFT domain. As convolution can be performed by FFT, this method is more useful from practical engineering perspective.

• 出版日期2013-5
• 单位哈尔滨工业大学