Abstract

The computation of cyclic convolutions in Galois fields is an integral part of coding theory and formulation as well as of many signal processing applications. In this paper, we introduce a method for the computation of such convolutions that minimizes, in theory, the computational complexity of the algorithm. We also propose special-purpose computer architecture schemes for the efficient realization of the algorithm, and in general, for efficient calculation of convolutions in Galois fields.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.