QC-LDPC Encoder Using Parity Seed Matrices to Cut Memory

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

LDPC encoders require large memory buffers to store code generator matrices, which is inefficient in terms of storage requirements.

Innovation Solution

Implementing quasi-cyclic low-density parity check (QC-LDPC) encoders that store a quasi-cyclic parity seed matrix instead of a full code generator matrix, allowing for reduced storage needs by using a sparse quasi-cyclic parity-check matrix to generate parity symbols.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If a full code generator matrix is stored in the LDPC encoder, then encoding accuracy is maintained, but memory buffer requirements increase significantly

Engineering Contradiction:

Improveencoding accuracyVSAvoidmemory buffer size

Core Design Contradiction:

ReliabilityVSQuantity of substance

Solution Approach 1:

The full code generator matrix is segmented into multiple submatrices with a specific structure. The encoder stores only the essential components (parity seed matrix and connection information) rather than the complete matrix, dividing the storage requirement into manageable parts that can be reconstructed during encoding operations.

Inventive Principle:

Principle #1Segmentation

Solution Approach 2:

The parity seed matrix is pre-computed and stored based on the sparse parity-check matrix structure. This preliminary action allows the full code generator matrix to be reconstructed on-demand during encoding, eliminating the need to store the complete matrix while maintaining encoding accuracy.

Inventive Principle:

Principle #10Preliminary action

2Quantity of substance

If a sparse quasi-cyclic parity-check matrix is used, then storage requirements are reduced, but the complexity of generating the code generator matrix increases

Engineering Contradiction:

Improvestorage requirementsVSAvoidmatrix generation complexity

Core Design Contradiction:

Quantity of substanceVSDevice complexity

Solution Approach 1:

The patent transforms the storage problem by changing the representation parameters. Instead of storing the full dense code generator matrix, the system stores the sparse parity-check matrix parameters (parity seed matrix and connection information), which can be algorithmically transformed into the required code generator matrix form during operation.

Inventive Principle:

Principle #35Parameter changes

Solution Approach 2:

The parity seed matrix serves as an intermediary representation between the sparse parity-check matrix and the full code generator matrix. This intermediate form reduces storage requirements while enabling efficient reconstruction of the complete matrix structure when needed for encoding.

Inventive Principle:

Principle #24Intermediary (Mediator)

Data Source

PatentUS8219868B1Quasi-cyclic low-density parity-check (QC-LDPC) encoder

Publication Date: 2012.07.10 MARVELL ASIA PTE LTD

AI summary

Systems and methods are provided for a quasi-cyclic low-density parity check (QC-LDPC) encoders that have reduced memory requirements. In some embodiments, the LDPC encoder may store a quasi-cyclic parity seed matrix instead of a full code generator matrix. The LDPC encoder may receive a plurality of user symbols and compute a parity seed vector based at least in part on the received user symbols. The LDPC encoder may then use the quasi-cyclic parity seed matrix and the parity seed vector to generate a plurality of parity symbols for the user symbols. In some embodiments, the LDPC encoder may generate a full code generator matrix from a quasi-cyclic parity seed matrix instead of storing the full code generator matrix.