4.5 Article

Network MIMO With Linear Zero-Forcing Beamforming: Large System Analysis, Impact of Channel Estimation, and Reduced-Complexity Scheduling

Journal

IEEE TRANSACTIONS ON INFORMATION THEORY
Volume 58, Issue 5, Pages 2911-2934

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIT.2011.2178230

Keywords

Channel estimation; downlink scheduling; large random matrices; linear zero-forcing beamforming; network MIMO

Funding

  1. National Science Foundation [CIF 0917343, CIF 1144059]
  2. Division of Computing and Communication Foundations
  3. Direct For Computer & Info Scie & Enginr [0917343] Funding Source: National Science Foundation

Ask authors/readers for more resources

We consider the downlink of a multicell system with multiantenna base stations and single-antenna user terminals, arbitrary base station cooperation clusters, distance-dependent propagation pathloss, and general fairness requirements. Base stations in the same cooperation cluster employ joint transmission with linear zero-forcing beamforming, subject to sum or per-base station power constraints. Intercluster interference is treated as noise at the user terminals. Analytic expressions for the system spectral efficiency are found in the large-system limit where both the numbers of users and antennas per base station tend to infinity with a given ratio. In particular, for the per-base station power constraint, we find new results in random matrix theory, yielding the squared Frobenius norm of submatrices of the Moore-Penrose pseudo-inverse for the structured non-i.i.d. channel matrix resulting from the cooperation cluster, user distribution, and path-loss coefficients. The analysis is extended to the case of nonideal Channel State Information at the Transmitters obtained through explicit downlink channel training and uplink feedback. Specifically, our results illuminate the trade-off between the benefit of a larger number of cooperating antennas and the cost of estimating higher-dimensional channel vectors. Furthermore, our analysis leads to a new simplified downlink scheduling scheme that preselects the users according to probabilities obtained from the large-system results, depending on the desired fairness criterion. The proposed scheme performs close to the optimal (finite-dimensional) opportunistic user selection while requiring significantly less channel state feedback, since only a small fraction of preselected users must feed back their channel state information.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.5
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available