LDPC Parity Check Matrix With Uniform Parity Column Weights

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing LDPC parity check matrices, such as those used in MoCA networks, have a lower triangular structure that leads to increased decoding errors and more iterations, particularly in the last parity column with a column weight of one, resulting in reduced robustness.

Innovation Solution

A robust LDPC parity check matrix is designed with a systematic portion and a parity portion, where the weights of each column in the parity portion are made uniform, and each element determines a cyclic shift for the corresponding identity submatrix, enhancing the matrix's structure for improved decoding efficiency.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Device complexity

If a lower triangular structure is used for the LDPC parity check matrix, then the matrix structure is simplified and easier to implement, but decoding errors increase and more iterations are required

Engineering Contradiction:
Improvematrix structure complexityVSAvoiddecoding reliability
Core Design Contradiction:
Device complexityVSReliability

Solution Approach 1:

The patent applies asymmetry by transforming the lower triangular structure into a circulant structure with uniform column weights. The parity check matrix is designed with circulant submatrices where each column has the same weight, creating an asymmetric distribution pattern that improves decoding performance while maintaining structural regularity for implementation efficiency.

Inventive Principle:
Principle #4Asymmetry

Solution Approach 2:

The patent changes the structural parameters of the parity check matrix by enforcing uniform column weights across all columns. This parameter modification transforms the variable column weight structure into a constant column weight structure, which resolves the decoding reliability issue while preserving the systematic form of the matrix.

Inventive Principle:
Principle #35Parameter changes

2Ease of manufacture

If the last parity column has a column weight of one, then the matrix construction is simplified, but decoding errors increase significantly

Engineering Contradiction:
Improvematrix construction easeVSAvoiddecoding accuracy
Core Design Contradiction:
Ease of manufactureVSReliability

Solution Approach 1:

The patent applies local quality by ensuring that every column in the parity portion, including the last parity column, has the same uniform weight. This local uniformity prevents the degradation that occurs with column weight of one, while the overall circulant structure maintains construction simplicity. Each local column is optimized to have adequate weight for reliable decoding.

Inventive Principle:
Principle #3Local quality

3Reliability

If uniform column weights are enforced in the parity portion, then decoding errors are reduced and robustness is improved, but the matrix design complexity increases

Engineering Contradiction:
Improvedecoding robustnessVSAvoidmatrix design complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent achieves universality through the circulant structure, where a single generating matrix defines all circulant submatrices in the parity portion. This multi-functional approach allows uniform column weights to be enforced across all columns while using a compact representation that reduces design complexity. The same structural rules apply universally to all columns, simplifying the overall design process.

Inventive Principle:
Principle #6Universality (Multi-functionality)

Data Source

PatentUS11831329B2LDPC code matrices
Publication Date: 2023.11.28 ENTROPIC COMM INC
  • US11831329B2 patent drawing
  • US11831329B2 patent drawing
  • US11831329B2 patent drawing

AI summary

An LDPC parity check matrix includes a systematic portion having a plurality of systematic elements and a parity portion having a plurality of parity elements. The value of each systematic element determines a cyclic shift to be applied to rows of an identity submatrix corresponding to that element. The value of each parity element determines a cyclic shift to be applied to rows of an identity submatrix corresponding to that element. The weights of two or more columns of the parity portion are the same.