Polar Code Rate Matching Using Lookup-Table Puncturing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional random puncturing methods in polar code rate matching reduce the performance of polar codes by randomly determining puncturing positions, leading to inefficient rate matching.
Innovation Solution
A method and apparatus for polar code rate matching that determines a puncturing sequence based on the information bit length, the quantity of encoded bits, and the number of bits to be punctured, using pre-defined tables or error probability calculations to select punctured bits systematically.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of manufacture
If conventional random puncturing is used for rate matching, then the implementation is simple, but the polar code performance deteriorates
Solution Approach 1:
The patent pre-calculates and stores optimal puncturing sequences in lookup tables before actual communication operations. These sequences are determined in advance based on code length, information bit length, and puncturing bit quantity, allowing the system to simply retrieve and apply pre-optimized sequences during rate matching without complex real-time calculations.
Solution Approach 2:
The patent changes the approach from random puncturing to systematic puncturing based on calculated parameters. By using code length, information bit length, and puncturing bit quantity as parameters to select from pre-defined sequences, the system achieves optimal performance while maintaining implementation simplicity through parameter-based sequence selection.
2Ease of operation
If random puncturing positions are selected, then the rate matching process is straightforward, but the transmission reliability decreases
Solution Approach 1:
Optimal puncturing sequences are pre-calculated and stored in lookup tables before actual use. The tables contain sequences indexed by code length, information bit length, and puncturing bit quantity, enabling straightforward retrieval and application during rate matching while ensuring transmission reliability through pre-optimized sequences.
Solution Approach 2:
The system transitions from random position selection to parameter-based sequence selection. By using code length, information bit length, and puncturing bit quantity as indexing parameters, the system achieves both ease of operation through simple table lookup and high reliability through systematically optimized puncturing patterns.
3Reliability
If systematic puncturing based on pre-defined sequences is used, then polar code performance is improved, but the device complexity increases
Solution Approach 1:
The patent pre-calculates and stores optimal puncturing sequences in lookup tables before actual communication operations. These sequences are determined in advance based on code length, information bit length, and puncturing bit quantity, allowing the system to simply retrieve and apply pre-optimized sequences during rate matching without complex real-time calculations.
Solution Approach 2:
The patent uses lookup tables that store pre-calculated puncturing sequences as copies of optimal solutions. Instead of performing complex calculations during actual rate matching, the system copies the appropriate pre-computed sequence from the table based on matching parameters, significantly reducing device complexity while maintaining high performance.
4Productivity
If lookup tables are used to store puncturing sequences, then the rate matching efficiency is improved, but the memory requirements increase
Solution Approach 1:
The patent pre-calculates and stores optimal puncturing sequences in lookup tables before actual communication operations. These sequences are determined in advance based on code length, information bit length, and puncturing bit quantity, allowing the system to simply retrieve and apply pre-optimized sequences during rate matching without complex real-time calculations.
Solution Approach 2:
The patent organizes puncturing sequences using parameter-based indexing (code length, information bit length, puncturing bit quantity). This parameterized storage approach optimizes memory usage by only storing sequences relevant to specific parameter combinations, reducing overall memory requirements while maintaining high rate matching efficiency through rapid parameter-based retrieval.
Data Source
AI summary
Embodiments of this application provide a polar code rate matching method and apparatus, and a communications apparatus. The rate matching method includes: determining N to-be-encoded bits, where the N to-be-encoded bits include N1 information bits, and both N1 and N are positive integers; encoding the N to-be-encoded bits to obtain N encoded bits; obtaining a first puncturing sequence based on an information bit length N1, the quantity N of the encoded bits, and a quantity Q of to-be-punctured bits; and performing a puncturing operation on the N encoded bits based on the first puncturing sequence to implement a rate matching. To-be-punctured bits indicated in the first puncturing sequence are obtained based on the information bit length N1, the quantity N of the encoded bits, and the quantity Q of the to-be-punctured bits, and are not generated randomly.