PUSCH Priority Multiplexing for URLLC HARQ-ACK and Data
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing wireless communication systems face challenges in efficiently multiplexing control information and data with different priorities, particularly in 5G systems supporting Ultra Reliable and Low Latency Communication (URLLC), where ensuring the transmission performance of high-priority control signaling and data is a key issue.
Innovation Solution
A method for wireless communication that involves receiving and transmitting signal groups with scheduling information, where the priority of different bit blocks is used to determine the number of bits in the first bit block, and resources are allocated based on priority to ensure reliable transmission of high-priority data by limiting low-priority control information.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If low-priority HARQ-ACK information and high-priority data are multiplexed onto the same PUSCH channel, then system efficiency is improved, but the transmission reliability of high-priority data deteriorates due to resource competition
Solution Approach 1:
The patent applies local quality by assigning different priority levels to different bit blocks within the same PUSCH transmission. Specifically, high-priority data and low-priority HARQ-ACK information are differentiated through priority indicators, allowing the system to treat different portions of the multiplexed signal differently during resource allocation and error handling, thus maintaining high system efficiency while protecting critical high-priority transmissions
Solution Approach 2:
The patent segments the multiplexed information into distinct bit blocks with different priority levels. The HARQ-ACK information and data are divided into separate codeblocks, each marked with priority indicators. This segmentation enables independent handling of each priority level during transmission, allowing the system to optimize resource allocation for each segment while maintaining overall multiplexing efficiency
2Reliability
If more resources are allocated to high-priority data to ensure its transmission reliability, then transmission reliability improves, but the quantity of low-priority control information that can be transmitted deteriorates
Solution Approach 1:
The patent changes the parameter of resource allocation by introducing priority-based dynamic allocation. Based on the priority indicators of different bit blocks, the system dynamically adjusts the number of resource elements, modulation and coding schemes, and error correction codes allocated to each priority level. This allows flexible resource distribution that can prioritize high-priority data when needed while still accommodating low-priority control information within the remaining resources
3Productivity
If low-priority HARQ-ACK information is compressed and mapped onto reserved resources, then resource allocation efficiency improves, but the complexity of the transmission process increases
Solution Approach 1:
The patent applies preliminary action by pre-allocating reserved resources specifically for low-priority control information before the actual transmission occurs. During the transmission process, the system simply maps the compressed low-priority HARQ-ACK information into these pre-designated resource elements, avoiding the need for complex real-time resource negotiation and allocation decisions during transmission, thus managing complexity while maintaining efficiency
Data Source
AI summary
A first receiver receives a first signal group and a first signaling; and a first transmitter transmits a second signal in a first time-frequency resource, the second signal carries a first bit block and a second bit block; wherein the first signaling comprises scheduling information of the second signal, a third bit block comprises indication information of whether signal(s) in the first signal group is(are) correctly received, the third bit block is used to generate the first bit block, and a number of bit(s) comprised in the first bit block (a size of the first bit block) is not greater than a number of bit(s) comprised in the third bit block; a priority of the third bit block and a priority of the second bit block are used together to determine a number of bit(s) comprised in the first bit block (a size of the first bit block).