English
Related papers

Related papers: Lattice Sequential Decoding for LAST Coded MIMO Ch…

200 papers

In this paper the fading multiple antenna (MIMO) wire-tap channel is investigated under short term power constraints. The secret diversity gain and the secret multiplexing gain are defined. Using these definitions, the secret…

Information Theory · Computer Science 2015-03-13 Melda Yuksel , Elza Erkip

This paper studies channel coding for the discrete memoryless multiple-access channel with a given (possibly suboptimal) decoding rule. A multi-letter successive decoding rule depending on an arbitrary non-negative decoding metric is…

Information Theory · Computer Science 2017-12-08 Jonathan Scarlett , Alfonso Martinez , Albert Guillén i Fàbregas

Diversity-multiplexing tradeoff (DMT) presents a compact framework to compare various MIMO systems and channels in terms of the two main advantages they provide (i.e. high data rate and/or low error rate). This tradeoff was characterized…

Information Theory · Computer Science 2016-11-15 Sergey Loyka , George Levin

We analyze two-user single-antenna fading interference channels with perfect receive channel state information (CSI) and no transmit CSI. We compute the diversity-multiplexing tradeoff (DMT) region of a fixed-power-split Han and Kobayashi…

Information Theory · Computer Science 2009-05-07 Cemal Akcaba , Helmut Boelcskei

For finite coupling lengths, terminated spatially coupled low-density parity-check (SC-LDPC) codes show a non-negligible rate-loss. In this paper, we investigate if this rate loss can be mitigated by tail-biting SC-LDPC codes in conjunction…

Information Theory · Computer Science 2017-04-19 Sebastian Cammerer , Laurent Schmalen , Vahid Aref , Stephan ten Brink

We analyze the (computational) complexity distribution of sphere-decoding (SD) for random infinite lattices. In particular, we show that under fairly general assumptions on the statistics of the lattice basis matrix, the tail behavior of…

Information Theory · Computer Science 2016-11-15 Dominik Seethaler , Joakim Jaldén , Christoph Studer , Helmut Bölcskei

In this study we consider rateless coding over discrete memoryless channels (DMC) with feedback. Unlike traditional fixed-rate codes, in rateless codes each codeword is infinitely long, and the decoding time depends on the confidence level…

Information Theory · Computer Science 2012-01-30 Navot Blits

This paper considers the achievable rates and decoding complexity of low-density parity-check (LDPC) codes over statistically independent parallel channels. The paper starts with the derivation of bounds on the conditional entropy of the…

Information Theory · Computer Science 2007-07-13 Igal Sason , Gil Wiechman

In a recent work, Coronel et al. initiated the study of the relation between the diversity-multiplexing tradeoff (DMT) performance of a multiuser multiple-input multiple-output (MU-MIMO) lattice code and the rate of the decay of the…

Information Theory · Computer Science 2009-08-19 Jyrki Lahtonen , Roope Vehkalahti , Hsiao-feng Lu , Camilla Hollanti , Emanuele Viterbo

The diversity-multiplexing tradeoff (DMT) provides a fundamental performance metric for different multiple-input multiple-output (MIMO) schemes in wireless communications. In this paper, we explore the block fading optical wireless…

Information Theory · Computer Science 2021-12-10 Sufang Yang , Longguang Li , Haoyue Tang , Jintao Wang

We develop a framework to optimize the tradeoff between diversity, multiplexing, and delay in MIMO systems to minimize end-to-end distortion. We first focus on the diversity-multiplexing tradeoff in MIMO systems, and develop analytical…

Information Theory · Computer Science 2008-04-09 Tim Holliday , Andrea J. Goldsmith , H. Vincent Poor

In the setting of quasi-static multiple-input multiple-output (MIMO) channels, we consider the high signal-to-noise ratio (SNR) asymptotic complexity required by the sphere decoding (SD) algorithm for decoding a large class of full rate…

Information Theory · Computer Science 2011-02-08 Joakim Jalden , Petros Elia

This paper addresses point-to-point communication over block-fading channels with independent fading blocks. When both channel state information at the transmitter (CSIT) and receiver (CSIR) are available, most achievable schemes use…

Information Theory · Computer Science 2018-08-28 Ahmed Hindy , Aria Nosratinia

A single input multiple output (SIMO) multiple access channel, with a large number of transmitters sending symbols from a constellation to the receiver of a multi-antenna base station, is considered. The fundamental limits of joint decoding…

Information Theory · Computer Science 2014-04-10 Mainak Chowdhury , Andrea Goldsmith

For ergodic fading, a lattice coding and decoding strategy is proposed and its performance is analyzed for the single-input single-output (SISO) and multiple-input multiple-output (MIMO) point-to-point channel as well as the multiple-access…

Information Theory · Computer Science 2017-02-28 Ahmed Hindy , Aria Nosratinia

In multiple-input multiple-output (MIMO) fading channels maximum likelihood (ML) detection is desirable to achieve high performance, but its complexity grows exponentially with the spectral efficiency. The current state of the art in MIMO…

Information Theory · Computer Science 2007-07-13 Massimiliano Siti , Michael P. Fitz

This work aims at providing new bounds for the diversity multiplexing gain trade-off of a general class of division algebra based lattice codes. In the low multiplexing gain regime, some bounds were previously obtained from the high…

Information Theory · Computer Science 2015-09-29 Laura Luzzi , Roope Vehkalahti , Alexander Gorodnik

Recently, lattice-reduction-aided detectors have been proposed for multiple-input multiple-output (MIMO) systems to give performance with full diversity like maximum likelihood receiver, and yet with complexity similar to linear receivers.…

Data Structures and Algorithms · Computer Science 2007-07-13 Ying Hung Gan , Cong Ling , Wai Ho Mow

Lattice reduction-aided decoding features reduced decoding complexity and near-optimum performance in multi-input multi-output communications. In this paper, a quantitative analysis of lattice reduction-aided decoding is presented. To this…

Information Theory · Computer Science 2015-10-28 Cong Ling

The diversity-multiplexing tradeoff of the dynamic decode-and-forward protocol is characterized for the half-duplex three-terminal (m,k,n)-relay channel where the source, relay and the destination terminals have m, k and n antennas,…

Information Theory · Computer Science 2010-08-10 Sanjay Karmakar , Mahesh K. Varanasi