• Title/Summary/Keyword: distributed massive MIMO

Search Result 4, Processing Time 0.015 seconds

Energy Efficiency of Distributed Massive MIMO Systems

  • He, Chunlong;Yin, Jiajia;He, Yejun;Huang, Min;Zhao, Bo
    • Journal of Communications and Networks
    • /
    • v.18 no.4
    • /
    • pp.649-657
    • /
    • 2016
  • In this paper, we investigate energy efficiency (EE) of the traditional co-located and the distributed massive multiple-input multiple-output (MIMO) systems. First, we derive an approximate EE expression for both the idealistic and the realistic power consumption models. Then an optimal energy-efficient remote access unit (RAU) selection algorithm based on the distance between the mobile stations (MSs) and the RAUs are developed to maximize the EE for the downlink distributed massive MIMO systems under the realistic power consumption model. Numerical results show that the EE of the distributed massive MIMO systems is larger than the co-located massive MIMO systems under both the idealistic and realistic power consumption models, and the optimal EE can be obtained by the developed energy-efficient RAU selection algorithm.

Low Complexity Zero-Forcing Beamforming for Distributed Massive MIMO Systems in Large Public Venues

  • Li, Haoming;Leung, Victor C.M.
    • Journal of Communications and Networks
    • /
    • v.15 no.4
    • /
    • pp.370-382
    • /
    • 2013
  • Distributed massive MIMO systems, which have high bandwidth efficiency and can accommodate a tremendous amount of traffic using algorithms such as zero-forcing beam forming (ZFBF), may be deployed in large public venues with the antennas mounted under-floor. In this case the channel gain matrix H can be modeled as a multi-banded matrix, in which off-diagonal entries decay both exponentially due to heavy human penetration loss and polynomially due to free space propagation loss. To enable practical implementation of such systems, we present a multi-banded matrix inversion algorithm that substantially reduces the complexity of ZFBF by keeping the most significant entries in H and the precoding matrix W. We introduce a parameter p to control the sparsity of H and W and thus achieve the tradeoff between the computational complexity and the system throughput. The proposed algorithm includes dense and sparse precoding versions, providing quadratic and linear complexity, respectively, relative to the number of antennas. We present analysis and numerical evaluations to show that the signal-to-interference ratio (SIR) increases linearly with p in dense precoding. In sparse precoding, we demonstrate the necessity of using directional antennas by both analysis and simulations. When the directional antenna gain increases, the resulting SIR increment in sparse precoding increases linearly with p, while the SIR of dense precoding is much less sensitive to changes in p.

Distributed Compressive Sensing Based Channel Feedback Scheme for Massive Antenna Arrays with Spatial Correlation

  • Gao, Huanqin;Song, Rongfang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.1
    • /
    • pp.108-122
    • /
    • 2014
  • Massive antenna array is an attractive candidate technique for future broadband wireless communications to acquire high spectrum and energy efficiency. However, such benefits can be realized only when proper channel information is available at the transmitter. Since the amount of the channel information required by the transmitter is large for massive antennas, the feedback is burdensome in practice, especially for frequency division duplex (FDD) systems, and needs normally to be reduced. In this paper a novel channel feedback reduction scheme based on the theory of distributed compressive sensing (DCS) is proposed to apply to massive antenna arrays with spatial correlation, which brings substantially reduced feedback load. Simulation results prove that the novel scheme is better than the channel feedback technique based on traditional compressive sensing (CS) in the aspects of mean square error (MSE), cumulative distributed function (CDF) performance and feedback resources saving.

Capacity Bounds on the Ergodic Capacity of Distributed MIMO Systems over K Fading Channels

  • Li, XingWang;Wang, Junfeng;Li, Lihua;Cavalcante, Charles C.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.7
    • /
    • pp.2992-3009
    • /
    • 2016
  • The performance of D-MIMO systems is not only affected by multipath fading but also from shadowing fading, as well as path loss. In this paper, we investigate the ergodic capacity of D-MIMO systems operating in non-correlated K fading (Rayleigh/Gamma) channels. With the aid of majorization and Minkowski theory, we derive analytical closed-form expressions of the upper and lower bounds on the ergodic capacity for D-MIMO systems over non-correlated K fading channels, which are quite general and applicable for arbitrary signal-to-noise ratio (SNR) and the number of transceiver antennas. To intuitively reveal the impacts of system and fading parameters on the ergodic capacity, we deduce asymptotic approximations in the high and low SNR regimes. Finally, we pursue the massive MIMO systems analysis for the lower bound and derive closed-form expressions when the number of antennas at BS grows large, and when the number of antennas at transceivers becomes large with a fixed and finite ratio. It is demonstrated that the proposed expressions on the ergodic capacity accurately match with the theoretical analysis.