Variable-Length GLDPC Coding for BER and Decoding Resilience

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Existing error correction systems, particularly those using generalized low-density parity-check (GLDPC) codes, face challenges in designing encoders and achieving optimal bit error rate (BER) performance due to the complexity of constructing codewords with variable lengths and error correction capabilities.

Innovation Solution

The implementation of a GLDPC error correction system that constructs codewords with at least two constituent codewords of varying lengths and error correction capabilities, where each data block is protected twice, and the error correction capability of the longer codeword is greater than that of the shorter codeword, allowing for improved resilience to noise and better BER performance.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If GLDPC codes with variable length constituent codewords are used to improve BER performance, then bit error rate performance is improved, but encoder design complexity increases

Engineering Contradiction:

Improvebit error rate performanceVSAvoidencoder design complexity

Core Design Contradiction:

ReliabilityVSDevice complexity

Solution Approach 1:

The GLDPC code is segmented into multiple constituent codewords with different lengths and error correction capabilities. Each constituent codeword is designed independently with specific parameters (length, error correction capability), allowing the overall code to achieve superior BER performance while maintaining manageable encoder design through modular construction

Inventive Principle:

Principle #1Segmentation

Solution Approach 2:

Different portions of the encoded data are assigned to constituent codewords with locally optimized qualities. Specifically, certain data blocks are protected by longer codewords with higher error correction capability, while other blocks use shorter codewords, creating a non-uniform structure that optimizes overall reliability without requiring uniform complexity across all encoder components

Inventive Principle:

Principle #3Local quality

2Reliability

If multiple constituent codewords with different lengths are used to protect each data block, then error correction capability is improved, but decoding complexity increases

Engineering Contradiction:

Improveerror correction capabilityVSAvoiddecoding complexity

Core Design Contradiction:

ReliabilityVSDevice complexity

Solution Approach 1:

The decoding process begins with preliminary identification of which constituent codewords have failed and which data blocks are shared between failed codewords. This preliminary action allows the system to focus subsequent decoding efforts on specific problematic areas rather than processing all codewords uniformly, thereby managing decoding complexity while maintaining high error correction capability

Inventive Principle:

Principle #10Preliminary action

Solution Approach 2:

Shared data blocks between constituent codewords act as intermediaries that link multiple codewords together. When decoding fails occur, these shared blocks serve as focal points for coordinated decoding operations, allowing the system to resolve errors across multiple codewords through a structured intermediary approach rather than attempting simultaneous decoding of all components

Inventive Principle:

Principle #24Intermediary (Mediator)

3Reliability

If data blocks are erased in failed constituent codewords to resolve stuck error patterns, then decoding success is improved, but information loss increases

Engineering Contradiction:

Improvedecoding successVSAvoiddata block erasure

Core Design Contradiction:

ReliabilityVSLoss of information

Solution Approach 1:

The erasure of data blocks in failed constituent codewords, which initially appears as information loss, is converted into a beneficial decoding strategy. By deliberately erasing shared data blocks in failed codewords, the system creates a controlled information loss that enables successful decoding of the overall GLDPC code, thereby transforming a potential harm into a useful mechanism for resolving stuck error patterns

Inventive Principle:

Principle #22Blessing in disguise (Convert harm into benefit)

Data Source

PatentUS10153785B1Generalized low-density parity-check (GLDPC) code with variable length constituents

Publication Date: 2018.12.11 SK HYNIX INC

AI summary

Techniques for improving the bit error rate (BER) performance of an error correction system are described. In an example, the error correction system implements generalized low-density parity-check (GLDPC) encoding and decoding. To generate a GLDPC codeword, the error correction system accesses data blocks. Each data block includes one or more bits. The error correction system also generates a first constituent codeword of the GLDPC codeword. The first constituent codeword encodes at least a data block from the data blocks and has a first length and a first error correction capability. The error correction system also generates a second constituent codeword of the GLDPC codeword. The second constituent codeword encodes at least the data block and has a second length and a second error correction capability. The second length is different from the first length. The second error correction capability is different from the first error correction capability.