Polar Code Parity Bit Allocation for Faster Reliable Decoding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The increasing number of user equipment (UEs) and data transmission demands in wireless communication systems require efficient methods to utilize limited radio resources for uplink/downlink data and control information transmission, while also reducing latency and hardware complexity, especially with the adoption of Polar codes which have larger sizes than traditional codes.
Innovation Solution
A method involving mapping input information to Polar codes, where n1 parity check bits are placed in the least reliable bit positions and n−n1 parity check bits are mapped to bit positions with minimum row weight, except for the least reliable positions, to optimize data transmission and decoding efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If Polar codes are used for channel coding to improve coding performance, then reliability is improved, but device complexity increases due to larger code sizes
Solution Approach 1:
The patent segments the parity check bits into two groups: n1 parity check bits mapped to least reliable bit positions and n-n1 parity check bits mapped to positions with minimum row weight. This segmentation allows selective placement of different types of parity bits in optimally positioned locations within the Polar code structure, improving overall coding performance while maintaining manageable complexity through structured organization
Solution Approach 2:
The patent applies local quality by assigning different parity check bits to different positions based on their specific characteristics. The n1 parity check bits are placed in least reliable positions where they provide maximum error protection, while n-n1 parity check bits are placed in positions with minimum row weight to optimize local code properties. This localized optimization improves overall reliability without requiring uniform complexity increases across the entire code structure
2Productivity
If the number of user equipments and data transmission demands increases, then productivity is improved, but loss of time increases due to limited radio resources
Solution Approach 1:
The patent changes the parameter of bit position allocation by mapping parity check bits to specific positions based on reliability and row weight characteristics rather than using conventional uniform allocation. This parameter optimization improves transmission efficiency by ensuring that critical parity information is placed in positions that maximize error correction capability, thereby reducing retransmissions and associated latency while supporting increased data transmission demands
3Reliability
If more parity check bits are added to improve error correction, then reliability is improved, but device complexity increases due to larger code size
Solution Approach 1:
The patent performs preliminary action by pre-determining the optimal positions for parity check bits based on reliability analysis and row weight calculations before encoding. The positions for n1 and n-n1 parity check bits are predetermined based on the Polar code structure, allowing the system to achieve improved error correction capability without dynamically calculating positions during operation, thus limiting complexity growth despite increased code size
Data Source
AI summary
A transmission method or a transmission apparatus maps input information of K+n bits to a polar code, encodes the input information on the basis of the polar code, and transmits the encoded input information. The input information includes n parity check bits. n1 bits of the n parity check bits are mapped to least reliable bit positions of K+n bit positions of the polar code, and n−n1 parity check bits (where n−n1>0) are mapped to n−n1 bit positions having a minimum row weight among K+n−n1 bit positions excluding the n1 least reliable bit positions among the K+n bit positions.