140 research outputs found

    Full Diversity Unitary Precoded Integer-Forcing

    Full text link
    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 P{\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 P{\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×22\times2, and 4×44\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

    On MU-MIMO Precoding Techniques for WiMAX

    Get PDF

    Efficient Optimal Joint Channel Estimation and Data Detection for Massive MIMO Systems

    Full text link
    In this paper, we propose an efficient optimal joint channel estimation and data detection algorithm for massive MIMO wireless systems. Our algorithm is optimal in terms of the generalized likelihood ratio test (GLRT). For massive MIMO systems, we show that the expected complexity of our algorithm grows polynomially in the channel coherence time. Simulation results demonstrate significant performance gains of our algorithm compared with suboptimal non-coherent detection algorithms. To the best of our knowledge, this is the first algorithm which efficiently achieves GLRT-optimal non-coherent detections for massive MIMO systems with general constellations.Comment: 5 pages, 4 figures, Conferenc

    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

    Communication Over MIMO Broadcast Channels Using Lattice-Basis Reduction

    Full text link
    A simple scheme for communication over MIMO broadcast channels is introduced which adopts the lattice reduction technique to improve the naive channel inversion method. Lattice basis reduction helps us to reduce the average transmitted energy by modifying the region which includes the constellation points. Simulation results show that the proposed scheme performs well, and as compared to the more complex methods (such as the perturbation method) has a negligible loss. Moreover, the proposed method is extended to the case of different rates for different users. The asymptotic behavior of the symbol error rate of the proposed method and the perturbation technique, and also the outage probability for the case of fixed-rate users is analyzed. It is shown that the proposed method, based on LLL lattice reduction, achieves the optimum asymptotic slope of symbol-error-rate (called the precoding diversity). Also, the outage probability for the case of fixed sum-rate is analyzed.Comment: Submitted to IEEE Trans. on Info. Theory (Jan. 15, 2006), Revised (Jun. 12, 2007
    • …
    corecore