Iterative list decoding approach for reed-solomon codes

被引：0

作者：

Zhijun Z. ^{[1
]}

Kai N. ^{[1
]}

Chao D. ^{[1
]}

机构：

[1] Key Laboratory of Universal Wireless Communications, Beijing University of Posts and Telecommunications, Beijing

来源：

Journal of China Universities of Posts and Telecommunications | 2019年 / 26卷 / 03期

基金：

中国国家自然科学基金;

关键词：

Iterative decoding; Low-complexity decoding; Reed-Solomon codes; Soft-decision decoding;

D O I：

10.19682/j.cnki.1005-8885.2019.0014

中图分类号：

学科分类号：

摘要：

A novel adaptively iterative list decoding (ILD) approach using for Reed-Solomon (RS) codes was investigated. The proposed scheme is exploited to reduce the complexity of RS Chase algorithm (CA) via an iterative decoding attempt mode. In each decoding attempt process, a test pattern is generated by flipping the bits of the least reliable positions (LRPs) within the received hard-decision (HD) vector. The ILD algorithm continues until a test pattern is successfully decoded by the underlying Berlekamp-Massey algorithm (BMA) of RS codes. Flipping within the same bits, the ILD algorithm provides the same test pattern set as the conventional RS CA, thus there is no degradation in error-rate performance. Without decoding all test patterns, the ILD algorithm can simplify the decoding complexity by its early termination. Simulation results show that the average complexity of the ILD algorithm is much lower than that of the conventional RS CA (and is similar to that of BMA decoding) at high signal-to-noise ratio (SNR) region with no less to the RS CA decoding error-rate performance. © 2019, Beijing University of Posts and Telecommunications. All rights reserved.

引用

页码：8 / 14

页数：6

共 7 条

[1]

Dau H., Duursma I.M., Kiah H.M., Et al., Repairing Reed-Solomon codes with multiple erasures, IEEE Transactions on Information Theory, 64, 10, pp. 6567-6582, (2018)

[2]

Guruswami V., Wootters M., Repairing Reed-Solomon codes, IEEE Transactions on Information Theory, 63, 9, pp. 684-5698, (2017)

[3]

Chase D., Class of algorithms for decoding block codes with channel measurement information, IEEE Transactions on Information Theory, 18, 1, pp. 170-182, (1972)

[4]

Bellorado J., Kavcic A., Low-complexity soft-decoding algorithms for Reed-Solomon codes—Part I: An algebraic soft-in hard-out chase decoder, IEEE Transactions on Information Theory, 56, 3, pp. 945-959, (2010)

[5]

Cunha D.C., Portugheis J., Do Nascimento V.V., Symbol-wise chase decoding of q-ary block codes over BI-AWGN channels, IEEE Communications Letters, 15, 2, pp. 229-231, (2011)

[6]

Leroux C., Hemati S., Mannor S., Et al., Stochastic chase decoding of Reed-Solomon codes, IEEE Communications Letters, 14, 9, pp. 863-865, (2010)

[7]

Lin S., Costello D.J., Error Control Coding, (2001)

← 1 →