English
Related papers

Related papers: Gallager's Exponent for MIMO Channels: A Reliabili…

200 papers

We consider a broadcast channel with a degraded message set, in which a single transmitter sends a common message to two receivers and a private message to one of the receivers only. The main goal of this work is to find new lower bounds to…

Information Theory · Computer Science 2009-06-09 Yonatan Kaspi , Neri Merhav

Approximate random matrix models for $\kappa-\mu$ and $\eta-\mu$ faded multiple input multiple output (MIMO) communication channels are derived in terms of a complex Wishart matrix. The proposed approximation has the least Kullback-Leibler…

Information Theory · Computer Science 2019-10-23 Muralikrishnan Srinivasan , Sheetal Kalyani

In this paper, a deterministic equivalent of ergodic sum rate and an algorithm for evaluating the capacity-achieving input covariance matrices for the uplink large-scale multiple-input multiple-output (MIMO) antenna channels are proposed.…

Information Theory · Computer Science 2016-11-18 Jun Zhang , Chao-Kai Wen , Shi Jin , Xiqi Gao , Kai-Kit Wong

For the multiple-input multiple-output (MIMO) broadcast channel with imperfect channel state information (CSI), neither the capacity nor the optimal transmission technique have been fully discovered. In this paper, we derive achievable…

Information Theory · Computer Science 2016-11-18 Jun Zhang , Marios Kountouris , Jeffrey G. Andrews , Robert W. Heath

Optimal decoding of bit interleaved coded modulation (BICM) MIMO-OFDM where an imperfect channel estimate is available at the receiver is investigated. First, by using a Bayesian approach involving the channel a posteriori density, we…

Networking and Internet Architecture · Computer Science 2007-08-13 Sajad Sadough , Pablo Piantanida , Pierre Duhamel

This paper studies the concentration properties of random codes. Specifically, we show that, for discrete memoryless channels, the error exponent of a randomly generated code with pairwise-independent codewords converges in probability to…

Information Theory · Computer Science 2022-03-16 Lan V. Truong , Giuseppe Cocco , Josep Font-Segura , Albert Guillén i Fàbregas

A new straightforward universal blind detection algorithm for linear Gaussian channel with ISI is given. A new error exponent is derived, which is better than Gallager's random coding error exponent.

Information Theory · Computer Science 2008-01-04 Lóránt Farkas

In this paper we consider the computation of channel capacity for ergodic multiple-input multiple-output channels with additive white Gaussian noise. Two scenarios are considered. Firstly, a time-varying channel is considered in which both…

Information Theory · Computer Science 2007-07-13 Leif W Hanlen , Alex J Grant

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

Multiple input multiple output (MIMO) approach in fiber optical communication has emerged as an effective proposition to address the ever increasing demand for information exchange. In the ergodic case, the multiple channels, associated…

Information Theory · Computer Science 2022-11-28 Aritra Laha , Santosh Kumar

We investigate the problem of message transmission and the problem of common randomness (CR) generation over single-user multiple-input multiple-output (MIMO) slow fading channels with average input power constraint, additive white Gaussian…

Information Theory · Computer Science 2022-10-24 Rami Ezzine , Moritz Wiese , Christian Deppe , Holger Boche

The classical Rician Weichselberger channel and the emerging holographic multiple-input multiple-output (MIMO) channel share a common characteristic of non-separable correlation, which captures the interdependence between transmit and…

Information Theory · Computer Science 2024-02-16 Xin Zhang , Shenghui Song , Khaled B. Letaief

Channel reciprocity in time-division duplexing (TDD) massive multiple-input multiple-output (MIMO) systems can be exploited to reduce the overhead required for the acquisition of channel state information (CSI). However, perfect reciprocity…

Information Theory · Computer Science 2018-03-08 De Mi , Mehrdad Dianati , Lei Zhang , Sami Muhaidat , Rahim Tafazolli

Multimode/multicore fibers are expected to provide an attractive solution to overcome the capacity limit of the current optical communication system. In the presence of high cross-talk between modes/cores, the squared singular values of the…

Information Theory · Computer Science 2020-06-11 Amor Nafkha , Nizar Demni

In this paper the performance limits and design principles of rateless codes over fading channels are studied. The diversity-multiplexing tradeoff (DMT) is used to analyze the system performance for all possible transmission rates. It is…

Information Theory · Computer Science 2008-04-30 Yijia Fan , Lifeng Lai , Elza Erkip , H. Vincent Poor

We consider the decoding of bit interleaved coded modulation (BICM) applied to multiband OFDM for practical scenarios where only a noisy (possibly very bad) estimate of the channel is available at the receiver. First, a decoding metric…

Networking and Internet Architecture · Computer Science 2007-08-13 Sajad Sadough , Pablo Piantanida , Pierre Duhamel

The potential benefits of multiple-antenna systems may be limited by two types of channel degradations rank deficiency and spatial fading correlation of the channel. In this paper, we assess the effects of these degradations on the…

Information Theory · Computer Science 2007-07-13 Hyundong Shin , Moe Z. Win

In this paper, the theoretical limits on the robustness of MIMO joint source channel codes is investigated. The case in which a single joint source channel code is used for the entire range of SNRs and for all levels of required fidelity is…

Information Theory · Computer Science 2009-11-02 Mahmoud Taherzadeh , H. Vincent Poor

We derive a single-letter formula for the zero-rate reliability (error exponent) of a finite-state channel whose state variable depends deterministically (and recursively) on past channel inputs, where the code complies with a given channel…

Information Theory · Computer Science 2016-11-15 Neri Merhav

We propose a technique to derive upper bounds on Gallager's cost-constrained random coding exponent function. Applying this technique to the non-coherent peak-power or average-power limited discrete time memoryless Ricean fading channel, we…

Information Theory · Computer Science 2007-07-13 Amos Lapidoth , Natalia Miliou
‹ Prev 1 3 4 5 6 7 10 Next ›