English
Related papers

Related papers: Capacity Bounds and Low-Complexity Constellation S…

200 papers

In this paper, we study two types of optical wireless channels under average-intensity constraints. One is called the Gaussian optical intensity channel, where the channel output models the converted electrical current corrupted by additive…

Information Theory · Computer Science 2025-04-02 Longguang Li

A class of cognitive interference channel with state is investigated, in which two transmitters (transmitters 1 and 2) communicate with two receivers (receivers 1 and 2) over an interference channel. The two transmitters jointly transmit a…

Information Theory · Computer Science 2012-07-10 Ruchen Duan Yingbin Liang

In this paper, we propose a geometric shaping (GS) strategy to design 8, 16, 32 and 64-ary modulation formats for the optical fibre channel impaired by both additive white Gaussian (AWGN) and phase noise. The constellations were optimised…

Information Theory · Computer Science 2021-02-03 Hubert Dzieciol , Gabriele Liga , Eric Sillekens , Polina Bayvel , Domaniç Lavery

Consider a Gaussian relay network where a number of sources communicate to a destination with the help of several layers of relays. Recent work has shown that a compress-and-forward based strategy at the relays can achieve the capacity of…

Information Theory · Computer Science 2013-04-30 Ritesh Kolte , Ayfer Özgür

Information transmission over discrete-time channels with memoryless additive noise obeying a Cauchy, rather than Gaussian, distribution, are studied. The channel input satisfies an average power constraint. Upper and lower bounds to such…

Information Theory · Computer Science 2024-11-19 Shuqin Pang , Wenyi Zhang

We consider the problem of estimating an upper bound on the capacity of a memoryless channel with unknown channel law and continuous output alphabet. A novel data-driven algorithm is proposed that exploits the dual representation of…

Information Theory · Computer Science 2024-01-25 Christian Häger , Erik Agrell

We consider a three-terminal state-dependent relay channel with the channel state available non-causally at only the source. Such a model may be of interest for node cooperation in the framework of cognition, i.e., collaborative signal…

Information Theory · Computer Science 2016-11-17 Abdellatif Zaidi , Shlomo Shamai , Pablo Piantanida , Luc Vandendorpe

Vendor interoperability is one of the desired future characteristics of optical networks. This means that the transmission system needs to support a variety of hardware with different components, leading to system uncertainties throughout…

Signal Processing · Electrical Eng. & Systems 2022-06-08 Ognjen Jovanovic , Metodi P. Yankov , Francesco Da Ros , Darko Zibar

In this paper, we propose an approach to numerically compute the feedback capacity of stationary finite dimensional Gaussian channels and construct (arbitrarily close to) capacity-achieving feedback codes. In particular, we first extend the…

Information Theory · Computer Science 2018-01-15 Chong Li , Nicola Elia

We study the capacity of discrete memoryless many-to-one interference channels, i.e., K user interference channels where only one receiver faces interference. For a class of many-to-one interference channels, we identify a noisy…

Information Theory · Computer Science 2009-12-17 Viveck R. Cadambe , Syed A. Jafar

An upper bound on the capacity of multiple-input multiple-output (MIMO) Gaussian fading channels is derived under peak amplitude constraints. The upper bound is obtained borrowing concepts from convex geometry and it extends to MIMO…

Information Theory · Computer Science 2021-11-29 Antonino Favano , Marco Ferrari , Maurizio Magarini , Luca Barletta

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

It is well known that the problem of computing the feedback capacity of a stationary Gaussian channel can be recast as an infinite-dimensional optimization problem; moreover, necessary and sufficient conditions for the optimality of a…

Information Theory · Computer Science 2018-01-10 Tao Liu , Guangyue Han

The two-user broadcast channel (BC) with receivers connected by bidirectional cooperation links of finite capacities, known as conferencing decoders, is considered. A novel capacity region outer bound is established based on multiple…

Information Theory · Computer Science 2025-08-12 Reza K. Farsani , Wei Yu

We address the classical capacity of a quantum bosonic memory channel with additive noise, subject to an input energy constraint. The memory is modeled by correlated noise emerging from a Gauss-Markov process. Under reasonable assumptions,…

Quantum Physics · Physics 2009-12-08 Joachim Schäfer , David Daems , Evgueni Karpov , Nicolas J. Cerf

We study the maximum achievable differential entropy at the output of a system assigning to each input X the sum X+N, with N a given noise with probability law absolutely continuous with respect to the Lebesgue measure and where the input…

Optimization and Control · Mathematics 2016-02-04 Francisco J. Piera

There have been several upper bounds on the quantum capacity of the single-mode Gaussian channels with thermal noise, such as thermal attenuator and amplifier. We consider a class of attenuator and amplifier with more general noises,…

Quantum Physics · Physics 2019-05-21 Youngrong Lim , Soojoon Lee , Jaewan Kim , Kabgyun Jeong

We consider the problem of estimating convex boundaries from blurred and noisy observations. In our model, the convolution of an intensity function $f$ is observed with additive Gaussian white noise. The function $f$ is assumed to have…

Statistics Theory · Mathematics 2007-06-13 Alexander Goldenshluger , Assaf Zeevi

While the channel capacity reflects a theoretical upper bound on the achievable information transmission rate in the limit of infinitely many bits, it does not characterise the information transfer of a given encoding routine with finitely…

Neurons and Cognition · Quantitative Biology 2017-04-05 Sebastian Weichwald , Tatiana Fomina , Bernhard Schölkopf , Moritz Grosse-Wentrup

Non-orthogonal communications play an important role in future communication architectures. In such scenarios, the received signal is corrupted by an interfering signal which is typically cyclostationary in continuous-time. If the period of…

Information Theory · Computer Science 2019-10-18 Nir Shlezinger , Emeka Abakasanga , Ron Dabora , Yonina C. Eldar
‹ Prev 1 3 4 5 6 7 10 Next ›