Polar Code Rate Matching Using a Universal Circular Buffer
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 interleaving function to select and arrange bits for transmission, thereby simplifying the encoding process across different scenarios.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If different hardware modules are used for different code lengths, then rate matching can be achieved for any code length, but hardware complexity increases
Solution Approach 1:
The patent implements a universal rate matching mechanism using a circular buffer that can handle multiple code lengths (N=128, 256, 512, 1024) through a single hardware structure. The circular buffer is configured with different parameters (buffer size, starting position, length) depending on the code length, eliminating the need for separate hardware modules for each code length while maintaining full adaptability.
2Adaptability or versatility
If multiple hardware modules are implemented for various code lengths, then complete rate matching coverage is achieved, but the encoding process becomes complicated
Solution Approach 1:
The patent employs dynamic configuration of the circular buffer parameters based on the code length being processed. The buffer size, starting position, and output length are dynamically adjusted according to the specific code length (N=128, 256, 512, 1024), allowing a single static hardware module to perform multiple rate matching operations without requiring multiple specialized modules, thus simplifying the encoding process while maintaining complete code length coverage.
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 N 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.