Simplification of the Reed-Solomon encoder using alternative simple polynomials forming extensions of Galois fields
Abstract
In this paper, we introduce the possible gains in the hardware implementation of a Reed-Solomon encoder, expressed in the number of gates that are required in the simplified scheme. The basis of simplification is the usage of alternative polynomial for isomorphic extensions of the Galois field GF (2), and variations of different integral representations of the code generator polynomial of the Reed-Solomon code.
References
1. Clarke C. K. P. Reed-Solomon error correction, BBC R&D White Paper № 031, 2002. - 47 p.
2. Блейхут Р. Теория и практика кодов, контролирующих ошибки: Пер. с англ./ Под ред. К.Ш. Зигангирова.- М.: Мир, 1986.- 576 с.
3. Макаров А.А., Прибылов В.П. Помехоустойчивое кодирование: основы теории и практические приложения. - Новосибирск: Сиб. гос. ун-т телекоммуникаций и информатики, 2005.- 186 с.
Review
For citations:
Kleyko D..., Lyamin N... Simplification of the Reed-Solomon encoder using alternative simple polynomials forming extensions of Galois fields. The Herald of the Siberian State University of Telecommunications and Information Science. 2010;(4):20-25. (In Russ.)
Views:
114
Email this article 
