Abstract
In this paper, a family of rate-compatible (RC) low-density parity-check (LDPC) convolutional codes can be obtained from RC-LDPC block codes by graph extension method. The resulted RC-LDPC convolutional codes, which are derived by permuting the matrices of the corresponding RC-LDPC block codes, are systematic and have maximum encoding memory. Simulation results show that the proposed RC-LDPC convolutional codes with belief propagation (BP) decoding collectively offer a steady improvement on performance compared with the block counterparts over the binary-input additive white Gaussian noise channels (BI-AWGNCs).
Similar content being viewed by others
References
SUN X, WU X, JIANG M, et al. Optimised rate-compatible-irregular-repeat-accumulate code for asymmetric Slepian-Wolf coding [J]. IET Communications, 2012, 6(4): 413–418.
HAGENAUER J. Rate-compatible punctured convolutional codes (RCPC codes) and their applications [J]. IEEE Transactions on Communications, 1988, 36(4): 389–400.
AZIZ T, ADNAN M, QIU S H, et al. Performance analysis of multicast coded relay network with LDPC and convolutional codes [C]//IET International Conference on Communication Technology and Application (ICCTA 2011). Beijing, China: IET, 2011: 126–130.
EL-KHAMYM, HOU J, BHUSHAN N. Design of ratecompatible structured LDPC codes for hybrid ARQ applications [J]. IEEE Journal on Selected Areas in Communications, 2009, 27(6): 965–973.
AMAT A G I, MONTORSI G, VATTA F. Design and performance analysis of a new class of rate compatible serially concatenated convolutional codes [J]. IEEE Transactions on Communications, 2005, 57(8): 2280–2289.
ZHOU H, MITCHELL D G M, GOERTZ N, et al. Robust rate-compatible punctured LDPC convolutional codes [J]. IEEE Transactions on Communications, 2013, 61(11): 4428–4439.
HA J, KIM J, MCLAUGHLIN S W. Rate-compatible puncturing of low-density parity-check codes [J]. IEEE Transactions on Information Theory, 2004, 50(11): 2824–2836.
SI Z, THOBABEN R, SKOGLUND M. Ratecompatible LDPC convolutional codes achieving the capacity of the BEC [J]. IEEE Transactions on Information Theory, 2012, 58(6): 4021–4029.
NITZOLD W, LENTMAIER M, FETTWEIS G P. Spatially coupled protograph-based LDPC codes for incremental redundancy [C]//2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC). Gothenburg: IEEE, 2012: 155–159.
FELSTRöM A J, ZIGANGIROV K S. Time-varying periodic convolutional codes with low-density paritycheck matrix [J]. IEEE Transactions on Information Theory, 1999, 45(6): 2181–2191.
COSTELLO D J, PUSANE A E, BATES S, et al. A comparison between LDPC block and convolutional codes [C]// Proceedings of Information Theory & Applicaton Workshop. San Diego, CA: IEEE, 2006: 6–10.
YAZDANI M R, BANIHASHEMI A H. On construction of rate-compatible low-density parity-check codes [J]. IEEE Communications Letters, 2004, 8(3): 159–161.
MU L W, LIU X C, LIANG C L. Improved construction of LDPC convolutional codes with semi-random parity-check matrices [J]. Sciece China Information Sciences, 2014, 57(2): 1–10(in Chinese).
Author information
Authors and Affiliations
Corresponding author
Additional information
Foundation item: the National Natural Science Foundation of China (Nos. 61401164, 61471131 and 61201145), and the Natural Science Foundation of Guangdong Province (No. 2014A030310308)
Rights and permissions
About this article
Cite this article
Mu, L., Han, G. & Liu, Z. Construction of rate-compatible (RC) low-density parity-check (LDPC) convolutional codes based on RC-LDPC block codes. J. Shanghai Jiaotong Univ. (Sci.) 21, 679–683 (2016). https://doi.org/10.1007/s12204-016-1781-5
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12204-016-1781-5
Key words
- rate-compatible (RC) low-density parity-check (LDPC) convolutional codes
- systematic
- maximum encoding memory
- belief propagation (BP) decoding