[Back]

Hua Zhou, N. Görtz:
"Recoverability of Variable Nodes in Periodically Punctured LDPC Convolutional Codes";
IEEE Communications Letters, 19 (2015), 4; 521 - 524.

The concept of transformed codes is introduced to algebraically evaluate the recoverability of punctured nodes for periodically punctured low-density parity-check convolutional codes (LDPC-CCs) by a simple matrix-based approach. The proposed very efficient algorithm allows to identify and exclude those candidate puncturing patterns in a computer search that contain unrecoverable nodes that would lead to bad error-correction performance. Moreover, a novel upper bound on the maximum punctured code rate is obtained, above which any punctured code must contain unrecoverable punctured nodes.

The concept of transformed codes is introduced to algebraically evaluate the recoverability of punctured nodes for periodically punctured low-density parity-check convolutional codes (LDPC-CCs) by a simple matrix-based approach. The proposed very efficient algorithm allows to identify and exclude those candidate puncturing patterns in a computer search that contain unrecoverable nodes that would lead to bad error-correction performance. Moreover, a novel upper bound on the maximum punctured code rate is obtained, above which any punctured code must contain unrecoverable punctured nodes.

LDPC codes, puncturing, cycles

http://dx.doi.org/10.1109/LCOMM.2015.2404434