English
Related papers

Related papers: On The Limitations of The Naive Lattice Decoding

200 papers

The 3D MIMO code is a robust and efficient space-time block code (STBC) for the distributed MIMO broadcasting but suffers from high maximum-likelihood (ML) decoding complexity. In this paper, we first analyze some properties of the 3D MIMO…

Information Theory · Computer Science 2014-01-16 Ming Liu , Matthieu Crussière , Maryline Hélard , Jean-François Hélard

Radio-frequency (RF) impairments in the transceiver hardware of communication systems (e.g., phase noise (PN), high power amplifier (HPA) nonlinearities, or in-phase/quadrature-phase (I/Q) imbalance) can severely degrade the performance of…

Information Theory · Computer Science 2016-11-17 Xinlin Zhang , Michail Matthaiou , Emil Björnson , Mikael Coldrey , Mérouane Debbah

We derive a lower bound on the capacity pre-log of a temporally correlated Rayleigh block-fading multiple-input multiple-output (MIMO) channel with T transmit antennas and R receive antennas in the noncoherent setting (no a priori channel…

Information Theory · Computer Science 2013-02-12 Günther Koliander , Erwin Riegler , Giuseppe Durisi , Veniamin I. Morgenshtern , Franz Hlawatsch

We study the error probability performance of rotated lattice constellations in frequency-flat Nakagami-$m$ block-fading channels. In particular, we use the sphere lower bound on the underlying infinite lattice as a performance benchmark.…

Information Theory · Computer Science 2007-07-13 Albert Guillen i Fabregas , Emanuele Viterbo

A message composed of packets is transmitted using erasure and channel coding over a fading channel with no feedback. For this scenario, the paper explores the trade-off between the redundancies allocated to the packet-level erasure code…

Information Theory · Computer Science 2016-02-03 Sudarsan V. S. Ranganathan , Tong Mu , Richard D. Wesel

We consider a multiple-input, multiple-output (MIMO) wideband Rayleigh block fading channel where the channel state is unknown to both the transmitter and the receiver and there is only an average power constraint on the input. We compute…

Information Theory · Computer Science 2007-07-13 Siddharth Ray , Muriel Medard , Lizhong Zheng

The theoretic results of MIMO capacity tell us that the higher the number of antennas are employed, the higher the transmission rate is. This makes MIMO systems with hundreds of antennas very attractive but one of the major problems that…

Information Theory · Computer Science 2012-04-19 Puripong Suthisopapan , Anupap Meesomboon , Kenta Kasai , Virasit Imtawil

In this paper, we study lattice coding for Rician fading wireless channels. This is motivated in particular by preliminary studies suggesting the Rician fading model for millimeter-wavelength wireless communications. We restrict to lattice…

Information Theory · Computer Science 2017-01-27 Alex Karrila , Niko R. Väisänen , David Karpuk , Camilla Hollanti

The use of channel output feedback to improve the reliability of fading channels has received scant attention in the literature. In most work on feedback for fading channels, only channel state information (CSI) feedback has been exploited…

Information Theory · Computer Science 2012-04-12 Mayur Agrawal , David J. Love , Venkataramanan Balakrishnan

The 3D MIMO code is a robust and efficient space-time coding scheme for the distributed MIMO broadcasting. However, it suffers from the high computational complexity if the optimal maximum-likelihood (ML) decoding is used. In this paper we…

Information Theory · Computer Science 2014-01-08 Ming Liu , Jean-François Hélard , Matthieu Crussière , Maryline Hélard

In this paper we present a novel method for decoding multiple input - multiple output (MIMO) transmission, which combines sphere decoding (SD) and zero forcing (ZF) techniques to provide near optimal low complexity and high performance…

Information Theory · Computer Science 2008-03-03 Vadim Neder , Doron Ezri , Motti Haridim

We present constructions of Space-Time (ST) codes based on lattice coset coding. First, we focus on ST code constructions for the short block-length case, i.e., when the block-length is equal to or slightly larger than the number of…

Information Theory · Computer Science 2008-04-14 K. Raj Kumar , Giuseppe Caire

Low-complexity precoding {algorithms} are proposed in this work to reduce the computational complexity and improve the performance of regularized block diagonalization (RBD) {based} precoding {schemes} for large multi-user {MIMO} (MU-MIMO)…

Information Theory · Computer Science 2013-04-25 Keke Zu , Rodrigo C. de Lamare , Martin Haardt

We study the problem of constructing coded modulation schemes over multidimensional signal sets in Nakagami-$m$ block-fading channels. In particular, we consider the optimal diversity reliability exponent of the error probability when the…

Information Theory · Computer Science 2007-11-26 Albert Guillen i Fabregas , Giuseppe Caire

In this work we extend the concept of uplink-downlink rate balancing to frequency division duplex (FDD) massive MIMO systems. We consider a base station with large number antennas serving many single antenna users. We first show that any…

Information Theory · Computer Science 2016-05-04 Itsik Bergel , Yona Perets , Shlomo Shamai

This paper focuses on studying the fundamental performance limits and linear dispersion code design for the MIMO-ARQ slow fading channel. Optimal average rate of well-known HARQ protocols is analyzed. The optimal design of space-time coding…

Information Theory · Computer Science 2009-05-27 Cong Shen , Michael P. Fitz

To fully support vertical industries, 5G and its corresponding channel coding are expected to meet requirements of different applications. However, for applications of 5G and beyond 5G (B5G) such as URLLC, the transmission latency is…

Information Theory · Computer Science 2022-01-11 Xiaohu You , Chuan Zhang , Bin Sheng , Yongming Huang , Chen Ji , Yifei Shen , Wenyue Zhou , Jian Liu

The performance limits of scalar coding for multiple-input single-output channels are revisited in this work. By employing randomized beamforming, Narula et al. demonstrated that the loss of scalar coding is universally bounded by ~ 2.51 dB…

Information Theory · Computer Science 2013-05-14 Elad Domanovitz , Uri Erez

We consider the following generalization of an $(n,k)$ MDS code for application to an erasure channel with additive noise. Like an MDS code, our code is required to be decodable from any $k$ received symbols, in the absence of noise. In…

Information Theory · Computer Science 2018-01-16 Vinay A. Vaishampayan

In multiple-input multiple-output (MIMO) fading channels, the design criterion for full-diversity space-time block codes (STBCs) is primarily determined by the decoding method at the receiver. Although constructions of STBCs have…

Information Theory · Computer Science 2017-01-16 J. Harshan , Amin Sakzad , Emanuele Viterbo