Adaptive DCI Bit Allocation for Multi-TB Scheduling
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Wireless communication systems face inefficiencies in transmitting and receiving signals due to the high number of bits required for redundancy version (RV) and frequency hopping (FH) information in downlink control information (DCI), especially in multi-transport block scheduling scenarios, leading to increased network overhead.
Innovation Solution
The method adaptively determines the number of bits used for RV and FH information in DCI based on the number of scheduled transport blocks, reducing the total number of bits in DCI and optimizing bit allocation to minimize network overhead.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If a fixed number of bits is allocated for RV and FH information in DCI, then the DCI structure is simple and easy to implement, but the network overhead increases when multiple transport blocks are scheduled
Solution Approach 1:
The patent applies dynamics by making the number of bits for RV and FH information adaptive rather than fixed. The base station dynamically determines the number of bits based on the actual number of transport blocks scheduled, allowing the DCI to use fewer bits when scheduling multiple TBs, thus reducing network overhead while maintaining implementation simplicity
Solution Approach 2:
The patent changes the parameter of bit allocation for RV and FH information from a static value to a variable value that depends on the number of scheduled transport blocks. This parameter change enables the system to optimize the balance between DCI structure simplicity and network overhead reduction based on actual scheduling conditions
2Quantity of substance
If the number of bits for RV and FH information is reduced, then network overhead decreases, but the information transmission capacity is limited
Solution Approach 1:
The patent applies local quality by differentiating the bit allocation for RV and FH information based on the specific scheduling scenario. When multiple transport blocks are scheduled, fewer bits are allocated for RV and FH information, while other DCI fields are adjusted accordingly. This localized optimization reduces overall network overhead without compromising the necessary information transmission capacity for the given scenario
Solution Approach 2:
The system dynamically adjusts the number of bits for RV and FH information based on the actual number of transport blocks scheduled. This dynamic adaptation ensures that the bit allocation is optimized for each specific case, reducing network overhead when multiple TBs are scheduled while maintaining sufficient information capacity when fewer TBs are scheduled
3Quantity of substance
If adaptive bit allocation is implemented for RV and FH information, then network overhead is reduced in multi-TB scheduling, but the device complexity increases
Solution Approach 1:
The patent applies dynamics by implementing adaptive bit allocation where the number of bits for RV and FH information is determined based on the number of scheduled transport blocks. The base station dynamically selects the appropriate bit allocation scheme (e.g., using 2 bits for RV and 1 bit for FH when scheduling multiple TBs) to reduce network overhead while managing implementation complexity
Solution Approach 2:
The patent changes the bit allocation parameters for RV and FH information adaptively based on scheduling conditions. By establishing predefined rules for bit allocation under different TB scheduling scenarios, the system achieves network overhead reduction while keeping the complexity increase manageable through structured parameter adjustment
Data Source
Figure 1
Figure 2
Figure 3~4
AI summary
The present invention relates to a method for transmitting and receiving, by a terminal, a signal in a wireless communication system supporting multiple transport block (TB) scheduling. The method may comprise the steps of: receiving, from a base station, one piece of downlink control information (DCI) scheduling two TBs; acquiring 2-bit redundancy version (RV) information from the DCI on the basis of the number of repetitive transmissions, set in the two TBs, being 1; and acquiring 1-bit RV information and 1-bit frequency hopping information from the DCI on the basis of the number of repetitive transmissions being greater than 1.