Optimal Phase Control for Equal-Gain Transmission in MIMO Systems With Scalar Quantization: Complexity and Algorithms

The complexity of the optimal phase control problem in wireless MIMO systems with scalar feedback quantization and equal-gain transmission is studied. The problem is shown to be NP-hard when the number of receive antennas grows linearly with the number of transmit antennas. For the case where the nu...

Full description

Bibliographic Details
Main Authors: Leung, Kin-Kwong (Author), Sung, Chi Wan (Author), Khabbazian, Majid (Contributor), Safari, Mohammad Ali (Author)
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor)
Format: Article
Language:English
Published: Institute of Electrical and Electronics Engineers (IEEE), 2012-06-13T18:03:32Z.
Subjects:
Online Access:Get fulltext
LEADER 01445 am a22002173u 4500
001 71135
042 |a dc 
100 1 0 |a Leung, Kin-Kwong  |e author 
100 1 0 |a Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory  |e contributor 
100 1 0 |a Khabbazian, Majid  |e contributor 
100 1 0 |a Khabbazian, Majid  |e contributor 
700 1 0 |a Sung, Chi Wan  |e author 
700 1 0 |a Khabbazian, Majid  |e author 
700 1 0 |a Safari, Mohammad Ali  |e author 
245 0 0 |a Optimal Phase Control for Equal-Gain Transmission in MIMO Systems With Scalar Quantization: Complexity and Algorithms 
260 |b Institute of Electrical and Electronics Engineers (IEEE),   |c 2012-06-13T18:03:32Z. 
856 |z Get fulltext  |u http://hdl.handle.net/1721.1/71135 
520 |a The complexity of the optimal phase control problem in wireless MIMO systems with scalar feedback quantization and equal-gain transmission is studied. The problem is shown to be NP-hard when the number of receive antennas grows linearly with the number of transmit antennas. For the case where the number of receive antennas is constant, the problem can be solved in polynomial time. An optimal algorithm is explicitly constructed. For practical purposes, a low-complexity algorithm based on local search is presented. Simulation results show that its performance is nearly optimal. 
546 |a en_US 
655 7 |a Article 
773 |t IEEE Transactions on Information Theory