A Suboptimal Multiuser-Pairing Algorithm With Low Complexity for Virtual MIMO Systems

In virtual multiple-input-multiple-output (V-MIMO) systems, employing a user-pairing algorithm can significantly improve system capacity and spectral efficiency using multiuser diversity. The optimal pairing algorithm can achieve optimal system performance, but it is not feasible to implement in pra...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on vehicular technology Vol. 63; no. 7; pp. 3481 - 3486
Main Authors: Hongzhi, Zhao, Song, Ma, Fengwei, Liu, Youxi, Tang
Format: Journal Article
Language:English
Published: New York IEEE 01.09.2014
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Algorithm design and analysis
Algorithms
Balancing
Complexity
Complexity theory
Computer simulation
Criteria
MIMO
Optimization
proportional fair (PF)
Signal to noise ratio
Spectra
Throughput
Transmitting antennas
user pairing
virtual multiple-input multiple-output (V-MIMO)
user pairing
proportional fair (PF)
throughput
virtual multiple-input multiple-output (V-MIMO)
Complexity
ISSN:0018-9545, 1939-9359
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In virtual multiple-input-multiple-output (V-MIMO) systems, employing a user-pairing algorithm can significantly improve system capacity and spectral efficiency using multiuser diversity. The optimal pairing algorithm can achieve optimal system performance, but it is not feasible to implement in practice due to its huge complexity. To solve the problem, an efficient suboptimal pairing algorithm with lower complexity is proposed, which maximizes the system throughput by selecting users one by one. Furthermore, to achieve a good balance between throughput and user fairness, a novel pairing algorithm is derived, which combines the advantages of the suboptimal pairing algorithm and proportional fair (PF) criteria. Simulation results show that the proposed algorithm achieves better fairness and higher system throughput than the double PF (D-PF) algorithm, and has much lower complexity than the optimal pairing algorithm.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:0018-9545
1939-9359
DOI:10.1109/TVT.2013.2297517