An Adaptive Hybrid List Decoding and Chase-like Algorithm for Reed-solomon Codes
نویسندگان
چکیده
This paper presents an adaptive hybrid Chase-like algorithm for Reed-Solomon codes, which is based on the list decoding algorithm. The adaptive hybrid algorithm is based on the reliability threshold to exclude the more reliable bits from being processed by the list decoding algorithm and reduce the complexity of the hybrid algorithm. Simulation results show that the decoding complexities of the adaptive hybrid algorithm for both (15.7) and (31.21) Reed-Solomon codes are almost the same as those of the list decoding algorithm (without Chase algorithm) at high signal-to-noise ratios, but there is a significant improvement in FER performance.
منابع مشابه
Progressive algebraic Chase decoding algorithms for Reed-Solomon codes
This study proposes a progressive algebraic Chase decoding (PACD) algorithm for Reed–Solomon (RS) codes. On the basis of the received information, 2 (η > 0) interpolation test-vectors are constructed for the interpolation-based algebraic Chase decoding. A test-vector reliability function is defined to assess their potential for yielding the intended message. The algebraic Chase decoding will th...
متن کاملIterative Algebraic Soft Decision Decoding of Reed-Solomon Codes
In this paper, we propose an iterative soft decision decoding scheme for Reed Solomon codes with near maximum likelihood performance. The advantage of this decoding algorithm over previously proposed algorithms is its fast convergence in terms of the number of iterations required. This is achieved by combining two powerful soft decision decoding techniques which were previously regarded in the ...
متن کاملSerial Concatenation and Joint Iterative Decoding of LDPC Codes and Reed-Solomon Codes
In this paper, a serial concatenation scheme and its iterative decoding algorithm between Low Density Parity Check codes (LDPC) and Reed-Solomon codes are proposed. For the decoder, the soft output values delivered by LDPC are used as reliability values to perform the Chase decoding of Reed-Solomon (RS) codes which return soft information to LDPC decoder. This approach presents an option scheme...
متن کاملEfficient root-finding algorithm with application to list decoding of Algebraic-Geometric codes
A list decoding for an error-correcting code is a decoding algorithm that generates a list of codewords within a Hamming distance from the received vector, where can be greater than the error-correction bound. In [18], a list-decoding procedure for Reed–Solomon codes [19] was generalized to algebraic–geometric codes. A recent work [8] gives improved list decodings for Reed–Solomon codes and alg...
متن کاملList Decoding of q - ary Reed - Muller Codes 1 )
The q-ary Reed-Muller codes RMq(u,m) of length n = q are a generalization of Reed-Solomon codes, which use polynomials in m variables to encode messages through functional encoding. Using an idea of reducing the multivariate case to the univariate case, randomized list-decoding algorithms for Reed-Muller codes were given in [1] and [15]. The algorithm in [15] is an improvement of the algorithm ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008