English
Related papers

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

200 papers

This work considers a Poisson noise channel with an amplitude constraint. It is well-known that the capacity-achieving input distribution for this channel is discrete with finitely many points. We sharpen this result by introducing upper…

Information Theory · Computer Science 2021-07-30 Alex Dytso , Luca Barletta , Shlomo Shamai

In this article, we provide further asymptotic analysis to the higher-order statistics (HOS) of the channel capacity over generalized fading channels, especially by proposing simple and closed-form expressions each of which can be easily…

Information Theory · Computer Science 2019-10-18 Ferkan Yilmaz

In this article, we are proposing a closed-form solution for the capacity of the single quantum channel. The Gaussian distributed input has been considered for the analytical calculation of the capacity. In our previous couple of papers, we…

Information Theory · Computer Science 2023-02-17 Mouli Chakraborty , Harun Siljak , Indrakshi Dey , Nicola Marchetti

The per-sample zero-dispersion channel model of the optical fiber is considered. It is shown that capacity is uniquely achieved by an input probability distribution that has continuous uniform phase and discrete amplitude that takes on…

Information Theory · Computer Science 2018-09-25 Jihad Fahs , Aslan Tchamkerten , Mansoor I. Yousefi

The secrecy capacity of a discrete memoryless Gaussian Wire-Tap Channel when the input is from a finite complex constellation is studied. It is shown that the secrecy capacity curves of a finite constellation plotted against the SNR, for a…

Information Theory · Computer Science 2010-10-07 G. D. Raghava , B. Sundar Rajan

Consider a Gaussian relay network where a source node communicates to a destination node with the help of several layers of relays. Recent work has shown that compress-and-forward based strategies can achieve the capacity of this network…

Information Theory · Computer Science 2015-07-16 Ritesh Kolte , Ayfer Özgür , Abbas El Gamal

This work considers a binomial noise channel. The paper can be roughly divided into two parts. The first part is concerned with the properties of the capacity-achieving distribution. In particular, for the binomial channel, it is not known…

Information Theory · Computer Science 2024-01-24 Ian Zieder , Antonino Favano , Luca Barletta , Alex Dytso

Motivated by recent high bandwidth communication systems, Inter-Symbol Interference (ISI) channels with 1-bit quantized output are considered under an average-power-constrained continuous input. While the exact capacity is difficult to…

Information Theory · Computer Science 2015-05-05 Radha Krishna Ganti , Andrew Thangaraj , Arijit Mondal

We consider a model nondispersive nonlinear optical fiber channel with additive white Gaussian noise at large $\mathrm{SNR}$ (signal-to-noise ratio) in the intermediate power region. Using Feynman path-integral technique we for the first…

Information Theory · Computer Science 2016-05-06 I. S. Terekhov , A. V. Reznichenko , Ya. A. Kharkov , S. K. Turitsyn

This paper investigates the capacity of a communications channel that, in addition to additive white Gaussian noise, also suffers from interference caused by a co-existing radar transmission. The radar interference (of short duty-cycle and…

Information Theory · Computer Science 2018-10-16 Sara Shahi , Daniela Tuninetti , Natasha Devroye

The capacity of a wireless network is the maximum possible amount of simultaneous communication, taking interference into account. Formally, we treat the following problem. Given is a set of links, each a sender-receiver pair located in a…

Data Structures and Algorithms · Computer Science 2012-03-15 Magnús Már Halldórsson , Pradipta Mitra

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

This work explores how degrees of freedom (DoF) results from wireless networks can be translated into capacity results for their finite field counterparts that arise in network coding applications. The main insight is that scalar (SISO)…

Information Theory · Computer Science 2013-04-30 Sundar R. Krishnamurthy , Syed A. Jafar

New sufficient conditions for a vector Gaussian interference channel to achieve the sum-rate capacity by treating interference as noise are derived, which generalize the existing results. More concise conditions for…

Information Theory · Computer Science 2016-11-17 Xiaohu Shang , H. Vincent Poor

This work studies the secrecy-capacity of a scalar-Gaussian wiretap channel with an amplitude constraint on the input. It is known that for this channel, the secrecy-capacity-achieving distribution is discrete with finitely many points.…

Information Theory · Computer Science 2021-09-06 Luca Barletta , Alex Dytso

This paper derives an outer bound on the capacity region of a general memoryless interference channel with an arbitrary number of users. The derivation follows from a generalization of the techniques developed by Kramer and by Etkin et al…

Information Theory · Computer Science 2016-11-17 Daniela Tuninetti

This paper adds to the understanding of the capacity region of the Gaussian interference channel. To this end, the capacity region of the one-sided Gaussian interference channel is first fully characterized. This is accomplished by…

Information Theory · Computer Science 2015-09-22 Mojtaba Vaezi , H. Vincent Poor

The capacity and optimal signaling over a fixed Gaussian MIMO channel are considered under the joint total and per-antenna power constraints (TPC and PAC). While the general case remains an open problem, a closed-form full-rank solution is…

Information Theory · Computer Science 2018-09-05 Sergey Loyka

In this paper, the capacity of the oversampled Wiener phase noise (OWPN) channel is investigated. The OWPN channel is a discrete-time point-to-point channel with a multi-sample receiver in which the channel output is affected by both…

Information Theory · Computer Science 2020-01-22 Luca Barletta , Stefano Rini

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
‹ Prev 1 4 5 6 7 8 10 Next ›