Circular Buffer Bit Selection for Non-Repetitive HARQ Retransmission
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing rate matching methods in wireless communications systems, particularly in 5th generation mobile communications, result in poor Hybrid Automatic Repeat Request (HARQ) performance due to inefficiencies in bit sequence processing and decoding.
Innovation Solution
A method that determines the starting position of output bit sequences in a coded block, ensuring consecutive and non-repetitive sequences for transmissions, and adapts to various initial transmission code rates to minimize repeated bits and maintain stable decoding performance.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If existing rate matching method is used, then the coding rate can be adjusted, but HARQ performance deteriorates due to repeated bits and poor decoding performance
Solution Approach 1:
The patent pre-calculates and stores optimal starting positions for different transmission scenarios in a lookup table before actual communication occurs. This preliminary preparation allows the receiver to quickly determine which bits to combine without real-time computation, preventing information loss and improving HARQ performance by ensuring optimal bit selection from the outset
Solution Approach 2:
The patent dynamically adjusts the starting position parameter for bit sequence extraction based on transmission round and code rate. By changing this parameter according to specific conditions (initial transmission vs. retransmission, different code rates), the system optimizes which bits are selected for combining, thereby improving decoding performance and reducing information loss
2Adaptability or versatility
If bit sequence is selected for rate matching, then code rate can be adjusted, but repeated bits cause poor decoding performance
Solution Approach 1:
The patent implements dynamic starting position selection that adapts to different transmission scenarios. The starting position is not fixed but changes based on the transmission round indicator and code rate requirements. This dynamic adjustment ensures that the selected bit sequences are always optimal for the current conditions, preventing repeated bits and maintaining high decoding performance across various code rates
Solution Approach 2:
The patent divides the coded bit sequence into multiple segments with different starting positions. By segmenting the bit sequence and selecting appropriate segments based on transmission conditions, the system avoids selecting repeated bits while maintaining the required code rate. This segmentation approach allows flexible rate matching without compromising decoding performance
3Reliability
If soft values are combined for retransmission, then decoding reliability can be improved, but repeated bits increase decoding complexity and reduce performance
Solution Approach 1:
The patent pre-determines and stores the optimal starting positions for different transmission scenarios in a lookup table before actual communication occurs. This preliminary preparation allows the receiver to quickly identify which soft values to combine without real-time computation, reducing decoding complexity while maintaining high reliability by ensuring optimal bit selection
Solution Approach 2:
The patent uses a lookup table that stores pre-calculated starting position information. Instead of performing complex real-time calculations to determine optimal bit sequences, the system copies the appropriate starting position from the pre-prepared lookup table based on current transmission conditions. This copying approach simplifies the decoding process while maintaining optimal performance
Data Source
AI summary
This application discloses a method and an apparatus for processing information, a communications device, and a communications system. The communications device is configured to obtain a starting position of an output bit sequence in a coded block in a circular buffer, and determine the output bit sequence in the coded block based on a length of the output bit sequence and the starting position. A value of the starting position is one of {p0, p1, p2 . . . , pk<sub2>max</sub2>−1}, where 0≤pk<NCB, Pk is an integer, k is an integer, 0≤k<kmax, NCB is a size of the coded block, and kmax is an integer greater than or equal to 4.