English
Related papers

Related papers: On the Capacity of Discrete-Time Laguerre Channel

200 papers

Channel capacity bounds are derived for a point-to-point indoor visible light communications (VLC) system with signal-dependent Gaussian noise. Considering both illumination and communication, the non-negative input of VLC is constrained by…

Information Theory · Computer Science 2020-11-03 Jin-Yuan Wang , Xian-Tao Fu , Rong-Rong Lu , Jun-Bo Wang , Min Lin , Julian Cheng

Capacity bounds for waveform channels under square-law detection of time-limited complex-valued signals are derived. The upper bound is the capacity of the channel under (complex-valued) coherent detection. The lower bound is one bit less,…

Information Theory · Computer Science 2021-05-31 Amir Tasbihi , Frank R. Kschischang

In this work, novel upper and lower bounds for the capacity of channels with arbitrary constraints on the support of the channel input symbols are derived. As an immediate practical application, the case of multiple-input multiple-output…

Information Theory · Computer Science 2017-09-01 Alex Dytso , Mario Goldenbaum , Shlomo Shamai , H. Vincent Poor

Previous work on ad hoc network capacity has focused primarily on source-destination throughput requirements for different models and transmission scenarios, with an emphasis on delay tolerant applications. In such problems, network…

Information Theory · Computer Science 2007-07-13 Cristina Comaniciu , H. Vincent Poor

We derive improved and easily computable upper bounds on the capacity of the discrete-time Poisson channel under an average-power constraint and an arbitrary constant dark current term. This is accomplished by combining a general convex…

Information Theory · Computer Science 2020-11-03 Mahdi Cheraghchi , João Ribeiro

A number of simplified models, based on perturbation theory, have been proposed for the fiber-optical channel and have been extensively used in the literature. Although these models are mainly developed for the low-power regime, they are…

Information Theory · Computer Science 2019-12-11 Kamran Keykhosravi , Giuseppe Durisi , Erik Agrell

Most diffusion based molecular channels suffer from low information capacity due to the structure of the diffusion environment. To address this issue, this paper studies the capacity of the diffusion based molecular communication by…

Information Theory · Computer Science 2020-06-25 Farhad Mirkarimi , Mahtab Mirmohseni , Masoumeh Nasiri-Kenari

Network capacity region is an important character of mobile ad hoc networks. Using cell-partitioned model, an expression of upper bound of delay-tolerant hybrid mobile ad hoc network is deduced regardless of coverage of base stations, types…

Networking and Internet Architecture · Computer Science 2014-04-08 Hu Li , Yuan`an Liu , Hefei Hu , Dongming Yuan , Sirui Duan

This work introduces capacity limits for molecular timing (MT) channels, where information is modulated in the release timing of small information particles, and decoded from the time of arrivals at the receiver. It is shown that the random…

Information Theory · Computer Science 2018-04-05 Nariman Farsad , Yonathan Murin , Andrew Eckford , Andrea Goldsmith

The capacity of a discrete-time memoryless channel, in which successive symbols fade independently, and where the channel state information (CSI) is neither available at the transmitter nor at the receiver, is considered at low SNR. We…

Information Theory · Computer Science 2008-01-04 Z. Rezki , David Haccoun , François Gagnon

This paper studies the capacity of a class of discrete memoryless interference channels where interference is defined analogous to that of Gaussian interference channel with one-sided weak interference. The sum-rate capacity of this class…

Information Theory · Computer Science 2013-03-11 Fangfang Zhu , Biao Chen

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

In this paper, the capacity of a diffusion based molecular communication network under the model of a Linear Time Invarient-Poisson (LTI-Poisson) channel is studied. Introduced in the context of molecular communication, the LTI-Poisson…

Information Theory · Computer Science 2014-10-17 Hamidreza Arjmandi , Gholamali Aminian , Amin Gohari , Masoumeh Nasiri Kenari , Urbashi Mitra

Flat-fading channels that are correlated in time are considered under peak and average power constraints. For discrete-time channels, a new upper bound on the capacity per unit time is derived. A low SNR analysis of a full-scattering vector…

Information Theory · Computer Science 2007-07-13 Vignesh Sethuraman , Bruce Hajek

In distributed communication, each transmitter prepares an ensemble of channel codes. To encode a message, a transmitter chooses a channel code individually without sharing the coding choice with other transmitters or with the receiver.…

Information Theory · Computer Science 2018-05-08 Yanru Tang , Faeze Heydaryan , Jie Luo

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

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

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

Optical wireless communication (OWC) using intensity-modulation and direct-detection (IM/DD) has a channel model which possesses unique features, due to the constraints imposed on the channel input. The aim of this tutorial is to overview…

Information Theory · Computer Science 2021-10-13 Anas Chaaban , Zouheir Rezki , Mohamed-Slim Alouini

The problem of decentralized detection in a sensor network subjected to a total average power constraint and all nodes sharing a common bandwidth is investigated. The bandwidth constraint is taken into account by assuming non-orthogonal…

Information Theory · Computer Science 2007-07-13 Sudharman K. Jayaweera
‹ Prev 1 2 3 10 Next ›