Polar Decoder Staged Termination for Partial Codeword Decoding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional memory sub-systems face inefficiencies in decoding processes due to sequential decoding of entire codewords before error handling, leading to increased execution time and resource usage on unnecessary data, especially when only a portion of the data is requested.
Innovation Solution
Implementing a polar decoder that performs decoding in stages, validating each decoded host data sector using its check code and terminating the process if errors are detected or if sufficient data is decoded to satisfy a request, thereby reducing unnecessary computation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If sequential decoding of entire codeword is performed, then complete data is decoded, but execution time and computational resource usage increase
Solution Approach 1:
The decoding process is segmented into stages, where each stage processes a portion of the codeword and validates results using check codes. The polar decoder divides the codeword into multiple segments, decoding and validating each segment independently before proceeding to the next, enabling early termination when errors are detected or sufficient data is obtained.
Solution Approach 2:
Check codes are computed and validated during the decoding process itself, rather than after complete decoding. This preliminary validation action allows the system to detect errors early and terminate decoding before processing the entire codeword, saving computational resources and time.
2Reliability
If entire codeword is decoded sequentially, then all data is processed, but computational resource usage increases on unnecessary data
Solution Approach 1:
The system performs partial decoding by processing only the necessary portion of the codeword required to satisfy the data request. Once sufficient valid data is obtained or an error is detected, decoding terminates early, avoiding unnecessary computation on remaining data segments.
Solution Approach 2:
The decoding process incorporates continuous feedback through check code validation at each stage. The validation results feed back into the decoding control logic, which decides whether to continue or terminate decoding based on error detection and data sufficiency, optimizing computational resource usage.
3Quantity of substance
If decoding continues until complete codeword is processed, then maximum data is retrieved, but latency increases
Solution Approach 1:
The codeword is segmented into multiple decodable units with associated check codes. The system retrieves data in segments, validating each before proceeding, which reduces latency by enabling early termination while still obtaining sufficient data to satisfy requests.
Solution Approach 2:
Validation of decoded data segments is performed preliminarily during the decoding process itself. This allows the system to identify sufficient valid data early and terminate decoding, reducing latency while maintaining data retrieval effectiveness.
Data Source
AI summary
A decoder can receive an indication that a portion of a codeword has been decoded during a decoding operation. The decoder can determine a group of candidate output values of the decoding operation for the portion of the codeword, and eliminate one or more candidate output values from the group of candidate output values based on a decoded check code for each of the group of candidate output values. In response to determining that all of the candidate output values have been eliminated from the group of candidate output values, the decoder can terminate the decoding operation.