On Generalized LDPC Codes for 5G Ultra Reliable Communication

TL;DR

This paper introduces a practical construction of quasi-cyclic GLDPC codes optimized for 5G ultra-reliable communication, demonstrating superior block error rate performance over existing codes in AWGN channels.

Contribution

It presents a novel quasi-cyclic GLDPC code construction with an asymptotic analysis for the proportion of generalized constraints, enhancing low latency communication.

Findings

Outperforms state-of-the-art codes in BLER performance for 5G URC.

Provides a constraint-to-variable update rule tailored for component codewords.

Demonstrates effectiveness over AWGN channels with QPSK modulation.

Abstract

Generalized low-density parity-check (GLDPC) codes, where single parity-check (SPC) constraint nodes are replaced with generalized constraint (GC) nodes, are a promising class of codes for low latency communication. In this paper, a practical construction of quasi-cyclic (QC) GLDPC codes is proposed, where the proportion of generalized constraints is determined by an asymptotic analysis. We analyze the message passing process and complexity of a GLDPC code over the additive white gaussian noise (AWGN) channel and present a constraint-to-variable update rule based on the specific codewords of the component code. The block error rate (BLER) performance of the GLDPC codes, combined with a complementary outer code, is shown to outperform a variety of state-of-the-art code and decoder designs with suitable lengths and rates for the 5G Ultra Reliable Communication (URC) regime over an additive white gaussian noise (AWGN) channel with quadrature PSK (QPSK) modulation.