Channel Tree Node Mapping for OFDMA Resource Scheduling
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional channel tree implementations in communication systems, such as OFDMA, are inefficient due to the use of linked lists, which require scanning for most operations, limiting computation speed and performance in scheduling channel resources.
Innovation Solution
Mapping real node identifiers of a channel tree to virtual node identifiers based on a prescribed ordering scheme, allowing for the representation of node relationships as a bitmap, which facilitates faster bitwise operations and improves processing speed for channel tree operations.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Speed
If channel trees are implemented using linked lists, then the structure can represent hierarchical channel relationships, but the computation speed is limited due to scanning requirements
Solution Approach 1:
The patent transforms the channel tree structure by reordering nodes according to a specific scheme (grouping by hop-port count and applying level-order traversal), which changes the structural parameters from a conventional linked list to an optimized hierarchical arrangement. This reordering enables faster bitwise operations while maintaining the hierarchical relationship representation
Solution Approach 2:
The patent replaces the mechanical scanning process inherent in linked list implementations with bitwise operations on reordered node identifiers. This substitution eliminates the need for sequential scanning through the structure, dramatically improving computation speed for operations like allocation, release, and searching
2Productivity
If conventional linked list structure is used for channel tree, then implementation is straightforward, but operations require scanning which limits efficiency
Solution Approach 1:
The patent performs preliminary reordering of channel tree nodes according to a prescribed scheme before operations are executed. This preliminary action groups nodes by their hop-port count and arranges them in level-order traversal sequence, so that subsequent operations can efficiently process multiple nodes simultaneously using bitwise operations rather than sequential scanning
Solution Approach 2:
The patent changes the ordering parameter of node identifiers from conventional linked list sequence to a reordered scheme based on hop-port groups and level-order traversal. This parameter change enables the use of bitwise operations for channel tree operations, significantly improving productivity while reducing processing time
Data Source
Figure 1~2
Figure 3
Figure 4
AI summary
Methods and apparatus for performing channel tree operations in a communication system are disclosed that order a channel tree to effect improved computation speed for channel tree operations for scheduling channel resources in the communication system. The disclosed methods include mapping each of one or more node identifiers of real nodes of a channel tree to corresponding virtual node identifiers based on a prescribed ordering scheme. After mapping, the methods include performing one or more operations on one or more of the real nodes of the channel tree using the virtual node identifiers. Corresponding apparatus configured to execute the disclosed methods are also disclosed.