IEICE TRANSACTIONS on Fundamentals
Generalization of the Cyclic Convolution and Its Fast Computational Systems
Summary :
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 modified Fermat number transform (MFNT) is known to be useful for computing a linear convolution of integer-valued sequences. The generalized cyclic convolution is also applied for generalizing the linear convolution system by MFNT, and easing the signal length restriction imposed by the system.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E83-A No.12 pp.2743-2746
- Publication Date
- 2000/12/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- LETTER
- Category
- Digital Signal Processing
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Hideo MURAKAMI, "Generalization of the Cyclic Convolution and Its Fast Computational Systems" in IEICE TRANSACTIONS on Fundamentals,
vol. E83-A, no. 12, pp. 2743-2746, December 2000, doi: .
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 modified Fermat number transform (MFNT) is known to be useful for computing a linear convolution of integer-valued sequences. The generalized cyclic convolution is also applied for generalizing the linear convolution system by MFNT, and easing the signal length restriction imposed by the system.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e83-a_12_2743/_p
Copy
@ARTICLE{e83-a_12_2743,
author={Hideo MURAKAMI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Generalization of the Cyclic Convolution and Its Fast Computational Systems},
year={2000},
volume={E83-A},
number={12},
pages={2743-2746},
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 modified Fermat number transform (MFNT) is known to be useful for computing a linear convolution of integer-valued sequences. The generalized cyclic convolution is also applied for generalizing the linear convolution system by MFNT, and easing the signal length restriction imposed by the system.},
keywords={},
doi={},
ISSN={},
month={December},}
Copy
TY - JOUR
TI - Generalization of the Cyclic Convolution and Its Fast Computational Systems
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2743
EP - 2746
AU - Hideo MURAKAMI
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E83-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2000
AB - 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 modified Fermat number transform (MFNT) is known to be useful for computing a linear convolution of integer-valued sequences. The generalized cyclic convolution is also applied for generalizing the linear convolution system by MFNT, and easing the signal length restriction imposed by the system.
ER -
English
