2011•Unpublished venueRequires access

A Novel Algorithm for Linear Fractional Convolution

Xiaojuan Wang, Lin Qi, Chen En-qing, Xiaomin Mu, Shouyi Yang

Open publisher page 0 citations

Abstract

A novel algorithm based on fractional Fourier circular convolution theorem is proposed to deal with the fractional linear convolution, which is in accordance with the hidden periodicity of the discrete fractional Fourier transform. In the pre-processing, it applies the methods of overlap-save and overlap-add to make segment on the longer sequence. The algorithm is able to overcome the disadvantages of traditional fractional circular convolution theorem, which only can be used to calculate the convolution of two sequences with the similar length. Simulation results show the effectiveness of this algorithm.

About this research paper

What this paper is about

A novel algorithm based on fractional Fourier circular convolution theorem is proposed to deal with the fractional linear convolution, which is in accordance with the hidden periodicity of the discrete fractional Fourier transform. In the pre-processing, it applies the methods of overlap-save and overlap-add to make segment on the longer sequence. The algorithm is able to overcome the disadvantages of traditional fractional circular convolution theorem, which only can be used to calculate the convolution of two sequences with the similar length. Simulation results show the effectiveness of this algorithm.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

A novel algorithm based on fractional Fourier circular convolution theorem is proposed to deal with the fractional linear convolution, which is in accordance with the hidden periodicity of the discrete fractional Fourier transform. In the pre-processing, it applies the methods of overlap-save and overlap-add to make segment on the longer sequence. The algorithm is able to overcome the disadvantages of traditional fractional circular convolution theorem, which only can be used to calculate the convolution of two sequences with the similar length. Simulation results show the effectiveness of this algorithm.

Key concepts: Convolution (computer science), Circular convolution, Overlap–add method, Convolution theorem, Discrete-time Fourier transform, Algorithm, Fractional calculus, Fourier transform

Related papers

Back to paper searchBrowse research topicsOriginal source
A Novel Algorithm for Linear Fractional Convolution — Research Paper | ScholarLens