Full Diversity Unitary Precoded Integer-Forcing

We consider a point-to-point flat-fading MIMO channel with channel state information known both at transmitter and receiver. At the transmitter side, a lattice coding scheme is employed at each antenna to map information symbols to independent lattice codewords drawn from the same codebook. Each lattice codeword is then multiplied by a unitary precoding matrix ${\bf P}$ and sent through the channel. At the receiver side, an integer-forcing (IF) linear receiver is employed. We denote this scheme as unitary precoded integer-forcing (UPIF). We show that UPIF can achieve full-diversity under a constraint based on the shortest vector of a lattice generated by the precoding matrix ${\bf P}$. This constraint and a simpler version of that provide design criteria for two types of full-diversity UPIF. Type I uses a unitary precoder that adapts at each channel realization. Type II uses a unitary precoder, which remains fixed for all channel realizations. We then verify our results by computer simulations in $2\times2$, and $4\times 4$ MIMO using different QAM constellations. We finally show that the proposed Type II UPIF outperform the MIMO precoding X-codes at high data rates.Comment: 12 pages, 8 figures, to appear in IEEE-TW

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

Efficient Integer Coefficient Search for Compute-and-Forward

Integer coefficient selection is an important decoding step in the implementation of compute-and-forward (C-F) relaying scheme. Choosing the optimal integer coefficients in C-F has been shown to be a shortest vector problem (SVP) which is known to be NP hard in its general form. Exhaustive search of the integer coefficients is only feasible in complexity for small number of users while approximation algorithms such as Lenstra-Lenstra-Lovasz (LLL) lattice reduction algorithm only find a vector within an exponential factor of the shortest vector. An optimal deterministic algorithm was proposed for C-F by Sahraei and Gastpar specifically for the real valued channel case. In this paper, we adapt their idea to the complex valued channel and propose an efficient search algorithm to find the optimal integer coefficient vectors over the ring of Gaussian integers and the ring of Eisenstein integers. A second algorithm is then proposed that generalises our search algorithm to the Integer-Forcing MIMO C-F receiver. Performance and efficiency of the proposed algorithms are evaluated through simulations and theoretical analysis.Comment: IEEE Transactions on Wireless Communications, to appear.12 pages, 8 figure

Análise de desempenho de receptores baseados em reticulados para MIMO e fastICA em sistemas MIMO cego massivos

Orientador: Gustavo FraidenraichTese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de ComputaçãoResumo: Estatísticas da taxa-soma dos decodificadores Integer Forcing (IF) e outros decodificadores baseados em reticulados para sistemas de Múltipla Entrada e Múltipla Saída (MIMO) são analisadas. Duas aproximações para a taxa-soma de decodificadores lineares são derivadas. A primeira aproximação é baseada no algoritimo Gauss-Lagrange para sistemas com duas antenas no transmissor e receptor (arranjo 2x2) e canais descorrelacionados. A segunda aproximação considera um sistema com um arranjo nxn de antenas, para o caso correlacionado e descorrelacionado e é baseado no segundo teorema de Minkowiski O desempenho de decodificadores IF e Compute and Forward Transform (CFT) são analisados na presença de erro de estimação de canal. Uma aproximação para a taxa-soma média na presença de erros de estimação de canal e canais com realização fixa é derivada. Uma aproximação para a taxa-soma ergódica dos decodificadores IF na presença de canais correlacionados e descorrelacionados também é derivada. Decodificadores lineares IF atraíram atenção significativa devido ao seu potencial de atingir melhor desempenho do que outros decodificadores lineares, especialmente quando as matrizes de canal são aproximadamente singulares. No entanto, uma análise mais profunda de seu desempenho na presença de canais não determinísticos é necessária para que se possa quantificar sua vantagem em relação a decodificadores lineares clássicos e para que se possa corretamente projetar sistemas baseados nestes decodificadoresAbstract: The statistics of the sum-rate of Integer Forcing (IF) and other lattice-based Multiple Input Multiple Output (MIMO) systems are analyzed. Two approximations to the achievable sum-rate of the IF linear receiver and their respective analytical probability density functions (PDF) are derived. The first approximation is based on the Gauss-Lagrange algorithm for systems with two antennas at the transmitter and receiver (2x2 arrays) and uncorrelated channels. The second approximation considers an nxn array for both correlated and uncorrelated channels and its derivation is based on Minkowiski's second theorem. The performance of IF and Compute and Forward Transform (CFT) receivers is also analyzed under the presence of channel estimation errors. An approximation to their average sum-rate in the presence of these errors for fixed channel realizations is derived. An approximation to the Ergodic IF sum-rate for correlated and uncorrelated channels is also derived. IF linear receiver has attracted significant attention recently due to their potential to perform better than other linear receivers, especially in the presence of channel matrices that are close to singular. However, a more in-depth analysis of its performance in the presence of non-deterministic channels is necessary in order to quantify its advantage over classical linear receivers and to correctly design systems that rely on these decoders. Another contribution of this work involves blind decoding in Massive MIMO systems. We propose a variation to the fast Independent Component Analysis (fastICA) which takes into consideration the shape of the constellations to obtain better performanceDoutoradoTelecomunicações e TelemáticaDoutor em Engenharia ElétricaCAPE