Page-Based Iterative Decoding for Idle-Free Memory Throughput
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing memory systems face inefficiencies in information transmission due to the use of high error correction/error detection codes, which increase the bit length of redundant bits, leading to declined transmission efficiency and potential idle times during decoding processes.
Innovation Solution
Implementing a page-based iterative decoding method where each sector of data is decoded continuously, with the decoding time of a next sector adjusted based on the remaining time of the previous sector, ensuring no idle state and maintaining constant iterative decoding time across sectors.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If high error correction/error detection codes are used to improve reliability, then bit error rates are reduced, but the bit length of redundant bits increases leading to declined transmission efficiency
Solution Approach 1:
The patent divides the decoding process into multiple parallel channels, each handling a portion of the codeword. By segmenting the decoding workload across multiple channels that operate simultaneously, the system maintains high error correction capability while improving overall processing throughput and transmission efficiency.
2Reliability
If traditional decoding methods are used with fixed decoding time allocation, then decoding completeness is ensured, but idle times occur between sector decodings reducing productivity
Solution Approach 1:
The patent implements dynamic decoding time allocation where the decoding time for each sector is adjusted based on the actual decoding speed and complexity of previous sectors. This dynamic approach eliminates idle waiting times between sectors while ensuring each sector receives adequate decoding resources, thereby improving overall decoding throughput without sacrificing completeness.
Solution Approach 2:
The system uses feedback from the decoding process of one sector to adjust the decoding time allocation for the next sector. By monitoring actual decoding performance and feeding this information back into the time allocation mechanism, the system optimizes the balance between decoding completeness and eliminating idle times, thus improving productivity.
3Reliability
If decoding time is extended to ensure complete error correction, then bit error rates are reduced, but the total decoding time increases affecting transmission speed
Solution Approach 1:
The patent implements continuous parallel decoding across multiple channels, where decoding operations continue without interruption or idle periods. By maintaining continuous useful action across all channels simultaneously, the system achieves thorough error correction without extending the overall decoding time, thus preserving transmission speed while improving reliability.
Data Source
AI summary
A method of iteratively decoding data transferred through a channel is provided. The method may include iteratively decoding each sector of 1 to N sectors of the data in continuous succession until all N sectors are decoded, wherein upon determination of successful completion of iterative decoding corresponding to a current sector of the N sectors, immediately initiating iterative decoding a next sector of the N sectors.