English
Related papers

Related papers: Capacity Results on Multiple-Input Single-Output W…

200 papers

In this paper, we obtain a family of lower bounds for the sum capacity of Code Division Multiple Access (CDMA) channels assuming binary inputs and binary signature codes in the presence of additive noise with an arbitrary distribution. The…

Information Theory · Computer Science 2016-11-18 K. Alishahi , F. Marvasti , V. Aref , P. Pad

The capacity of the Gaussian cognitive interference channel, a variation of the classical two-user interference channel where one of the transmitters (referred to as cognitive) has knowledge of both messages, is known in several parameter…

Information Theory · Computer Science 2016-11-17 Stefano Rini , Daniela Tuninetti , Natasha Devroye

We study the amplitude-constrained additive white Gaussian noise channel. It is well known that the capacity-achieving input distribution for this channel is discrete and supported on finitely many points. The best known bounds show that…

Information Theory · Computer Science 2026-03-26 Haiyang Wang , Luca Barletta , Alex Dytso

We derive inner and outer bounds on the capacity region for a class of three-user partially connected interference channels. We focus on the impact of topology, interference alignment, and interplay between interference and noise. The…

Information Theory · Computer Science 2017-02-14 Muryong Kim , Yitao Chen , Sriram Vishwanath

The optimal performance of a communication network is limited not only by the quality of point-to-point channels, but by the efficacy of its constituent technologies. Understanding the limits of quantum networks requires an understanding of…

Quantum Physics · Physics 2022-07-13 Cillian Harney , Stefano Pirandola

We characterize the capacity of the general class of noncoherent underspread wide-sense stationary uncorrelated scattering (WSSUS) time-frequency-selective Rayleigh fading channels, under peak constraints in time and frequency and in time…

Information Theory · Computer Science 2016-11-17 Giuseppe Durisi , Helmut Bölcskei , Shlomo Shamai

The channel capacity theorem for additive white Gaussian noise channel (AWGN), widely known as the Shannon-Hartley Law, expresses the information capacity of a channel bandlimited in the conventional Fourier domain in terms of the…

Information Theory · Computer Science 2009-01-29 Kamalesh Kumar Sharma

The capacity of time-varying channels with periodic feedback at the transmitter is evaluated. It is assumed that the channel state information is perfectly known at the receiver and is fed back to the transmitter at the regular…

Information Theory · Computer Science 2007-07-13 Mehdi Ansari Sadrabadi , Mohammad Ali Maddah-Ali , Amir K. Khandani

We consider communication over a multiple-input single-output (MISO) block fading channel in the presence of an independent noiseless feedback link. We assume that the transmitter and receiver have no prior knowledge of the channel state…

Information Theory · Computer Science 2018-03-16 Jinyuan Chen

We consider a peak-power-limited single-antenna block-stationary Gaussian fading channel where neither the transmitter nor the receiver knows the channel state information, but both know the channel statistics. This model subsumes most…

Information Theory · Computer Science 2016-11-17 Jun Chen , Venugopal V. Veeravalli

We revisit Shannon's problem of bounding the capacity of bandlimited Gaussian channel (BLGC) with peak power constraint, and extend the problem to the peak-to-average-power-ratio (PAPR) constrained case. By lower bounding the achievable…

Information Theory · Computer Science 2018-08-31 Yizhu Wang , Jing Zhou , Wenyi Zhang

We consider symmetric two-user Gaussian interference channel with common messages. We derive an upper bound on the sum capacity, and show that the upper bound is tight in the low interference regime, where the optimal transmission scheme is…

Information Theory · Computer Science 2014-01-22 Quan Geng , Tie Liu

This paper presents a set of new results directly exploring the special characteristics of the wireless channel capacity process. An appealing finding is that, for typical fading channels, their instantaneous capacity and cumulative…

Information Theory · Computer Science 2017-05-11 Fengyou Sun , Yuming Jiang

This paper studies the capacity of discrete-time multipath fading channels. It is assumed that the number of paths is finite, i.e., that the channel output is influenced by the present and by the L previous channel inputs. A noncoherent…

Information Theory · Computer Science 2008-05-01 Tobias Koch , Amos Lapidoth

We investigate design and performance of communications over the bandlimited Gaussian channel with one-bit output quantization. A transceiver structure is proposed, which generates the channel input using a finite set of time-limited and…

Information Theory · Computer Science 2020-11-05 Rui Deng , Jing Zhou , Wenyi Zhang

A class of burst noise-erasure channels which incorporate both errors and erasures during transmission is studied. The channel, whose output is explicitly expressed in terms of its input and a stationary ergodic noise-erasure process, is…

Information Theory · Computer Science 2017-05-05 Lin Song , Fady Alajaji , Tamás Linder

In this paper, we study the capacity and degree-of-freedom (DoF) scaling for the continuous-time amplitude limited AWGN channels in radio frequency (RF) and intensity modulated optical communication (OC) channels. More precisely, we study…

Information Theory · Computer Science 2016-05-10 Saeid Haghighatshoar , Peter Jung , Giuseppe Caire

This paper studies the relaying strategies and the approximate capacity of the classic three-node Gaussian relay channel, but where the noises at the relay and at the destination are correlated. It is shown that the capacity of such a relay…

Information Theory · Computer Science 2011-10-25 Lei Zhou , Wei Yu

There is a fundamental limit on the capacity of fibre optical communication system (Shannon Limit). This limit can be potentially overcome via using Nonlinear Frequency Division Multiplexing. Dealing with noises in these systems is one of…

Information Theory · Computer Science 2017-11-28 Wen Qi Zhang , Tao Gui , Qun Zhang , Chao Lu , Tanya M. Monro , Terence H. Chan , Alan Pak Tao Lau , Shahraam Afshar

The capacity of a network in which a multiple access channel (MAC) generates interference to a single-user channel is studied. An achievable rate region based on superposition coding and joint decoding is established for the discrete case.…

Information Theory · Computer Science 2012-09-06 Fangfang Zhu , Xiaohu Shang , Biao Chen , H. Vincent Poor