2D Generalized Concatenated Codes for Iterative Flash Decoding

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing flash memory devices lack a simple scheme for iterative decoding of generalized concatenated codes (GCCs), particularly for binary fields, which are essential for high reliability and fast access.

Innovation Solution

A 2D-GCC S-BCH code construction using a binary matrix with BCH and GRS codes, allowing iterative decoding through a GCC sequential decoder and multi-stage decoding algorithms.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Ease of manufacture

If a sequential multi-stage decoder is used for GCCs, then the encoder scheme remains simple, but iterative decoding cannot be performed

Engineering Contradiction:
Improveencoder simplicityVSAvoiditerative decoding capability
Core Design Contradiction:
Ease of manufactureVSAdaptability or versatility

Solution Approach 1:

The patent extends the traditional one-dimensional GCC code to a two-dimensional structure where codewords are arranged in a matrix format. This allows the system to perform iterative decoding by alternating between row decoding and column decoding, effectively adding a spatial dimension to the decoding process. The 2D structure enables the sequential decoder to achieve iterative decoding capability while maintaining the simplicity of the original encoder scheme.

Inventive Principle:
Principle #17Another dimension (Dimensionality change)

2Ease of manufacture

If traditional GCC codes are used, then encoding is simple, but decoding reliability is insufficient for high-performance flash memory

Engineering Contradiction:
Improveencoding simplicityVSAvoiddecoding reliability
Core Design Contradiction:
Ease of manufactureVSReliability

Solution Approach 1:

By organizing codewords in a two-dimensional matrix structure, the patent enables redundant checking across both rows and columns. The iterative decoding process alternates between decoding rows and columns, providing multiple opportunities to correct errors. This dimensional extension significantly improves decoding reliability while preserving the simplicity of the encoding process.

Inventive Principle:
Principle #17Another dimension (Dimensionality change)

Solution Approach 2:

The iterative decoding mechanism implements feedback by using the output of row decoding as input for column decoding, and vice versa. Each decoding pass provides feedback information that refines the error correction capability. This feedback loop continues until convergence or a maximum number of iterations is reached, substantially improving decoding reliability.

Inventive Principle:
Principle #23Feedback

3Speed

If fast access is implemented by breaking WLs into RAUs, then access speed increases, but error protection complexity increases

Engineering Contradiction:
Improveaccess speedVSAvoiderror protection complexity
Core Design Contradiction:
SpeedVSDevice complexity

Solution Approach 1:

The 2D-GCC structure organizes error protection data in a matrix format that aligns with the RAU structure. By performing iterative row-column decoding, the system efficiently protects multiple RAUs simultaneously without proportionally increasing complexity. The structured approach allows parallel processing of multiple codewords, maintaining manageable complexity despite increased error protection requirements.

Inventive Principle:
Principle #17Another dimension (Dimensionality change)

Data Source

PatentUS20260106633A1Two-dimensional generalized concatenated codes with sub-fields
Publication Date: 2026.04.16 SAMSUNG ELECTRONICS CO LTD
  • US20260106633A1 patent drawing
  • US20260106633A1 patent drawing
  • US20260106633A1 patent drawing

AI summary

Devices, systems, and methods for managing a storage device configured to store a plurality of codewords, including: obtaining a two-dimensional (2D) generalized concatenated code (GCC) codeword from the storage device; providing the codeword to a sequential decoder; based on detecting a first failure by the sequential decoder, updating the codeword and transposing the updated codeword to obtain a transposed codeword; providing the transposed codeword to the sequential decoder; and obtaining information bits corresponding to the codeword based on a result obtained by the sequential decoder.