SSD Polar Decoding With Dynamic List Size for Long Codes
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional SSD devices based on polar encoding and decoding face excessive hardware and software complexity due to the high list size requirements for successive cancellation list decoding, making them impractical for long codes.
Innovation Solution
An improved method for operating SSD devices that dynamically adjusts the maximum list size during successive cancellation list decoding based on the reliability of unfrozen bits and metric range, allowing for iterative duplication, pruning, and updating of candidate decoding paths to optimize decoding performance without increasing hardware and software complexity.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a fixed large list size is used in successive cancellation list decoding to improve decoding performance, then error correction capability is improved, but hardware and software complexity increases excessively
Solution Approach 1:
The patent applies dynamics by transforming the fixed list size into a dynamic parameter that adapts during decoding. The list size is adjusted based on the decoding progress and channel conditions, allowing the system to use larger lists when needed for better performance and smaller lists when sufficient performance is achieved, thereby reducing overall complexity while maintaining reliability.
Solution Approach 2:
The patent changes the parameter of list size from a static fixed value to a variable that can be modified during the decoding process. By dynamically adjusting the list size parameter based on decoding metrics and performance requirements, the system optimizes the balance between decoding performance and computational complexity.
2Measurement precision
If the list size is increased to explore more candidate decoding paths, then decoding accuracy improves, but the number of operations and memory requirements increase
Solution Approach 1:
The patent applies partial action by using a variable list size that is adjusted to provide just enough candidate paths for accurate decoding without unnecessarily exploring all possible paths. The list size is increased only when needed based on decoding performance metrics, avoiding excessive operations and memory usage while maintaining sufficient decoding accuracy.
3Reliability
If successive cancellation list decoding is implemented with large list sizes, then error correction performance improves, but practical implementation for long codes becomes infeasible
Solution Approach 1:
The patent makes the list size dynamic to enable practical implementation of long codes. By adjusting the list size during decoding based on the specific code length and channel conditions, the system achieves good error correction performance for long codes without the prohibitive complexity that would result from using a uniformly large fixed list size.
Data Source
AI summary
A method is proposed for operating a solid state storage device. The method comprises: encoding information and frozen bits into polar encoded bits; storing the polar encoded bits; reading the polar encoded bits, wherein the read polar encoded bits include the frozen bits and unfrozen bits, and performing a SCL decoding. The SCL decoding comprises: providing a list of candidate decoding paths; duplicating the candidate decoding paths; determining a maximum list size indicative of an allowed maximum number of candidate decoding paths that can be contained in the list of candidate decoding paths; pruning at least one duplicated candidate decoding path according to the maximum list size, and including in the list of candidate decoding paths a number of non-pruned duplicated candidate decoding paths not higher than the maximum list size; and selecting a decoding path from the list of candidate decoding paths.