In this paper we study a special family of Low-Density Parity-Check (LDPC) codes, called Primitive Rate-Compatible (PRC) LDPC codes, obtained by applying puncturing to some properly chosen simplex codes. We investigate their minimum distance properties and give insights on the design of PRC-LDPC codes for use in scenarios where constraints on hardware and software resources require maintaining a low level of complexity. We numerically assess the error rate performance of these codes in such a setting, showing that they also demonstrate good performance under belief propagation decoding, in addition to low decoding complexity.
Design and analysis of a family of complexity-constrained LDPC codes / Battaglioni, Massimo; Amagliani, Matteo; Baldi, Marco; Chiaraluce, Franco; Cancellieri, Giovanni. - ELETTRONICO. - (2024). (Intervento presentato al convegno 2024 IEEE Symposium on Information Theory (ISIT) tenutosi a Athens, Greece nel July 7-12, 2024).
Design and analysis of a family of complexity-constrained LDPC codes
Massimo Battaglioni
Primo
;Matteo Amagliani;Marco Baldi;Franco Chiaraluce;Giovanni CancellieriUltimo
2024-01-01
Abstract
In this paper we study a special family of Low-Density Parity-Check (LDPC) codes, called Primitive Rate-Compatible (PRC) LDPC codes, obtained by applying puncturing to some properly chosen simplex codes. We investigate their minimum distance properties and give insights on the design of PRC-LDPC codes for use in scenarios where constraints on hardware and software resources require maintaining a low level of complexity. We numerically assess the error rate performance of these codes in such a setting, showing that they also demonstrate good performance under belief propagation decoding, in addition to low decoding complexity.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.