2019/04/15 by Massimo Battaglioni, Franco Chiaraluce, Battaglioni, Massimo +6
Computer Science · Engineering · #Advanced Wireless Communication Techniques #Advanced Wireless Communication Technologies #Cooperative Communication and Network Coding #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT)
paper · pdf · doi:10.48550/arxiv.1904.07158
openalex publication_date 2019/04/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The error correction performance of low-density parity-check (LDPC) codes\nunder iterative message-passing decoding is degraded by the presence of certain\nharmful objects existing in their Tanner graph representation. Depending on the\ncontext, such harmful objects are known as stopping sets, trapping sets,\nabsorbing sets, or pseudocodewords. In this paper, we propose a general\nprocedure based on edge spreading that enables the design of quasi-cyclic (QC)\nspatially coupled low-density parity-check codes (SC-LDPCCs) that are derived\nfrom QC-LDPC block codes and possess a significantly reduced multiplicity of\nharmful objects with respect to the original QC-LDPC block code. This procedure\nrelies on a novel algorithm that greedily spans the search space of potential\ncandidates to reduce the multiplicity of the target harmful object(s) in the\nTanner graph. The effectiveness of the method we propose is validated via\nexamples and numerical computer simulations.\n