We propose a low-complexity method to find quasi-cyclic low-density parity-check block codes with girth 10 or 12 and length shorter than those designed through classical approaches. The method is extended to time-invariant spatially coupled low-density parity-check convolutional codes, permitting to achieve small syndrome former constraint lengths. Several numerical examples are given to show its effectiveness.
Efficient search of compact QC-LDPC and SC-LDPC convolutional codes with large girth / Tadayon, Mohammad H.; Tasdighi, Alireza; Battaglioni, Massimo; Baldi, Marco; Chiaraluce, Franco. - In: IEEE COMMUNICATIONS LETTERS. - ISSN 1089-7798. - ELETTRONICO. - 22:6(2018), pp. 1156-1159. [10.1109/LCOMM.2018.2827959]
Efficient search of compact QC-LDPC and SC-LDPC convolutional codes with large girth
Battaglioni, Massimo;Baldi, Marco;Chiaraluce, Franco
2018-01-01
Abstract
We propose a low-complexity method to find quasi-cyclic low-density parity-check block codes with girth 10 or 12 and length shorter than those designed through classical approaches. The method is extended to time-invariant spatially coupled low-density parity-check convolutional codes, permitting to achieve small syndrome former constraint lengths. Several numerical examples are given to show its effectiveness.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
