In the GC-LDPC code, the replacement set plays an important role in the construction of the parity-check matrix H. Considering BIBDs with λ = 1, a replacement set can be structured which satisfies RC-constraint. The parity-check matrix H of the GC-LDPC code can be straightforwardly constructed from the replacement set. Simulation results show that the performance of BIBDs based CN-GC-LDPC code surpasses finite field based CN- GC-LDPC code.
Construction of Replacement Set in the GC-LDPC Codes Based on BIBDs
2019-04-01
138209 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Full diversity random LDPC codes
IEEE | 2011
|Low-Complexity Concatenated LDPC-Staircase Codes
British Library Online Contents | 2018
|Low-Latency Decoding of EG LDPC Codes
British Library Online Contents | 2007
|Lower Error Floors for NASA LDPC Codes
NTRS | 2011
|Noise-Assisted List Decoding for 5G LDPC Codes
IEEE | 2022
|