Home         Authors   Papers   Year of conference   Themes   Organizations        To MES conference

Polynomial modular multipliers for error correcting code devices  

 Poperechny P.S.
Date of publication

 It is known that, the widespread and complicated arithmetic operation in error correction coding is a multiplying. In spite of being the formal derivative, dividing, power operations in RS-codes, all of these operations are collapsed to adding and multiplying in extended Galois Field. Once decided of data length, all vector multiplying are performed by the one primitive polynomial that generates Field. So it is very hard to change this polynomial in work circuit. The proposed approach allows changing primitive polynomial. The calculation ďforgetsĒ original extension of Field, thatís why itís very easy to return to any Field after calculation just by means of primitive polynomial dividing. Even more, as input vectors are imaged to residue polynomials, all calculations are shared by parallel small calculating block. These blocks have so small critic path delay, and common performance throughput is increased.
 Error-correction coding, extended Galois Field, primitive polynomial, polynomial multiplier, residue number system, SoC.
Library reference
 Poperechny P.S. Polynomial modular multipliers for error correcting code devices // Problems of Perspective Micro- and Nanoelectronic Systems Development - 2016. Proceedings / edited by A. Stempkovsky, Moscow, IPPM RAS, 2016. Part 1. P. 274-277.
URL of paper

Copyright © 2009-2019 IPPM RAS. All Rights Reserved.

Design of site: IPPM RAS