Polar List Decoding with Early Termination Error Checks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Traditional polar coding techniques in wireless communication systems face challenges in meeting low latency standards due to their complex nature and introduction of latency, which is not suitable for high-performance communications.
Innovation Solution
The implementation of early termination of successive cancellation list decoding by interspersing error check vectors within codewords, allowing decoders to terminate the list decoding operation if no candidate paths satisfy the error check process, thereby reducing latency and false alarm rates.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If successive cancellation list decoding is performed to improve decoding accuracy, then reliability is improved, but latency increases and computational complexity increases
Solution Approach 1:
Error check vectors are inserted at predetermined positions within the codeword before transmission. During decoding, these pre-placed error check vectors enable intermediate verification of candidate paths, allowing the decoder to terminate early when no valid paths remain, thus reducing latency while maintaining decoding accuracy through preliminary error detection capabilities
Solution Approach 2:
The error check vectors provide feedback mechanisms during the decoding process. By checking candidate paths against error check vectors at intermediate positions, the decoder receives feedback on path validity and can terminate the decoding process early when all candidate paths fail the error check, reducing latency while preserving reliability
2Reliability
If successive cancellation list decoding is performed to improve decoding accuracy, then reliability is improved, but device complexity increases
Solution Approach 1:
Error check vectors are pre-inserted at specific positions within the codeword structure. During decoding, these pre-positioned vectors enable intermediate validation of candidate paths, allowing the decoder to terminate early when no valid paths exist, thereby reducing computational complexity while maintaining decoding accuracy through advance error detection setup
Solution Approach 2:
The error checking function is extracted and integrated into the codeword structure through dedicated error check vectors. This separation allows the main decoding process to efficiently terminate when error checks fail, reducing the computational burden on the decoder while maintaining reliability through dedicated error detection components
3Loss of time
If error check vectors are inserted within codeword to enable early termination, then latency is reduced, but codeword length increases
Solution Approach 1:
Error check vectors are inserted at selective intermediate positions within the codeword rather than requiring complete decoding. This partial checking approach enables early termination when errors are detected, reducing average decoding latency while the overhead of error check vectors is justified by the computational savings from avoided full decoding operations
Data Source
AI summary
Techniques are described herein to terminate a list decoding operation before its completion based on performing one or more error check processes. A transmitted codeword encoded using a polar code may include one or more error check vectors interspersed with one or more information vectors. Upon receiving the codeword, a decoder may perform a list decoding operation on the received codeword. Upon decoding one of the error check vectors, the decoder may determine whether at least one candidate path used in the successive cancellation list decoding operation passes an error check process based on the error check vector. If no candidate paths satisfy the error check process, the decoder may terminate the list decoding operation. In some examples, the decoder may recheck whether candidate paths satisfy the error check operation at intermediate positions between error check vectors. Such rechecking may occur while decoding information vectors.