Integer-Forcing Linear Receivers

Linear receivers are often used to reduce the implementation complexity of multiple-antenna systems. In a traditional linear receiver architecture, the receive antennas are used to separate out the codewords sent by each transmit antenna, which can then be decoded individually. Although easy to implement, this approach can be highly suboptimal when the channel matrix is near singular. This paper develops a new linear receiver architecture that uses the receive antennas to create an effective channel matrix with integer-valued entries. Rather than attempting to recover transmitted codewords directly, the decoder recovers integer combinations of the codewords according to the entries of the effective channel matrix. The codewords are all generated using the same linear code which guarantees that these integer combinations are themselves codewords. Provided that the effective channel is full rank, these integer combinations can then be digitally solved for the original codewords. This paper focuses on the special case where there is no coding across transmit antennas and no channel state information at the transmitter(s), which corresponds either to a multi-user uplink scenario or to single-user V-BLAST encoding. In this setting, the proposed integer-forcing linear receiver significantly outperforms conventional linear architectures such as the zero-forcing and linear MMSE receiver. In the high SNR regime, the proposed receiver attains the optimal diversity-multiplexing tradeoff for the standard MIMO channel with no coding across transmit antennas. It is further shown that in an extended MIMO model with interference, the integer-forcing linear receiver achieves the optimal generalized degrees-of-freedom.Comment: 40 pages, 16 figures, to appear in the IEEE Transactions on Information Theor

Channel estimation in massive MIMO systems

Last years were characterized by a great demand for high data throughput, good quality and spectral efficiency in wireless communication systems. Consequently, a revolution in cellular networks has been set in motion towards to 5G. Massive multiple-input multiple-output (MIMO) is one of the new concepts in 5G and the idea is to scale up the known MIMO systems in unprecedented proportions, by deploying hundreds of antennas at base stations. Although, perfect channel knowledge is crucial in these systems for user and data stream separation in order to cancel interference. The most common way to estimate the channel is based on pilots. However, problems such as interference and pilot contamination (PC) can arise due to the multiplicity of channels in the wireless link. Therefore, it is crucial to define techniques for channel estimation that together with pilot contamination mitigation allow best system performance and at same time low complexity. This work introduces a low-complexity channel estimation technique based on Zadoff-Chu training sequences. In addition, different approaches were studied towards pilot contamination mitigation and low complexity schemes, with resort to iterative channel estimation methods, semi-blind subspace tracking techniques and matrix inversion substitutes. System performance simulations were performed for the several proposed techniques in order to identify the best tradeoff between complexity, spectral efficiency and system performance

Cooperative diversity for the cellular uplink: Sharing strategies, performance analysis, and receiver design

In this thesis, we propose data sharing schemes for the cooperative diversity in a cellular uplink to exploit diversity and enhance throughput performance of the system. Particularly, we consider new two and three-or-more user decode and forward (DF) protocols using space time block codes. We discuss two-user and three-user amplify and forward (AF) protocols and evaluate the performance of the above mentioned data sharing protocols in terms of the bit error rate and the throughput in an asynchronous code division multiple access (CDMA) cellular uplink. We develop a linear receiver for joint space-time decoding and multiuser detection that provides full diversity and near maximum-likelihood performance.;We also focus on a practical situation where inter-user channel is noisy and cooperating users can not successfully estimate other user\u27s data. We further design our system model such that, users decide not to forward anything in case of symbol errors. Channel estimation plays an important role here, since cooperating users make random estimation errors and the base station can not have the knowledge of the errors or the inter-user channels. We consider a training-based approach for channel estimation. We provide an information outage probability analysis for the proposed multi-user sharing schemes. (Abstract shortened by UMI.)

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

In downlink multi-antenna systems with many users, the multiplexing gain is strictly limited by the number of transmit antennas $N$ and the use of these antennas. Assuming that the total number of receive antennas at the multi-antenna users is much larger than $N$, 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 $N$ 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

Extending the user capacity of MU-MIMO systems with low detection complexity and receive diversity

Multiple-input multiple-output (MIMO) based technologies are considered as an integral part of the upcoming 5G communications to fulfil the ever-increasing demands of wireless applications with high spectral efficiency requirements. However, in uplink multiuser MIMO (MU-MIMO) channels, the number of allowed users is limited by the number of receive antennas associated with radio frequency (RF) chains at the base-station and the complexity burden of multiuser detection (MUD). In this paper, a novel group layer MU-MIMO scheme with low complexity MUD is proposed to increase the number of served users well beyond the available RF chains. By taking the advantage of power control and inherent path loss in cellular systems, the allowed users are divided into groups based on their received power. Efficient group power allocation and group layer MUD (GL-MUD) are utilized to provide a valuable tradeoff between complexity and achieved performance. Furthermore, when more receive antennas than RF chains is implemented, a generalized norm based antenna selection algorithm is proposed to enhance the error performance. Symbol error probability expressions are derived and the effectiveness of proposed scheme is demonstrated through numerical simulations compared with the conventional MU-MIMO and non-orthogonal multiple-access (NOMA) systems over Rayleigh fading channels. The results show a substantial increase in user capacity up to two-fold for the available number of RF chains. In addition, significant signal-to-noise ratio gain is achieved using GL-MUD compared with different MUD techniques

Fundamental Limits of Cooperation

Cooperation is viewed as a key ingredient for interference management in wireless systems. This paper shows that cooperation has fundamental limitations. The main result is that even full cooperation between transmitters cannot in general change an interference-limited network to a noise-limited network. The key idea is that there exists a spectral efficiency upper bound that is independent of the transmit power. First, a spectral efficiency upper bound is established for systems that rely on pilot-assisted channel estimation; in this framework, cooperation is shown to be possible only within clusters of limited size, which are subject to out-of-cluster interference whose power scales with that of the in-cluster signals. Second, an upper bound is also shown to exist when cooperation is through noncoherent communication; thus, the spectral efficiency limitation is not a by-product of the reliance on pilot-assisted channel estimation. Consequently, existing literature that routinely assumes the high-power spectral efficiency scales with the log of the transmit power provides only a partial characterization. The complete characterization proposed in this paper subdivides the high-power regime into a degrees-of-freedom regime, where the scaling with the log of the transmit power holds approximately, and a saturation regime, where the spectral efficiency hits a ceiling that is independent of the power. Using a cellular system as an example, it is demonstrated that the spectral efficiency saturates at power levels of operational relevance.Comment: 27 page