English
Related papers

Related papers: Noncoherent Capacity of Underspread Fading Channel…

200 papers

We investigate the delay limited secrecy capacity of the flat fading channel under two different assumptions on the available transmitter channel state information (CSI). The first scenario assumes perfect prior knowledge of both the main…

Information Theory · Computer Science 2016-11-17 Karim Khalil , O. Ozan Koyluoglu , Hesham El Gamal , Moustafa Youssef

We propose an iterative method for approximately computing the capacity of discrete memoryless channels, possibly under additional constraints on the input distribution. Based on duality of convex programming, we derive explicit upper and…

Information Theory · Computer Science 2015-04-06 Tobias Sutter , David Sutter , Peyman Mohajerin Esfahani , John Lygeros

Transmission of information over a discrete-time memoryless Rician fading channel is considered where neither the receiver nor the transmitter knows the fading coefficients. First the structure of the capacity-achieving input signals is…

Information Theory · Computer Science 2016-11-17 Mustafa Cenk Gursoy , H. Vincent Poor , Sergio Verdu

Quantum capacity, as the ultimate transmission rate of quantum communication, is characterized by regularized coherent information. In this work, we reformulate approximations of the quantum capacity by operator space norms and give both…

Quantum Physics · Physics 2019-11-06 Li Gao , Marius Junge , Nicholas LaRacuente

A deep understanding of the queuing performance of wireless networks is essential for the advancement of future wireless communications. The stochastic nature of wireless channels in general gives rise to a time varying transmission rate.…

Networking and Internet Architecture · Computer Science 2016-04-05 Sebastian Schiessl , Farshad Naghibi , Hussein Al-Zubaidy , Markus Fidler , James Gross

This paper investigates the maximal secrecy rate over a wiretap channel subject to reliability and secrecy constraints at a given blocklength. New achievability and converse bounds are derived, which are shown to be tighter than existing…

Information Theory · Computer Science 2016-01-25 Wei Yang , Rafael F. Schaefer , H. Vincent Poor

In this paper, capacity bounds for the two-user Interference Channel (IC) with cooperative receivers via conferencing links of finite capacities is investigated. The capacity results known for this communication scenario are limited to a…

Information Theory · Computer Science 2015-12-17 Reza K. Farsani , Amir K. Khandani

This paper investigates the limits of information transfer over a fast Rayleigh fading MIMO channel, where neither the transmitter nor the receiver has the knowledge of the channel state information (CSI) except the fading statistics. We…

Information Theory · Computer Science 2007-07-13 Rasika R Perera , Tony S Pollock , Thushara D Abhayapala

This paper investigates the capacity of a wireless two way relay channel in which two end nodes exchange information via a relay node. The capacity is defined in the information-theoretic sense as the maximum information exchange rate…

Information Theory · Computer Science 2008-04-22 Zhang Shengli , Soung Chang Liew

Wave propagation in complex media is a universal problem spanning optics, acoustics, mechanics, and condensed matter physics. While disorder usually causes strong scattering, recent theory predicts that a special class of correlated…

Soft Condensed Matter · Physics 2026-02-10 Angélique Campaniello , Rémi Carminati , Marcel Filoche , Emmanuel Fort

The concept of optimal communication channels shapes our understanding of wave-based communication. Its analysis, however, always pertains to specific communication-domain geometries, without a general theory of scaling laws or fundamental…

Information Theory · Computer Science 2022-05-12 Zeyu Kuang , David A. B. Miller , Owen D. Miller

This work considers distributed sensing and transmission of sporadic random samples. Lower bounds are derived for the reconstruction error of a single normally or uniformly-distributed finite-dimensional vector imperfectly measured by a…

Information Theory · Computer Science 2015-11-20 Ayşe Ünsal , Raymond Knopp

We investigate the capacity of the $Q$-frequency $S$-user vector adder channel (channel with intensity information) introduced by Chang and Wolf. Both coordinated and uncoordinated types of transmission are considered. Asymptotic (under the…

Information Theory · Computer Science 2014-01-10 Alexey Frolov , Pavel Rybin , Victor Zyablov

The problem of identification over a discrete memoryless wiretap channel is examined under the criterion of semantic effective secrecy. This secrecy criterion guarantees both the requirement of semantic secrecy and of stealthy…

Information Theory · Computer Science 2025-02-27 Abdalla Ibrahim , Johannes Rosenberger , Boulat A. Bash , Christian Deppe , Roberto Ferrara , Uzi Pereg

New capacity upper bounds are presented for the discrete-time Poisson channel with no dark current and an average-power constraint. These bounds are a simple consequence of techniques developed for the seemingly unrelated problem of upper…

Information Theory · Computer Science 2018-07-23 Mahdi Cheraghchi , João Ribeiro

This paper investigates the capacity scaling of multicell massive MIMO systems in the presence of spatially correlated fading. In particular, we focus on the strong spatial correlation regimes where the covariance matrix of each user…

Information Theory · Computer Science 2019-12-10 Junyoung Nam , Giuseppe Caire , Merouane Debbah , H. Vincent Poor

The transmission capacity of an ad-hoc network is the maximum density of active transmitters per unit area, given an outage constraint at each receiver for a fixed rate of transmission. Most prior work on finding the transmission capacity…

Information Theory · Computer Science 2010-09-09 Rahul Vaze , Kien T. Truong , Steven Weber , Robert W. Heath

This paper considers point to point secure communication over flat fading channels under an outage constraint. More specifically, we extend the definition of outage capacity to account for the secrecy constraint and obtain sharp…

Information Theory · Computer Science 2011-12-14 Onur Gungor , Jian Tan , C. Emre Koksal , Hesham El Gamal , Ness B. Shroff

Throughput capacity is a critical parameter for the design and evaluation of ad-hoc wireless networks. Consider n identical randomly located nodes, on a unit area, forming an ad-hoc wireless network. Assuming a fixed per node transmission…

Information Theory · Computer Science 2007-07-13 Rohit Negi , Arjunan Rajeswaran

Diffuse, multiple-scattered waves can be very efficient for information transfer through disordered media, provided that antenna arrays are used for both transmission and reception of signals. Information capacity C of a communication…

Data Analysis, Statistics and Probability · Physics 2007-05-23 S. E. Skipetrov