Compact QC-LDPC Block and SC-LDPC Convolutional Codes for Low-Latency\n Communications

2018/09/12 by Massimo Battaglioni, Battaglioni, Massimo, Alireza Tasdighi +7
Computer Science · Engineering · #Advanced MIMO Systems Optimization #Advanced Wireless Communication Techniques #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT)

paper · pdf · doi:10.48550/arxiv.1809.04662

openalex publication_date 2018/09/12 · openalex created_date 2022/08/03 · openalex updated_date 2026/07/28

Abstract

Low decoding latency and complexity are two important requirements of channel\ncodes used in many applications, like machine-to-machine communications. In\nthis paper, we show how these requirements can be fulfilled by using some\nspecial quasi-cyclic low-density parity-check block codes and spatially coupled\nlow-density parity-check convolutional codes that we denote as compact. They\nare defined by parity-check matrices designed according to a recent approach\nbased on sequentially multiplied columns. This method allows obtaining codes\nwith girth up to 12. Many numerical examples of practical codes are provided.\n

Related

• Efficient Search of Compact QC-LDPC and SC-LDPC Convolutional Codes with Large Girth
• Memory Efficient Decoders using Spatially Coupled Quasi-Cyclic LDPC Codes
• Construction of LDPC convolutional codes with large girth from Latin squares
• Parity-Check Matrix Partitioning for Efficient Layered Decoding of QC-LDPC Codes
• Performance Comparison of LDPC Block and Spatially Coupled Codes over GF(q)