Double Search User Group Selection for TDD MIMO Downlink
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current multi-antenna systems for wireless communications face challenges in efficiently managing user group selection for maximizing downlink throughput in multiuser MIMO environments, particularly due to high computational complexity and increased cost associated with increased size, complexity, and power consumption.
Innovation Solution
A double search user group selection scheme with range reduction is implemented in time division duplex (TDD) multiuser MIMO systems, where the search range is restricted to the L strongest users, reducing the number of candidate user groups from L(L+1)/2 to 2L-1, and utilizing linear precoding to optimize system capacity.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If exhaustive user group selection is performed to maximize downlink throughput, then system capacity is improved, but computational complexity increases significantly
Solution Approach 1:
The patent segments the user selection process into two stages: first identifying candidate users based on channel conditions, then selecting optimal groups from reduced candidates. This divides the exhaustive search into manageable segments, reducing computational complexity while maintaining near-optimal throughput performance.
Solution Approach 2:
Instead of evaluating all possible user groups (excessive action), the patent uses a reduced search space based on channel conditions (partial action). This partial evaluation approach achieves sufficient performance without the full computational burden of exhaustive search.
2Productivity
If multiple antennas are deployed to increase system capacity, then downlink throughput is improved, but device size and cost increase
Solution Approach 1:
The patent employs user group selection and linear precoding techniques that can be applied across multiple antenna configurations. The same algorithmic framework works whether 2 or 8 antennas are deployed, making the system adaptable without requiring proportional increases in complexity for each antenna addition.
Solution Approach 2:
The system adjusts precoding parameters and search ranges dynamically based on the number of antennas and users. By changing operational parameters rather than fundamental system architecture, the patent maintains scalability without linearly increasing device complexity with each additional antenna.
3Device complexity
If user group selection search range is reduced to L strongest users, then computational burden is reduced, but may miss optimal user combinations
Solution Approach 1:
The patent performs preliminary sorting of users based on channel conditions before the selection process. This preliminary action organizes users in advance, allowing the subsequent search to focus on the most promising candidates (L strongest users) rather than randomly sampling, thus maintaining high reliability of selection.
Solution Approach 2:
The system uses feedback from channel condition measurements to dynamically adjust the search range and selection criteria. By continuously monitoring channel quality and updating the candidate list, the system ensures that reducing the search range to L users does not compromise optimality, as the feedback mechanism adapts the search to actual channel conditions.
Data Source
AI summary
Certain aspects of a method and system for processing signals in a communication system may include maximizing system capacity for a time division duplex (TDD) multiple-input multiple-output (MIMO) system, based on reducing a search range within which to find a group of signals having maximum channel gain. At least one of: a first signal for a first user and a second signal for a second user may be selected, which are both within the reduced search range, and which provides a maximum system capacity. The first signal for the first user may be selected from the reduced search range corresponding to a channel gain that is greater than a channel gain corresponding to a remaining portion of the reduced search range. The reduced search range may be generated by sorting a plurality of signals based on a channel gain corresponding to each of the plurality of signals.