Memory Error Protection Encoding with Precomputed Parity Coefficients
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
As memory devices become denser, they are more prone to errors due to factors like storage charge loss, random telegraph signal effects, and cosmic rays, especially in multi-level architecture where signal levels are close, leading to increased error probability and decreased read/write margins.
Innovation Solution
The implementation of an error protection technique that computes parity data using pre-computed canonical coefficients, allowing for efficient error detection and correction without iterative calculations, thereby reducing computational resources and latency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If memory devices use multi-level architecture to increase storage capacity, then storage capacity is improved, but error probability increases and read/write margin decreases
Solution Approach 1:
The code is divided into a data portion and a separate parity portion, with the parity bits calculated independently using pre-computed canonical coefficients. This segmentation allows error detection and correction capabilities while maintaining the multi-level storage architecture.
Solution Approach 2:
Canonical coefficients are pre-computed and stored before actual encoding operations. This preliminary action eliminates the need for iterative calculations during encoding, reducing latency and computational complexity while maintaining error protection capabilities.
2Reliability
If traditional iterative methods are used to compute parity data, then error protection is achieved, but computational resources increase and latency increases
Solution Approach 1:
Canonical coefficients are pre-computed and stored in a lookup table before encoding operations. During actual encoding, parity bits are generated by directly applying these pre-computed coefficients to the data bits, eliminating iterative calculations and significantly reducing latency.
Solution Approach 2:
Instead of performing iterative calculations, the patent uses pre-computed canonical coefficients that represent the encoding transformation. These coefficients are copied and applied directly to generate parity bits, replacing complex iterative processes with simple matrix multiplication operations.
3Reliability
If iterative calculations are used to generate parity data, then error correction is achieved, but logic complexity increases
Solution Approach 1:
The complex iterative calculation logic is replaced by pre-computed canonical coefficients stored in a lookup table. The encoding logic only needs to perform simple matrix multiplication using these coefficients, dramatically reducing the logic complexity of the encoder while maintaining full error correction capability.
Data Source
AI summary
Subject matter disclosed herein relates to error protection of data stored in and/or read from a memory device.