Rate-compatible spatially coupled repeat-accumulate codes via successive extension

被引：0

作者：

Liu Y. ^{[1
]}

Wang B. ^{[1
]}

Zhang Y. ^{[1
]}

Sun Y. ^{[2
]}

机构：

[1] School of Communication and Information Engineering, Xi'an University of Science and Technology, Xi'an

[2] School of Information and Control Engineering, China University of Mining and Technology, Xuzhou

来源：

High Technology Letters | 2019年 / 25卷 / 02期

基金：

中国国家自然科学基金;

关键词：

Density evolution; Iterative decoding; Rate compatibility; Spatially coupled LDPC codes; Spatially coupled RA codes;

D O I：

10.3772/j.issn.1006-6748.2019.02.014

中图分类号：

学科分类号：

摘要：

A rate-compatible spatially coupled repeat-accumulate (RC-SC-RA) code is proposed. Its protograph is obtained by extending a given (J, K, L) SC-RA coupled chain (denoted as the mother chain) with extra check nodes and parity bit nodes T times. At each time, the extension is realized via coupling the message bits in the same way as that in the mother chain. Rate-compatibility is achieved by adjusting the extension parameters and applying random puncturing technique. Density evolution analysis shows that the iterative decoding thresholds of all the member codes in the proposed RC-SC-RA code family are very close to Shannon limits over the binary erasure channel. Finite length simulation results are consistent with the thresholds well. Moreover, the proposed RC-SC-RA codes perform better than spatially coupled low density parity check (SC-LDPC) codes in decoding performance especially in lower-rate region. Copyright © by HIGH TECHNOLOGY LETTERS PRESS.

引用

页码：224 / 229

页数：5

共 12 条

[1]

Joachim H., Rate compatible punctured convolutional codes (RCPC codes) and their applications, IEEE Transactions on Communications, 36, 4, pp. 389-400, (1988)

[2]

Jaeongseok H., Jaehong K., Mclaughlin S.W., Rate-compatible puncturing of low-density parity-check codes, IEEE Transactions Information Theory, 50, 11, pp. 2824-2836, (2004)

[3]

Hsu C.H., Achilleas A., Capacity achieving LDPC codes through puncturing, IEEE Transactions on Information Theory, 54, 10, pp. 4698-4706, (2008)

[4]

Yue G.S., Wang X.D., Mohammad M., Design of rate-compatible irregular repeat accumulate codes, IEEE Transactions on Communications, 55, 6, pp. 1153-1163, (2007)

[5]

Noah J., Robert S., Design of rate-compatible irregular LDPC codes based on edge growth and parity splitting, IEEE 66th Vehicular Technology Conference, pp. 1052-1056, (2007)

[6]

Shrinivas K., Thomas J.R., Rudiger L.U., Threshold saturation via spatial coupling: why convolutional LDPC ensembles perform so well over the BEC, IEEE Transactions on Information Theory, 57, 2, pp. 803-834, (2011)

[7]

Liu Y., Li Y., Chi Y.H., Spatially coupled LDPC codes constructed by parallelly connecting multiple chains, IEEE Communications Letters, 19, 9, pp. 1472-1475, (2015)

[8]

Si Z.W., Ragnar T., Mikael S., Rate- compatible LDPC convolutional codes achieving the capacity of the BEC, IEEE Transactions on Information Theory, 58, 6, pp. 4021-4029, (2012)

[9]

Walter N., Michael L., Gerhard P.F., Spatially coupled protograph-based LDPC codes for incremental redundancy, Proceedings of the 7th International Symposium on Turbo Codes and Iterative Information Processing, pp. 155-159, (2012)

[10]

Sarah J., Gottfried L., Spatially coupled repeat-accumulate codes, IEEE Communications Letters, 17, 2, pp. 373-376, (2013)

← 1 2 →