Randomized Two-Timescale Hybrid Precoding for Downlink Multicell Massive MIMO Systems

You are here

Top Reasons to Join SPS Today!

1. IEEE Signal Processing Magazine
2. Signal Processing Digital Library*
3. Inside Signal Processing Newsletter
4. SPS Resource Center
5. Career advancement & recognition
6. Discounts on conferences and publications
7. Professional networking
8. Communities for students, young professionals, and women
9. Volunteer opportunities
10. Coming soon! PDH/CEU credits
Click here to learn more.

Randomized Two-Timescale Hybrid Precoding for Downlink Multicell Massive MIMO Systems

By: 
Xihan Chen; An Liu; Yunlong Cai; Vincent K. N. Lau; Min-Jian Zhao

Although massive multiple-input multiple-output (MIMO) promises high spectral efficiency, there are several issues that significantly limit the potential gain of massive MIMO, such as severe inter-cell interference, huge channel state information (CSI) overhead/delay, high cost and power consumption of RF chains, and user fairness. Several precoding schemes have been proposed for massive MIMO but there still lacks a systematic solution to address all of the aforementioned issues especially for the multicell case. In this paper, we propose a randomized two-timescale hybrid precoding (RTHP) scheme for the downlink transmission of multicell massive MIMO systems. RTHP allows time sharing among multiple sets of analog precoders to achieve better tradeoff between sum throughput and fairness. Moreover, the time-sharing factors and analog precoders are adapted to the long-term channel statistics to mitigate inter-cell interference with reduced CSI overhead and RF chains. The digital precoder is used to support multiuser MIMO at each base station based on local low-dimensional effective CSI only. As such, RTHP resolves all of the aforementioned issues. We formulate the optimization of RTHP as a general network utility maximization problem (GNUMP), which is a two-timescale stochastic non-convex problem, and consequently challenging to solve. By exploiting some approximation techniques, we convert the problem into a more tractable form and subsequently develop an online algorithm, which is shown to converge to stationary solutions of the approximate GNUMP. Finally, simulation results verify the advantages of the proposed scheme over baseline schemes.

Table of Contents:

TSP Featured Articles

SPS on Twitter

  • We are happy to welcome Prof. Jiebo Luo as the new Editor-in-Chief of IEEE Transactions on Multimedia beginning in… https://t.co/9ZgBrgkFXv
  • wants your talents! Our tenure-track position in engineering applications of information and data science a… https://t.co/QrqTAFGlyM
  • If you’re missing out on , don’t worry - we’ll be tweeting all week long. Follow along with us to see the action!

SPS Videos


Signal Processing in Home Assistants

 


Multimedia Forensics


Careers in Signal Processing             

 


Under the Radar