This paper presents a design technique for obtaining regular time-invariant low-density parity-check convolutional (RTI-LDPCC) codes with low complexity and good performance. We start from previous approaches which unwrap a low-density parity-check (LDPC) block code into an RTI-LDPCC code, and we obtain a new method to design RTI-LDPCC codes with better performance and shorter constraint length. Differently from previous techniques, we start the design from an array LDPC block code. We show that, for codes with high rate, a performance gain and a reduction in the constraint length are achieved with respect to previous proposals. Additionally, an increase in the minimum distance is observed.
Array Convolutional Low-Density Parity-Check Codes / Baldi, Marco; Cancellieri, Giovanni; Chiaraluce, Franco. - In: IEEE COMMUNICATIONS LETTERS. - ISSN 1089-7798. - STAMPA. - 18:2(2014), pp. 336-339. [10.1109/LCOMM.2013.120713.132177]
Array Convolutional Low-Density Parity-Check Codes
BALDI, Marco;CANCELLIERI, Giovanni;CHIARALUCE, FRANCO
2014-01-01
Abstract
This paper presents a design technique for obtaining regular time-invariant low-density parity-check convolutional (RTI-LDPCC) codes with low complexity and good performance. We start from previous approaches which unwrap a low-density parity-check (LDPC) block code into an RTI-LDPCC code, and we obtain a new method to design RTI-LDPCC codes with better performance and shorter constraint length. Differently from previous techniques, we start the design from an array LDPC block code. We show that, for codes with high rate, a performance gain and a reduction in the constraint length are achieved with respect to previous proposals. Additionally, an increase in the minimum distance is observed.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.