Resource Block Allocation for Non-Contiguous Sequences
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing resource block allocation formats in wireless communications, particularly in 5G networks, are inadequate for non-contiguous sequences, leading to inefficient use of bits and increased overhead, as they require contiguous sequences and additional bits to account for variations in starting locations and lengths.
Innovation Solution
The method involves determining the ranges of variables representing non-contiguous resource block sequences, using equations to calculate the Resource Indication Value (RIV) and the number of bits required, allowing for efficient allocation of non-contiguous sequences of resource blocks by the base station, thereby reducing the total number of bits needed for transmission.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If existing DCI formats are used to allocate resource blocks, then contiguous sequences of resource blocks can be allocated efficiently, but non-contiguous sequences require extra overhead bits causing bit waste
Solution Approach 1:
The patent segments the resource block allocation into two independent components: a common starting resource block location (applied to all sequences) and individual lengths for each sequence. This segmentation allows non-contiguous sequences to be represented efficiently without requiring separate encoding for each starting position, thereby reducing bit overhead while enabling versatile allocation patterns.
Solution Approach 2:
The patent changes the parameter representation from traditional (starting location, length) pairs for each sequence to a unified model with one common starting location parameter and multiple length parameters. This parameter transformation enables the system to represent non-contiguous sequences more compactly, achieving both adaptability for various sequence patterns and reduction in overhead bits.
2Adaptability or versatility
If traditional RIV encoding is used, then the number of bits is determined by the range of contiguous sequences, but it cannot efficiently represent non-contiguous sequences
Solution Approach 1:
The patent introduces a new dimensional approach by separating the starting location dimension (common to all sequences) from the length dimension (specific to each sequence). This dimensional reorganization allows the encoding to capture non-contiguous patterns without expanding the total bit requirement, as the common starting position is encoded once rather than repeated for each sequence.
Solution Approach 2:
The patent creates a universal encoding framework where a single common starting resource block location parameter serves multiple sequences simultaneously. This multi-functional parameter reduces the total number of bits needed compared to traditional methods that would require separate starting position specifications for each sequence, while still supporting diverse non-contiguous allocation patterns.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
A system and method for allocating network resources are disclosed herein. In one embodiment, the system and method are configured to perform: determining a resource indication value based on at least a first parameter and a second parameter, the resource indication value indicative of a number of resource blocks to be allocated to a communication node, wherein a number of possible different values of the resource indication value is limited by a predefined relationship between the first parameter and the second parameter; and transmitting the resource indication value to the communication node.