Computation of negacyclic convolution and modified Fermat transform
Hironori Murakami
Abstract
Hironori Murakami
Abstract
This paper introduces a generalized cyclic convolution which can be implemented via the conventional cyclic convolution system by the discrete Fourier transform (DFT) with pre-multiplication for the input and post-multiplication for the output. The generalized cyclic convolution is applied for computing a negacyclic convolution. Comparison shows that the proposed implementation is more efficient and simpler in structure than other methods. The generalized cyclic convolution is also applied for the linear convolution by the modified Fermat number transform.
A significance statement is not available in the OpenAlex record.
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.
This paper introduces a generalized cyclic convolution which can be implemented via the conventional cyclic convolution system by the discrete Fourier transform (DFT) with pre-multiplication for the input and post-multiplication for the output. The generalized cyclic convolution is applied for computing a negacyclic convolution. Comparison shows that the proposed implementation is more efficient and simpler in structure than other methods. The generalized cyclic convolution is also applied for the linear convolution by the modified Fermat number transform.
Key concepts: Overlap–add method, Convolution (computer science), Circular convolution, Convolution theorem, Multiplication (music), Convolution power, Fermat number, Mathematics