Circular Convolution And Fourier Discrete Transformation
Mircea I. Cîrnu
Abstract
Open-access reader
Mircea I. Cîrnu
Abstract
Open-access reader
We present the discrete circular convolution and its algorithms of calculus. Using discrete Fourier transform can be determined the circular deconvolution, ie the circular convolution inverse. We exemplify these concepts by solving an equation of circular convolution. This type of convolution product is applies to the periodic phenomena, discretely analyzed. By this paper we continue the series of articles about the types of discrete convolution products and their applications, some of which being cited in the References.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We present the discrete circular convolution and its algorithms of calculus. Using discrete Fourier transform can be determined the circular deconvolution, ie the circular convolution inverse. We exemplify these concepts by solving an equation of circular convolution. This type of convolution product is applies to the periodic phenomena, discretely analyzed. By this paper we continue the series of articles about the types of discrete convolution products and their applications, some of which being cited in the References.
Key concepts: Convolution (computer science), Circular convolution, Discrete-time Fourier transform, Overlap–add method, Convolution theorem, Deconvolution, Discrete Fourier transform (general), Fourier transform