OFDMA Scheduler Bipartite Graph Parallel Allocation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current OFDMA systems face complexity and inefficiency in sub-channel assignment and management, particularly in handling multiple users and dynamic changes, due to sequential algorithms that are time-consuming and difficult to implement.
Innovation Solution
The implementation of a parallel processing unit (PPU) architecture that allows each user to connect to all available sub-channels, with a scheduling device that uses Channel Quality Indicators (CQIs) to optimize sub-channel allocation through a bipartite graph matching method, enabling efficient admission control, addition, deletion, and modification of sub-channel assignments.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If a sequential algorithm is used for sub-channel assignment, then the system can maintain simple implementation, but the complexity and time required for allocation increases significantly
Solution Approach 1:
The patent divides the sub-channel assignment problem into independent sub-problems by creating separate processing units for different users. Each processing unit independently evaluates and assigns sub-channels to its associated user, transforming the single sequential algorithm into multiple parallel processing units that operate simultaneously, thereby reducing overall complexity and increasing allocation speed.
Solution Approach 2:
The patent introduces a parallel processing dimension to the traditional sequential algorithm. By transitioning from a single-threaded sequential approach to a multi-threaded parallel architecture, the system can evaluate multiple user-sub-channel combinations simultaneously, effectively adding a temporal parallelism dimension that reduces allocation time while maintaining implementation simplicity through modular processing units.
2Ease of manufacture
If a sequential algorithm is used for sub-channel assignment, then the implementation remains straightforward, but the time required for allocation becomes excessively long
Solution Approach 1:
The patent segments the allocation process into independent user-based processing units, each handling assignment for a specific user. This segmentation allows simultaneous execution of allocation operations for multiple users without increasing implementation complexity, as each unit follows the same straightforward sequential logic within its scope.
Solution Approach 2:
The patent performs preliminary actions by pre-establishing the mapping between users and processing units, and pre-configuring the evaluation criteria for sub-channel assignment. This preparation allows the actual allocation to proceed in parallel without requiring complex real-time decision-making, thus reducing allocation time while keeping implementation simple.
3Device complexity
If traditional sequential scheduling is used, then the system structure remains simple, but the ability to handle dynamic changes and multiple users efficiently deteriorates
Solution Approach 1:
The patent segments the scheduling system into independent user-associated processing units, each capable of independently handling dynamic changes for its assigned user. This segmentation enables the system to handle multiple users and dynamic modifications simultaneously without requiring complex centralized coordination, thus improving adaptability while maintaining structural simplicity through modular units.
Solution Approach 2:
The patent introduces dynamic adaptability at the user-processing unit level, where each unit can independently adjust sub-channel assignments in response to changing conditions. This distributed dynamics allows the system to adapt to multiple users and dynamic changes without requiring complex global reoptimization, maintaining simplicity while enhancing versatility.
Data Source
AI summary
A method and apparatus for calculating an optimal sub-channel allocation of Orthogonal Frequency Division Multiple Access (OFDMA) from a first bipartite graph that may map users, to a second bipartite graph that may map additional users, including original users. A calculation of each bipartite graph may include a calculation of maximum weight paths and matchings. Using a bipartite graph method for OFDMA sub-channel allocation may improve the time and complexity when establishing an OFDMA wireless system.