Polar Code Bit Mapping for Low-Storage Rate Adaptation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing polar code systems face significant storage overheads due to the need for large lookup tables to support all code length and code rate combinations, making efficient encoding and decoding impractical for hardware implementation.
Innovation Solution
A method is introduced to reduce storage overhead by using mapping relationship information to determine sequence number sets for polar code encoding and decoding, allowing for efficient selection of information and transmission bits based on preset rules, thereby reducing the number of entries required for storage.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If all code length and code rate combinations are supported using traditional lookup tables, then complete codebook coverage is achieved, but storage overhead becomes intolerable for hardware implementation
Solution Approach 1:
The patent segments the codebook into multiple codebooks, each corresponding to a specific code length. For each codebook, only the necessary information bit sequence number sets for different code rates are stored, rather than storing all possible combinations. This segmentation allows the system to support various code lengths and rates while significantly reducing the total storage requirements compared to a single comprehensive lookup table.
Solution Approach 2:
The patent introduces dynamic selection mechanisms where the encoder and decoder can adaptively choose appropriate codebooks and information bit sequence number sets based on the desired code length and code rate. This dynamic approach enables flexible support for all code length and rate combinations without requiring static storage of every possible configuration, thereby reducing storage overhead while maintaining versatility.
2Reliability
If pre-constructed codebooks with density approximation are used for all parameter combinations, then encoding/decoding performance is optimized, but the complexity of managing multiple codebooks increases
Solution Approach 1:
By dividing the comprehensive codebook into multiple smaller codebooks organized by code length, the patent reduces the complexity of managing any single codebook. Each codebook contains pre-constructed information bit sequence number sets optimized for its specific code length, making selection and management more straightforward while maintaining encoding/decoding performance through density approximation.
Solution Approach 2:
The patent performs preliminary construction of information bit sequence number sets for each codebook during offline preparation, storing only the essential pre-computed data. This preliminary action eliminates the need for complex real-time calculations during encoding/decoding operations, simplifying the runtime complexity while preserving optimized performance characteristics.
3Adaptability or versatility
If huge lookup tables are stored to support all code length and code rate combinations, then complete rate adaptation is enabled, but hardware implementation becomes impractical
Solution Approach 1:
The patent segments the rate adaptation functionality across multiple codebooks, each handling a specific code length. This segmentation allows hardware implementation to focus on managing smaller, more manageable codebook structures while still providing complete rate adaptation capability across all code lengths and rates through selective codebook usage.
Solution Approach 2:
The patent creates a universal framework where a set of modular codebooks can serve multiple code length and rate requirements. Each codebook is designed to be multi-functional, supporting various code rates within its code length, thereby enabling complete rate adaptation capability without requiring separate dedicated structures for each code length-rate combination, making hardware implementation practical.
Data Source
AI summary
Embodiments of the present invention disclose a polar code processing method and communications device. The method includes: obtaining, based on a target coded bit quantity M and preset first mapping relationship information, a first sequence number set of M uncoded bits that is corresponding to the target coded bit quantity M, the first mapping relationship information is used to indicate a one-to-one correspondence between a plurality of coded bit quantities and a plurality of uncoded bit sequence number sets, the M uncoded bits include K information bits, and M target coded bits are obtained after polar encoding is performed on the M uncoded bits; and selecting, from the first sequence number set of the M uncoded bits according to a preset first selection rule, K sequence numbers as a sequence number set of the K information bits.