Hironori Murakami
Abstract
This paper generalizes the cyclic convolution system by the discrete Fourier transform (DFT). The generalized cyclic convolution is modified in such a way that conventional fast algorithms can be applied for the computation. This system is applied for computing a negacyclic convolution and 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 generalizes the cyclic convolution system by the discrete Fourier transform (DFT). The generalized cyclic convolution is modified in such a way that conventional fast algorithms can be applied for the computation. This system is applied for computing a negacyclic convolution and modified Fermat number transform.
Key concepts: Convolution (computer science), Overlap–add method, Circular convolution, Convolution theorem, Discrete Fourier transform (general), Computation, Fermat's Last Theorem, Computer science