Quasi-Cyclic LDPC Basic Matrix Layout for Higher Girth Decoding

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

The design of basic matrices for quasi-cyclic low-density parity-check (LDPC) codes poses challenges in achieving good decoding performance due to difficulties in designing matrices that avoid error floors and ensure high girth characteristics, which are crucial for maintaining error-free transmission in digital communication systems.

Innovation Solution

A method and apparatus for quasi-cyclic LDPC encoding that determines a parity check matrix based on a basic matrix and lifting size Z, where the basic matrix is derived from a coefficient matrix, enabling the creation of LDPC encoded sequences with improved performance by optimizing the girth and error floor characteristics.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If conventional basic matrices are used for quasi-cyclic LDPC encoding, then the encoding process is simple, but the decoding performance deteriorates due to error floors and low girth characteristics

Engineering Contradiction:
Improvedecoding performanceVSAvoidbasic matrix design complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent applies parameter changes by systematically varying the girth parameter of the basic matrix. Different embodiments use basic matrices with girth values of 6, 8, 10, or 12, demonstrating that changing this structural parameter directly improves decoding performance and reduces error floors while maintaining the quasi-cyclic encoding framework

Inventive Principle:
Principle #35Parameter changes

Solution Approach 2:

The patent employs preliminary action by pre-designing and selecting basic matrices with optimized girth characteristics before the actual encoding process. The basic matrix is carefully constructed in advance to ensure high girth properties, which then guarantee reliable decoding performance during operation without requiring real-time adjustments

Inventive Principle:
Principle #10Preliminary action

2Reliability

If basic matrices with high girth characteristics are designed, then error correction capabilities improve, but the design and implementation complexity increases

Engineering Contradiction:
Improveerror correction capabilityVSAvoidbasic matrix implementation ease
Core Design Contradiction:
ReliabilityVSEase of manufacture

Solution Approach 1:

The patent systematically explores different girth parameters (6, 8, 10, 12) to find the optimal balance between error correction capability and implementation complexity. By changing the girth parameter, the patent achieves progressively better error correction performance while providing designers with selectable options based on specific application requirements

Inventive Principle:
Principle #35Parameter changes

Solution Approach 2:

The patent segments the basic matrix design into modular components that can be systematically constructed. The quasi-cyclic structure allows the basic matrix to be divided into smaller blocks, making it easier to design and implement high-girth matrices by combining standardized sub-structures rather than designing the entire matrix as a single complex unit

Inventive Principle:
Principle #1Segmentation

Data Source

PatentUS11159178B2Method and apparatus for quasi-cyclic low-density parity-check
Publication Date: 2021.10.26 ZTE CORP
  • US11159178B2 patent drawing
  • US11159178B2 patent drawing

AI summary

Provided is a design method and apparatus for quasi-cyclic low-density parity-check (LDPC) encoding. The method includes: performing LDPC encoding on a K-bit information sequence to be encoded according to a parity check matrix of a quasi-cyclic LDPC code to obtain an N-bit LDPC encoded sequence, where the parity check matrix is determined according to a basic matrix and a lifting size Z, and the basic matrix is determined according to the lifting size Z and a coefficient matrix, where K is a positive integer, N is an integer greater than K, and Z is a positive integer.