1,651 research outputs found

    Receive Combining vs. Multi-Stream Multiplexing in Downlink Systems with Multi-Antenna Users

    Full text link
    In downlink multi-antenna systems with many users, the multiplexing gain is strictly limited by the number of transmit antennas NN and the use of these antennas. Assuming that the total number of receive antennas at the multi-antenna users is much larger than NN, the maximal multiplexing gain can be achieved with many different transmission/reception strategies. For example, the excess number of receive antennas can be utilized to schedule users with effective channels that are near-orthogonal, for multi-stream multiplexing to users with well-conditioned channels, and/or to enable interference-aware receive combining. In this paper, we try to answer the question if the NN data streams should be divided among few users (many streams per user) or many users (few streams per user, enabling receive combining). Analytic results are derived to show how user selection, spatial correlation, heterogeneous user conditions, and imperfect channel acquisition (quantization or estimation errors) affect the performance when sending the maximal number of streams or one stream per scheduled user---the two extremes in data stream allocation. While contradicting observations on this topic have been reported in prior works, we show that selecting many users and allocating one stream per user (i.e., exploiting receive combining) is the best candidate under realistic conditions. This is explained by the provably stronger resilience towards spatial correlation and the larger benefit from multi-user diversity. This fundamental result has positive implications for the design of downlink systems as it reduces the hardware requirements at the user devices and simplifies the throughput optimization.Comment: Published in IEEE Transactions on Signal Processing, 16 pages, 11 figures. The results can be reproduced using the following Matlab code: https://github.com/emilbjornson/one-or-multiple-stream

    The DoF of Network MIMO with Backhaul Delays

    Full text link
    We consider the problem of downlink precoding for Network (multi-cell) MIMO networks where Transmitters (TXs) are provided with imperfect Channel State Information (CSI). Specifically, each TX receives a delayed channel estimate with the delay being specific to each channel component. This model is particularly adapted to the scenarios where a user feeds back its CSI to its serving base only as it is envisioned in future LTE networks. We analyze the impact of the delay during the backhaul-based CSI exchange on the rate performance achieved by Network MIMO. We highlight how delay can dramatically degrade system performance if existing precoding methods are to be used. We propose an alternative robust beamforming strategy which achieves the maximal performance, in DoF sense. We verify by simulations that the theoretical DoF improvement translates into a performance increase at finite Signal-to-Noise Ratio (SNR) as well

    Degrees of Freedom of Time Correlated MISO Broadcast Channel with Delayed CSIT

    Full text link
    We consider the time correlated multiple-input single-output (MISO) broadcast channel where the transmitter has imperfect knowledge on the current channel state, in addition to delayed channel state information. By representing the quality of the current channel state information as P^-{\alpha} for the signal-to-noise ratio P and some constant {\alpha} \geq 0, we characterize the optimal degree of freedom region for this more general two-user MISO broadcast correlated channel. The essential ingredients of the proposed scheme lie in the quantization and multicasting of the overheard interferences, while broadcasting new private messages. Our proposed scheme smoothly bridges between the scheme recently proposed by Maddah-Ali and Tse with no current state information and a simple zero-forcing beamforming with perfect current state information.Comment: revised and final version, to appear in IEEE transactions on Information Theor

    MIMO Interference Alignment Over Correlated Channels with Imperfect CSI

    Full text link
    Interference alignment (IA), given uncorrelated channel components and perfect channel state information, obtains the maximum degrees of freedom in an interference channel. Little is known, however, about how the sum rate of IA behaves at finite transmit power, with imperfect channel state information, or antenna correlation. This paper provides an approximate closed-form signal-to-interference-plus-noise-ratio (SINR) expression for IA over multiple-input-multiple-output (MIMO) channels with imperfect channel state information and transmit antenna correlation. Assuming linear processing at the transmitters and zero-forcing receivers, random matrix theory tools are utilized to derive an approximation for the post-processing SINR distribution of each stream for each user. Perfect channel knowledge and i.i.d. channel coefficients constitute special cases. This SINR distribution not only allows easy calculation of useful performance metrics like sum rate and symbol error rate, but also permits a realistic comparison of IA with other transmission techniques. More specifically, IA is compared with spatial multiplexing and beamforming and it is shown that IA may not be optimal for some performance criteria.Comment: 21 pages, 7 figures, submitted to IEEE Transactions on Signal Processin

    Power Scaling of Uplink Massive MIMO Systems with Arbitrary-Rank Channel Means

    Full text link
    This paper investigates the uplink achievable rates of massive multiple-input multiple-output (MIMO) antenna systems in Ricean fading channels, using maximal-ratio combining (MRC) and zero-forcing (ZF) receivers, assuming perfect and imperfect channel state information (CSI). In contrast to previous relevant works, the fast fading MIMO channel matrix is assumed to have an arbitrary-rank deterministic component as well as a Rayleigh-distributed random component. We derive tractable expressions for the achievable uplink rate in the large-antenna limit, along with approximating results that hold for any finite number of antennas. Based on these analytical results, we obtain the scaling law that the users' transmit power should satisfy, while maintaining a desirable quality of service. In particular, it is found that regardless of the Ricean KK-factor, in the case of perfect CSI, the approximations converge to the same constant value as the exact results, as the number of base station antennas, MM, grows large, while the transmit power of each user can be scaled down proportionally to 1/M1/M. If CSI is estimated with uncertainty, the same result holds true but only when the Ricean KK-factor is non-zero. Otherwise, if the channel experiences Rayleigh fading, we can only cut the transmit power of each user proportionally to 1/M1/\sqrt M. In addition, we show that with an increasing Ricean KK-factor, the uplink rates will converge to fixed values for both MRC and ZF receivers

    Uplink CoMP under a Constrained Backhaul and Imperfect Channel Knowledge

    Full text link
    Coordinated Multi-Point (CoMP) is known to be a key technology for next generation mobile communications systems, as it allows to overcome the burden of inter-cell interference. Especially in the uplink, it is likely that interference exploitation schemes will be used in the near future, as they can be used with legacy terminals and require no or little changes in standardization. Major drawbacks, however, are the extent of additional backhaul infrastructure needed, and the sensitivity to imperfect channel knowledge. This paper jointly addresses both issues in a new framework incorporating a multitude of proposed theoretical uplink CoMP concepts, which are then put into perspective with practical CoMP algorithms. This comprehensive analysis provides new insight into the potential usage of uplink CoMP in next generation wireless communications systems.Comment: Submitted to IEEE Transactions on Wireless Communications in February 201
    corecore