[图书][B] LDPC code designs, constructions, and unification

J Li, S Lin, K Abdel-Ghaffar, WE Ryan, DJ Costello Jr - 2016 - books.google.com
Written by leading experts, this self-contained text provides systematic coverage of LDPC
codes and their construction techniques, unifying both algebraic-and graph-based …

[图书][B] VLSI architectures for modern error-correcting codes

X Zhang - 2016 - api.taylorfrancis.com
Error-correcting codes are ubiquitous. They are adopted in almost every modern digital
communication and storage system, such as wireless communications, optical …

A scheme for collective encoding and iterative soft-decision decoding of cyclic codes of prime lengths: Applications to Reed–Solomon, BCH, and quadratic residue …

S Lin, K Abdel-Ghaffar, J Li, K Liu - IEEE Transactions on …, 2020 - ieeexplore.ieee.org
A novel scheme is presented for encoding and iterative soft-decision decoding of cyclic
codes of prime lengths. The encoding of a cyclic code of a prime length is performed on a …

Progressive algebraic soft-decision decoding of Reed-Solomon codes

L Chen, S Tang, X Ma - IEEE transactions on communications, 2012 - ieeexplore.ieee.org
The algebraic soft-decision decoding (ASD) algorithm is a polynomial-time soft decoding
algorithm for Reed-Solomon (RS) codes. It outperforms both the algebraic hard-decision …

Efficient low-complexity decoding of CCSDS Reed–Solomon codes based on Justesen's concatenation

RS Elagooz, A Mahran, S Gasser… - IEEE Access, 2019 - ieeexplore.ieee.org
Forward error correction (FEC) is a key capability in modern satellite communications that
provide the system designer with the needed flexibility to comply with the different …

Fast Chase decoding algorithms and architectures for Reed–Solomon codes

Y Wu - IEEE transactions on information theory, 2011 - ieeexplore.ieee.org
Chase decoding is a prevalent soft-decision decoding method for algebraic codes where an
efficient bounded-distance decoder is available. Essentially, it repeatedly applies bounded …

Low-complexity soft-decoding algorithms for Reed–Solomon codes—Part II: Soft-input soft-output iterative decoding

J Bellorado, A Kavcic, M Marrow… - IEEE Transactions on …, 2010 - ieeexplore.ieee.org
In this paper, we present a practical approach to the iterative decoding of Reed-Solomon
(RS) codes. The presented methodology utilizes an architecture in which the output …

[PDF][PDF] Higher performance and lower complexity turbo decoding scheme for 4G-LTE using unpunctured turbo trellis-coded modulation

EL Abderraouf, A Bassou… - Indonesian Journal of …, 2020 - researchgate.net
Mobile communications have become necessities and even everyday commodities. In the
previous decades they evolved from a technology reserved for a limited number of …

Low-complexity Chase decoding of Reed-Solomon codes using module

J Xing, L Chen, M Bossert - IEEE Transactions on …, 2020 - ieeexplore.ieee.org
The interpolation based algebraic soft decoding yields a high decoding performance for
Reed-Solomon (RS) codes with a polynomial-time complexity. Its computationally expensive …

Reduced-complexity multiplicity assignment algorithm and architecture for low-complexity Chase decoder of Reed-Solomon codes

X Peng, W Zhang, W Ji, Z Liang… - IEEE Communications …, 2015 - ieeexplore.ieee.org
A reduced-complexity multiplicity assignment (RCMA) algorithm for low-complexity chase
(LCC) is proposed for decoding Reed-Solomon (RS) codes. The properties of bit-level …