English
Related papers

Related papers: Explicit Lower Bounds on the Outage Probability of…

200 papers

An open-loop single-user multiple-input multiple-output communication scheme is considered where a transmitter, equipped with multiple antennas, encodes the data into independent streams all taken from the same linear code. The coded…

Information Theory · Computer Science 2014-11-04 Or Ordentlich , Uri Erez

Integer forcing is an alternative approach to conventional linear receivers for multiple-antenna systems. In an integer-forcing receiver, integer linear combinations of messages are extracted from the received matrix before each individual…

Information Theory · Computer Science 2019-05-07 Ricardo Bohaczuk Venturelli , Danilo Silva

The amount of sensitive data, which is transmitted wirelessly will increase with future technologies. This raises many questions about secure data transmission. Besides cryptography, information-theoretic security gained increasing…

Information Theory · Computer Science 2021-01-18 Karl-Ludwig Besser , Eduard A. Jorswieck

This paper considers packet scheduling over a broadcast channel with packet erasures to multiple receivers with different messages (multiple uni-cast) each with possibly different hard deadline constraints. A novel metric is proposed and…

Networking and Internet Architecture · Computer Science 2018-08-01 Zohreh Ovaisi , Natasha Devroye , Hulya Seferoglu , Besma Smida , Daniela Tuninetti

This paper examines the problem of rate allocation for multicasting over slow Rayleigh fading channels using network coding. In the proposed model, the network is treated as a collection of Rayleigh fading multiple access channels. In this…

Networking and Internet Architecture · Computer Science 2014-03-27 Avi Zanko , Amir Leshem , Ephraim Zehavi

Energy harvesting technique is a potential way for relay node energy supply in cooperative networks in terms of deployment flexibility and maintain charge reduction. Unlike traditional power source, relay node in this case may run out of…

Information Theory · Computer Science 2014-09-02 Tao Li , Pingyi Fan , Khaled Ben Letaief

We provide nonasymptotic upper and lower bounds on the sum-rate capacity of Rayleigh block-fading multiple-access channels for the setup where a priori channel state information is not available. The upper bound relies on a dual formula for…

Information Theory · Computer Science 2016-11-17 Rahul Devassy , Giuseppe Durisi , Johan Östman , Wei Yang , Tome Eftimov , Zoran Utkovski

In this paper, a lower bound on the capacity of wireless ad hoc erasure networks is derived in closed form in the canonical case where $n$ nodes are uniformly and independently distributed in the unit area square. The bound holds almost…

Information Theory · Computer Science 2009-01-15 Rayyan G. Jaber , Jeffrey G. Andrews

In the analysis of large random wireless networks, the underlying node distribution is almost ubiquitously assumed to be the homogeneous Poisson point process. In this paper, the node locations are assumed to form a Poisson clustered…

Information Theory · Computer Science 2010-10-11 RadhaKrishna Ganti , Martin Haenggi

In this work, novel upper and lower bounds for the capacity of channels with arbitrary constraints on the support of the channel input symbols are derived. As an immediate practical application, the case of multiple-input multiple-output…

Information Theory · Computer Science 2017-09-01 Alex Dytso , Mario Goldenbaum , Shlomo Shamai , H. Vincent Poor

Zhang et. al. recently derived upper and lower bounds on the achievable diversity of an N_R x N_T i.i.d. Rayleigh fading multiple antenna system using transmit antenna selection, spatial multiplexing and a linear receiver structure. For the…

Information Theory · Computer Science 2007-07-13 J. Jalden , B. Ottersten

We propose a simple and accurate method to evaluate the outage probability at the output of arbitrarily fading L-branch diversity combining receiver. The method is based on the saddlepoint approximation, which only requires the knowledge of…

Information Theory · Computer Science 2011-05-24 Mohammed Jabi , Leszek Szczecinski , Mustapha Benjillali

Motivated by the fact that full diversity order is achieved using the "best-relay" selection technique, we consider opportunistic amplify-and-forward and decode-and-forward relaying systems. We focus on the outage probability of such a…

Information Theory · Computer Science 2016-11-15 Ashkan Kalantari , Mohammadali Mohammadi , Mehrdad Ardebilipour

The parallel fading channel, which consists of finite number of subchannels, is very important, because it can be used to formulate many practical communication systems. The outage probability, on the other hand, is widely used to analyze…

Information Theory · Computer Science 2013-07-19 Bo Bai , Wei Chen , Khaled B. Letaief , Zhigang Cao

The statistical analysis of the fading End to End channel gain of the amplify and forward relaying protocol, however, is well known as extremely complex, and research work to date have only studied the asymptotic behaviour of the outage…

Information Theory · Computer Science 2016-04-22 Quoc Tuan Nguyen , D. T. Nguyen , Cong Lam Sinh

In this paper, the outage probability and outage-based beam design for multiple-input multiple-output (MIMO) interference channels are considered. First, closed-form expressions for the outage probability in MIMO interference channels are…

Information Theory · Computer Science 2016-11-17 Juho Park , Youngchul Sung , Donggun Kim , H. Vincent Poor

We derive a single-letter upper bound to the mismatched-decoding capacity for discrete memoryless channels. The bound is expressed as the mutual information of a transformation of the channel, such that a maximum-likelihood decoding error…

Information Theory · Computer Science 2021-02-16 Ehsan Asadi Kangarshahi , Albert Guillén i Fàbregas

The multiple-input and multiple-output (MIMO) technique is regarded as a promising approach to boost the throughput and reliability of optical fiber communications. However, the fundamental limits of optical fiber MIMO systems with finite…

Information Theory · Computer Science 2024-04-09 Xin Zhang , Dongfang Xu , Shenghui Song , Mérouane Debbah

Integer-forcing source coding has been proposed as a low-complexity method for compression of distributed correlated Gaussian sources. In this scheme, each encoder quantizes its observation using the same fine lattice and reduces the result…

Information Theory · Computer Science 2019-06-05 Elad Domanovitz , Uri Erez

This paper shows that the probability that the error exponent of a given code randomly generated from a pairwise independent ensemble being smaller than a lower bound on the typical random-coding exponent tends to zero as the codeword…

Information Theory · Computer Science 2022-04-04 Giuseppe Cocco , Albert Guillén i Fàbregas , Josep Font-Segura