A cyclic redundancy check aided encoding construction method for list sphere polar decoder.

Area of Science:

• Information Theory
• Coding Theory
• Telecommunications Engineering

Background:

• Polar codes are vital for 5G control channels, approaching the Shannon limit.
• Sphere Decoding (SD) offers high performance but suffers from computational complexity and latency.
• List Sphere Decoding (LSD) provides a balance between performance and complexity.

Purpose of the Study:

• To propose an improved Polar code decoding construction method for 5G control channels.
• To mitigate error propagation and reduce computational complexity compared to existing algorithms.
• To enhance the practical applicability of Polar codes in communication systems.

Main Methods:

• A novel construction method delaying the decoding of minimum row weight information bits.
• A segmented construction strategy to increase delay-decodable bits in limited scenarios.
• Mathematical analysis to validate the effectiveness of the proposed strategies.

Main Results:

• The proposed method significantly reduces error propagation without altering the number of transmitted bits.
• Decoding performance is comparable to SD at medium/low code rates (within 0.2 dB difference).
• The algorithm avoids the search radius concept and backtracking inherent in SD.
• Excellent performance is maintained under high code rate conditions (e.g., P(32, 20)).

Conclusions:

• The proposed Polar code decoding method offers a practical alternative to SD for 5G control channels.
• It achieves a favorable trade-off between decoding performance and computational complexity.
• The strategy effectively combats error propagation, enhancing reliability in communication systems.