Parallel LDPC Encoding With Quasi-Cyclic Parity Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
As memory systems increase in size, they face challenges in accurately transmitting and verifying data due to noise-induced errors such as program disturb errors and inter-cell interference in solid state memory storage devices, which affect data integrity and longevity.
Innovation Solution
The implementation of an LDPC encoding method using a low-density parity check matrix and a quasi-cyclic matrix for error correction, where partial syndromes are calculated and used to generate a parity portion, which is then concatenated with the user portion to form a codeword, enhancing data integrity and error correction capabilities.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If memory systems increase in size to provide higher storage capacity, then storage capacity is improved, but noise-induced errors such as program disturb errors and inter-cell interference increase, worsening data integrity
Solution Approach 1:
The LDPC code is segmented into user portion and parity portion, with the parity portion further divided into multiple segments that are processed independently through parallel computation. This segmentation allows error correction capabilities to be distributed across multiple segments, improving overall data integrity in large-scale memory systems without sacrificing storage capacity.
Solution Approach 2:
The parity portion acts as an intermediary that mediates between the user data and potential errors. By calculating and storing parity information separately, the system can detect and correct errors in the user portion without directly modifying the original data, thus maintaining data integrity while supporting large storage capacities.
2Reliability
If LDPC encoding is implemented to improve data integrity and error correction, then reliability is improved, but computational complexity and processing time increase, worsening productivity
Solution Approach 1:
The LDPC encoding process is divided into multiple independent segments that can be computed in parallel. The parity portion is segmented and processed through parallel computation paths, reducing the overall processing time while maintaining the full error correction capability of the complete LDPC code.
Solution Approach 2:
The encoding process uses periodic operations with the quasi-cyclic matrix structure, where computations are performed in regular intervals and patterns. This periodic structure enables optimization of the computation flow and facilitates parallel processing, improving processing speed without compromising data integrity.
3Productivity
If parallel computation with segment processing of quasi-cyclic matrix is used to improve processing speed, then productivity is improved, but device complexity increases, worsening ease of manufacture
Solution Approach 1:
The quasi-cyclic matrix structure serves multiple functions: it enables parallel computation for speed, provides a regular pattern that simplifies hardware design, and maintains the error correction properties of LDPC codes. This multi-functionality allows the system to achieve high processing speed without proportionally increasing device complexity.
Solution Approach 2:
The system changes the structural parameters of the parity check matrix to a quasi-cyclic form, which has regular patterns that can be efficiently implemented in hardware. This parameter change enables parallel processing while keeping the device complexity manageable through the use of repeating structures and standardized computation units.
Data Source
AI summary
An LDPC encoding method and a system for error code detection. In the method and system, partial syndromes using a user portion and a low density parity check matrix are calculated, a parity portion of a codeword is calculated using the partial syndromes and using a quasi-cyclic matrix, the parity portion is generated by segment processing of the quasi-cyclic matrix, and the user portion and the parity portion are concatenated to complete the codeword.