Variable-Rate LDPC Decoder Memory Allocation by Circulant Size
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing data storage solutions using Low Density Parity Check (LDPC) codes face challenges in efficiently managing different code rates, leading to either inadequate error correction or wasteful storage space, as they require varying levels of redundancy and memory allocation.
Innovation Solution
A system and method for performing parity check operations in a variable rate decoder that dynamically adjusts memory allocation based on selected code rates by determining circulant sizes and updating confidence values and log-likelihood ratios across multiple memory units, allowing for efficient storage and processing of codewords across different code rates.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If more redundancy (lower code rate) is added to improve error correction performance, then error correcting performance is improved, but storage space is wasted
Solution Approach 1:
The patent implements dynamic memory allocation where the decoder adapts memory resources based on the detected code rate. Different code rates (e.g., 1/2, 2/3, 3/4) require different amounts of memory for confidence values and log-likelihood ratios. The system dynamically configures memory units to match the actual redundancy level, preventing both over-allocation and under-allocation of storage resources.
2Reliability
If different LDPC encoder/decoder designs are implemented for different code rates, then error correction performance is optimized for each code rate, but device complexity increases
Solution Approach 1:
The patent creates a universal decoder architecture that can handle multiple code rates using the same core decoding logic and memory structure. By parameterizing the memory allocation based on code rate rather than implementing separate decoders for each code rate, the system achieves multi-functionality with a single design, reducing overall device complexity while maintaining optimized performance for each code rate.
Solution Approach 2:
The patent changes the parameter of memory allocation based on the code rate parameter. Instead of changing the fundamental decoder architecture for each code rate, the system adjusts memory configuration parameters (number of memory units, size of confidence value storage) to match the required code rate, achieving optimization through parameter adjustment rather than structural redesign.
3Ease of manufacture
If fixed memory allocation is used for LDPC decoding, then memory management is simplified, but memory efficiency decreases when supporting multiple code rates
Solution Approach 1:
The patent implements dynamic memory allocation where the decoder adapts memory resources based on the detected code rate. Different code rates (e.g., 1/2, 2/3, 3/4) require different amounts of memory for confidence values and log-likelihood ratios. The system dynamically configures memory units to match the actual redundancy level, preventing both over-allocation and under-allocation of storage resources.
Data Source
AI summary
The subject technology provides a decoding solution that supports multiple choices of code rates. A decoder may be configured to receive a selected code rate from a plurality of code rates. On the selection of the code rate, the decoder may determine a circulant size based on the code rate, and, on receiving the codeword, update, during one or more parity-check operations, a number of confidence values proportional to the circulant size in each of a plurality of memory units, each number of confidence values corresponding to a portion of the codeword.