LDPC Parity Check Matrix Layout for Reliable High-Speed Decoding

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current LDPC encoding and decoding technologies face challenges in achieving high performance due to noise, fading, and inter-symbol interference in communication systems, particularly in high-speed digital communication systems, where existing error correction codes struggle to maintain reliability and throughput.

Innovation Solution

The development of an LDPC encoding and decoding apparatus and method that utilizes a parity check matrix with an information word sub-matrix and a parity sub-matrix, structured into column groups, to generate and decode LDPC codewords, improving performance by optimizing the positions and number of weight-1s in the parity check matrix.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If conventional error correction codes are used in high-speed digital communication systems, then implementation is simpler, but reliability and throughput are insufficient due to noise, fading, and inter-symbol interference

Engineering Contradiction:
ImprovereliabilityVSAvoidcomplexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The parity check matrix is divided into multiple column groups, where each column group contains a specific number of columns. This segmentation allows the encoding process to be broken down into manageable steps, improving both reliability through systematic error correction and controlling complexity by organizing the matrix structure into repeating patterns that can be processed efficiently

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The invention optimizes specific parameters of the parity check matrix including the number of column groups, the number of columns per group, and the positions of weight-1s (non-zero elements). By carefully adjusting these parameters, the system achieves high reliability for LDPC codes while maintaining implementation feasibility through structured designs that balance performance requirements with computational complexity

Inventive Principle:
Principle #35Parameter changes

2Reliability

If the parity check matrix is optimized for high performance, then reliability improves, but the complexity of encoding and decoding increases

Engineering Contradiction:
ImprovereliabilityVSAvoidease of implementation
Core Design Contradiction:
ReliabilityVSEase of manufacture

Solution Approach 1:

The parity check matrix is designed with specific local structures where certain column groups have predetermined patterns of weight-1s. This local quality approach allows high-performance error correction in critical regions while using simpler repeating patterns in other regions, thereby improving reliability where needed and easing implementation through standardized structures that can be pre-computed and stored

Inventive Principle:
Principle #3Local quality

3Reliability

If iterative decoding based on sum-product algorithm is applied, then performance approaches channel capacity, but computational complexity and processing time increase

Engineering Contradiction:
ImproveperformanceVSAvoidprocessing time
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The parity check matrix is pre-structured with column groups and optimized weight-1 positions before the decoding process begins. This preliminary action allows the sum-product algorithm to operate more efficiently during iterative decoding by reducing the number of computations required at each iteration, thereby approaching channel capacity while minimizing processing time and computational overhead

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS9362952B2Apparatuses and methods for encoding and decoding of parity check codes
Publication Date: 2016.06.07 SAMSUNG ELECTRONICS CO LTD

AI summary

An encoding apparatus is provided. The encoding apparatus includes: a low density parity check (LDPC) encoder configured to generate an LDPC codeword formed of 16200 bits by performing LDPC encoding based on a parity check matrix, wherein the parity check matrix includes an information word sub-matrix and a parity sub-matrix, the information word sub-matrix being formed of a plurality of column groups each including 360 columns and being defined as a table indicating a position of one (1) present in each 360-th column.