Punctured Bit Estimation for QC-LDPC Parity Misalignment

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

In memory systems, the misalignment between the number of parity bits required for error correction and the number of parity bits generated by the QC-LDPC code structure leads to unused bits, which increases costs and reduces decoding parallelism, especially as throughput requirements rise.

Innovation Solution

A method and system for punctured bit estimation, where a punctured codeword is received, a reconstructed codeword is generated with default logic values for punctured bits, and a syndrome vector is used to determine unsatisfied parity-checks, allowing for bit value estimation and error correction, thereby optimizing the use of parity bits.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If QC-LDPC code structure is used to enable parallel decoding for high throughput, then decoding parallelism and throughput are improved, but the code length must be multiples of Z-bits causing misalignment with actual parity bit requirements and resulting in unused bits

Engineering Contradiction:
Improvedecoding throughputVSAvoidunused parity bits
Core Design Contradiction:
ProductivityVSLoss of substance

Solution Approach 1:

The patent changes the code length parameter from fixed multiples of Z-bits to flexible lengths that align with actual parity bit requirements. By allowing code lengths to be any value rather than constrained to Z-bit multiples, the system can fully utilize all parity bits without leaving unused bits, while maintaining the parallel decoding structure for high throughput.

Inventive Principle:
Principle #35Parameter changes

2Quantity of substance

If code length is increased to use all parity bits, then utilization of storage resources is improved, but decoding parallelism may be reduced

Engineering Contradiction:
Improveutilization of parity bitsVSAvoiddecoding parallelism
Core Design Contradiction:
Quantity of substanceVSProductivity

Solution Approach 1:

The patent segments the code into tuples of Z-bits while allowing the total code length to be flexible. This segmentation enables parallel decoding of multiple tuples simultaneously, maintaining high throughput. At the same time, the flexible code length allows the total number of bits to align with all available parity bits, ensuring full utilization of storage resources without sacrificing parallelism.

Inventive Principle:
Principle #1Segmentation

3Adaptability or versatility

If third-party controllers or memory are used, then system compatibility is improved, but misalignment between parity bit requirements and QC-LDPC structure occurs

Engineering Contradiction:
Improvecontroller compatibilityVSAvoidparity bit alignment
Core Design Contradiction:
Adaptability or versatilityVSManufacturing precision

Solution Approach 1:

The patent creates a universal QC-LDPC decoding system that can handle both fixed Z-bit multiple code lengths and flexible code lengths aligned with actual parity bit requirements. This multi-functional approach allows the same decoder architecture to work with third-party controllers and memory systems of various configurations, maintaining compatibility while achieving precise parity bit alignment through flexible code length selection.

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

Data Source

PatentUS10979072B2Punctured bit estimation and bit error rate estimation
Publication Date: 2021.04.13 SANDISK TECHNOLOGIES LLC
  • US10979072B2 patent drawing
  • US10979072B2 patent drawing
  • US10979072B2 patent drawing

AI summary

A method for punctured bit estimation includes receiving a punctured codeword. The method further includes generating a reconstructed codeword using the punctured codeword and at least one punctured bit having a default logic value. The method further includes generating a syndrome vector for the reconstructed codeword. The method further includes determining, using the syndrome vector, a number of unsatisfied parity-checks for the at least one punctured bit. The method further includes determining, for the at least one punctured bit, a bit value using, at least, the number of unsatisfied parity-checks associated with the at least one punctured bit.