SciELO - Scientific Electronic Library Online

 
vol.112 número2Visible Light Communication System Employing Space Time Coded Relay Nodes and Imaging Receivers índice de autoresíndice de materiabúsqueda de artículos
Home Pagelista alfabética de revistas  

Servicios Personalizados

Articulo

Indicadores

Links relacionados

  • En proceso de indezaciónCitado por Google
  • En proceso de indezaciónSimilares en Google

Compartir


SAIEE Africa Research Journal

versión On-line ISSN 1991-1696
versión impresa ISSN 0038-2221

Resumen

GENGA, Yuval; OYERINDE, Olutayo O.  y  VERSFELD, Jaco. Iterative Soft-Input Soft-Output Bit-Level Reed-Solomon Decoder Based on Information Set Decoding. SAIEE ARJ [online]. 2021, vol.112, n.2, pp.52-65. ISSN 1991-1696.

In this paper, a bit-level decoder is presented for soft-input soft-output iterative decoding of Reed-Solomon (RS) codes. The main aim for the development of the proposed algorithm is to reduce the complexity of the decoding process, while yielding a relatively good error correction performance, for the efficient use of RS codes. The decoder utilises information set decoding techniques to reduce the computational complexity cost by lowering the iterative convergence rate during the decoding process. As opposed to most iterative bit-level soft-decision decoders for RS codes, the proposed algorithm is also able to avoid the use of belief propagation in the iterative decoding of the soft bit information, which also contributes to the reduction in the computational complexity cost of the decoding process. The performance of the proposed decoder is investigated when applied to short RS codes. The error correction simulations show the proposed algorithm is able to yield a similar performance to that of the Adaptive Belief Propagation (ABP) algorithm, while being a less complex decoder.

Palabras clave : Reed-Solomon codes; Bit-level decoding; Iterative decoding; Soft-decision decoding; Information set decoding; Decoding complexity.

        · texto en Inglés     · Inglés ( pdf )

 

Creative Commons License Todo el contenido de esta revista, excepto dónde está identificado, está bajo una Licencia Creative Commons