English
Related papers

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

200 papers

This paper analyzes the fundamental trade-offs that occur in the co-design of pilot resource allocations in orthogonal frequency-division multiplexing signals for both ranging (via time-of-arrival estimation) and communications. These…

Signal Processing · Electrical Eng. & Systems 2024-01-31 Andrew Graff , Todd E. Humphreys

This paper investigates point-to-point information transmission over a wideband slow-fading channel, modeled as an (asymptotically) large number of independent identically distributed parallel channels, with the random channel fading…

Information Theory · Computer Science 2007-10-02 Wenyi Zhang , Urbashi Mitra

We develop several analytical lower bounds on the capacity of binary insertion and deletion channels by considering independent uniformly distributed (i.u.d.) inputs and computing lower bounds on the mutual information between the input and…

Information Theory · Computer Science 2015-03-17 Mojtaba Rahmati , Tolga M. Duman

Caching at the edge of wireless networks is a keytechnology to reduce traffic in the backhaul link. However, aconcentrated amount of requests during peak-periods may causethe outage of the system, meaning that the network is not ableto…

Networking and Internet Architecture · Computer Science 2021-01-05 Estefanía Recayte , Andrea Munari

In this work we show how an improved lower bound to the error exponent of the memoryless multiple-access (MAC) channel is attained via the use of linear codes, thus demonstrating that structure can be beneficial even in cases where there is…

Information Theory · Computer Science 2016-11-18 Eli Haim , Yuval Kochman , Uri Erez

We consider the problem of minimizing upper bounds and maximizing lower bounds on information rates of stationary and ergodic discrete-time channels with memory. The channels we consider can have a finite number of states, such as partial…

Information Theory · Computer Science 2016-11-17 Parastoo Sadeghi , Pascal O. Vontobel , Ramtin Shams

We present a novel closed-form lower bound on the Gaussian-input mutual information for noncoherent communication (i.e., in which neither transmitter nor receiver are cognizant of the fading state) over a frequency-flat fading channel with…

Information Theory · Computer Science 2018-04-20 Adriano Pastore

In this paper we consider the identification (ID) via multiple access channels (MACs). In the general MAC the ID capacity region includes the ordinary transmission (TR) capacity region. In this paper we discuss the converse coding theorem.…

Information Theory · Computer Science 2013-02-12 Yasutada Oohama

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

Ong and Ho developed optimal linear index codes for single uniprior index coding problems (ICPs) by finding a spanning tree for each of the strongly connected components of the corresponding information-flow graphs, following which Thomas…

Information Theory · Computer Science 2024-07-23 Anjana A Mahesh , Charul Rajput , Bobbadi Rupa , B. Sundar Rajan

In the first part of this two-part letter, we introduced methods to study the impact of dependency on the expected value of functions of two random variables. In this second part, we present tools to derive worst- and best-case bounds on…

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

This paper investigates the performance of wireless systems that employ finite-blocklength channel codes for transmission and operate under queueing constraints in the form of limitations on buffer overflow probabilities. A block fading…

Information Theory · Computer Science 2010-10-01 Deli Qiao , Mustafa Cenk Gursoy , Senem Velipasalar

Performance assessment and optimization for networks jointly performing caching, computing, and communication (3C) has recently drawn significant attention because many emerging applications require 3C functionality. However, studies in the…

Information Theory · Computer Science 2022-06-09 Ming-Chun Lee , Andreas F. Molisch

We consider the massive Multiple Input Multiple Output (MIMO) diversity channel affected by independent and identically distributed Rayleigh fading, with linear processing at both transmitter and receiver sides, and analyze the outage…

Information Theory · Computer Science 2023-02-08 Marco Martalo , Riccardo Raheli

This paper investigates the problem of single-source multicasting over a communication network in the presence of restricted adversaries. When the adversary is constrained to operate only on a prescribed subset of edges, classical cut-set…

Information Theory · Computer Science 2026-03-10 Christopher Hojny , Altan B. Kılıç , Sascha Kurz , Alberto Ravagnani

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

In this paper, new classes of lower bounds on the outage error probability and on the mean-square-error (MSE) in Bayesian parameter estimation are proposed. The minima of the h-outage error probability and the MSE are obtained by the…

Information Theory · Computer Science 2010-05-05 Routtenberg Tirza , Joseph Tabrikian

Characterizing the performance trade-offs between sensing and communication subsystems is essential for enabling integrated sensing and communication systems. Various metrics exist for each subsystem; however, this study focuses on the…

Cooperative cognitive radio networks are investigated by using an information-theoretic approach. This approach consists of interpreting the decision process carried out at the fusion center as a binary (asymmetric) channel, whose input is…

Information Theory · Computer Science 2010-08-02 Giorgio Taricco

For OFDMA systems, we find a rough but easily computed upper bound for the probability of loosing communications by insufficient number of sub-channels on downlink. We consider as random the positions of receiving users in the system as…

Probability · Mathematics 2007-07-25 Laurent Decreusefond , Eduardo Ferraz , Philippe Martins