Polar Code Rate Matching With Circular Buffer Partitioning
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Polar code hardware exhibits high complexity due to the need for different hardware modules to handle various code lengths, leading to a complicated encoding process, especially in hybrid automatic repeat request mechanisms.
Innovation Solution
A rate matching method and device for Polar codes that involves concatenating information and frozen bits, using a circular buffer divided into parts, and applying a predefined rule for selecting and writing bits based on a one-to-one mapping interleaving function to simplify the encoding process across different code lengths.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If different hardware modules are used for different code lengths, then rate matching for any code length can be achieved, but device complexity increases
Solution Approach 1:
The patent applies a single universal hardware module (circular buffer) to perform rate matching for all code lengths, replacing the need for multiple specialized hardware modules. The circular buffer can accommodate different code lengths by adjusting the read/write pointer positions and buffer allocation, achieving multi-functionality with a single component.
Solution Approach 2:
The patent changes the operational parameters of the circular buffer (such as buffer size, read pointer position, write pointer position, and number of parts q) to adapt to different code lengths and rate matching requirements. This allows a fixed hardware structure to dynamically handle variable code lengths through parameter adjustment rather than structural changes.
2Device complexity
If a circular buffer with q parts is used, then hardware complexity is reduced, but the encoding process requires predefined rules and mappings
Solution Approach 1:
The patent pre-divides the circular buffer into q parts and establishes predefined mapping rules before the actual rate matching operation. This preliminary configuration simplifies the runtime operation, as the encoder only needs to follow the pre-established rules rather than making complex decisions during encoding.
Solution Approach 2:
The circular buffer is segmented into q distinct parts, each handling specific portions of the coded bits. This segmentation allows for systematic and rule-based bit placement and retrieval, making the encoding process more structured and easier to implement with predefined rules for each segment.
3Adaptability or versatility
If bits are written into q parts of circular buffer according to predefined rule, then rate matching for various code lengths is achieved, but loss of time occurs due to mapping operations
Solution Approach 1:
The patent uses a circular buffer structure that copies and reuses the same hardware resources for different code lengths. Instead of creating new hardware structures for each code length, the system copies the bit sequence into the buffer and retrieves it according to predefined rules, significantly reducing the time overhead compared to creating dedicated hardware for each code length.
Data Source
AI summary
Provided is a rate matching method and device for a Polar code. The method includes: concatenating K information bits and (N−K) frozen bits to generate a bit sequence of N bits, and encoding the bit sequence of N bits by means of a Polar code encoder with a generator matrix of size N×N to generate an initial bit sequence {S0, S1, . . . , SN−1} of bits, where K and N are both positive integers and K is less than or equal to N; dividing a circular buffer into q parts, selecting bits from the initial bit sequence {S0, S1, . . . , SN−1} in a non-repeated manner, and writing the bits into the q parts of the circular buffer according to a predefined rule, where q=1, 2, 3 or 4; and sequentially selecting a bit sequence of a specified length from a predefined starting position in a bit sequence in the circular buffer and taking the bit sequence of the specified length as a bit sequence to be transmitted.