Circular Buffer Rate Matching for Unequal Code Block Sizes
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional rate matching techniques in wireless communication systems are complex and inefficient, especially when dealing with multiple code blocks of varying sizes, as they often require complicated stages of puncturing or repetition, which can lead to suboptimal performance under high or low code rate conditions.
Innovation Solution
The implementation of a circular buffer-based rate matching method, where each code block is associated with a circular buffer of varying size, allowing for proportional transmission of bits based on the buffer's size, with the number of bits constrained by an aggregate budget and modulation order, enabling efficient transmission even under high code rate conditions by prioritizing systematic bits.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If conventional rate matching techniques are used with multiple code blocks of varying sizes, then the system can handle diverse data transmission needs, but the complexity of the rate matching process increases significantly
Solution Approach 1:
The patent divides the rate matching process into separate handling for each code block. Each code block is processed independently with its own rate matching operations, allowing the system to handle varying sizes without increasing overall complexity. The circular buffer is segmented into multiple buffers corresponding to each code block, enabling independent management of each segment.
Solution Approach 2:
The patent applies different rate matching parameters and operations to different code blocks based on their specific characteristics. Each code block can have its own circular buffer size, rate matching pattern, and transmission priorities, allowing localized optimization without affecting other code blocks.
2Productivity
If conventional puncturing or repetition stages are used for rate matching, then the number of coded bits can be adjusted to match channel capacity, but the performance deteriorates under high or low code rate conditions
Solution Approach 1:
The patent implements dynamic rate matching where the circular buffer size and rate matching parameters are adaptively adjusted based on the code rate conditions. Under high code rates, the system dynamically selects which bits to puncture from the circular buffer, and under low code rates, it dynamically determines repetition patterns, optimizing performance for each condition rather than using fixed conventional stages.
3Loss of information
If all coded bits are transmitted, then complete data transmission is achieved, but the transmission capacity is exceeded when coded bits outnumber available channel bits
Solution Approach 1:
The patent performs preliminary organization of coded bits into a circular buffer structure before transmission. This preliminary arrangement allows the system to efficiently select and puncture specific bits for transmission based on channel capacity, ensuring that the most important information is transmitted first while maintaining data integrity within the constraints of available channel resources.
Data Source
AI summary
Bits included in each code block of a transport block can be stored to an associated circular buffer and transmitted over a channel. Each circular buffer can vary in size in proportion to a size of the associated code block. Therefore, since in certain operating environments code blocks for a transport block can vary in size, circular buffers can vary in size as well. Accordingly, when not all data from a transport block and/or an array of circular buffers can be transmitted over the channel, each circular buffer from the array can transmit a portion of bits that is proportional to a size of the respective circular buffer (or the associated code block or encoded code block). Furthermore, the number of bits transmitted from each circular buffer can be constrained by an aggregate budget for all circular buffers and can be further constrained to be an integer multiple of a modulation order for the transport block.