English
Related papers

Related papers: Poisson channel with binary Markov input and avera…

200 papers

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

Motivated by results in optical communications, where the performance can degrade dramatically if the transmit power is sufficiently increased, the channel capacity is characterized for various kinds of memoryless vector channels. It is…

Information Theory · Computer Science 2015-03-20 Erik Agrell

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

Recently, we described a pathway analysis technique (paper 1) for analyzing generic schemes for single-molecule kinetics based upon the first-passage time distribution. Here, we employ this method to derive expressions for the Poisson…

Biological Physics · Physics 2017-03-03 Thomas Avila , D. Evan Piephoff , Jianshu Cao

This paper introduces a general theoretical framework to analyze noise limited networks. More precisely, we consider two homogenous Poisson point processes of base stations and users. General model of radio signal propagation and effect of…

Probability · Mathematics 2010-12-13 Laurent Decreusefond , Philippe Martins , Thanh-Tung Vu

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

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 cooperative medium access control (CoopMAC) network with randomly distributed helpers is considered. We introduce a new helper selection scheme which maximizes the average throughput while maintaining a low power consumption profile in…

Networking and Internet Architecture · Computer Science 2016-12-14 Masoumeh Sadeghi , Homa Nikbakht , Amir Masoud Rabiei , Vahid Shah-Mansouri

In random access protocols, the service rate depends on the number of stations with a packet buffered for transmission. We demonstrate via numerical analysis that this state-dependent rate along with the consideration of Poisson traffic and…

Networking and Internet Architecture · Computer Science 2014-05-23 Cristina Cano , David Malone

Neural noise sets a limit to information transmission in sensory systems. In several areas, the spiking response (to a repeated stimulus) has shown a higher degree of regularity than predicted by a Poisson process. However, a simple model…

Neurons and Cognition · Quantitative Biology 2018-01-08 Ulisse Ferrari , Stephane Deny , Olivier Marre , Thierry Mora

We propose a model for heterogeneous cellular networks assuming a space-time Poisson process of call arrivals, independently marked by data volumes, and served by different types of base stations (having different transmission powers)…

Networking and Internet Architecture · Computer Science 2015-10-15 Bartlomiej Blaszczyszyn , Miodrag Jovanovic , Mohamed Kadhem Karray

Impact of mobility will be increasingly important in future generation wireless services and the related challenges will need to be addressed. Sojourn time, the time duration that a mobile user stays within a cell, is a mobility-aware…

Information Theory · Computer Science 2020-01-08 Mohammad Salehi , Ekram Hossain

Results are presented for optimizing device-to-device communications in cellular networks, while maintaining spectral efficiency of the base-station-to-device downlink channel. We build upon established and tested stochastic geometry models…

Networking and Internet Architecture · Computer Science 2017-05-04 Bartłomiej Błaszczyszyn , Paul Keeler , Paul Mühlethaler

This paper deals with the secrecy capacity of the radio channel in interference-limited regime. We assume that interferers are uniformly scattered over the network area according to a Point Poisson Process and the channel model consists of…

Information Theory · Computer Science 2015-06-23 Hirley Alves , Carlos H. M. de Lima , Pedro. H. J. Nardelli , Richard Demo Souza , Matti Latva-aho

We investigate how to exploit intermittent feedback for interference management. Focusing on the two-user linear deterministic interference channel, we completely characterize the capacity region. We find that the characterization only…

Information Theory · Computer Science 2016-11-17 Can Karakus , I-Hsiang Wang , Suhas Diggavi

Achievable rate regions and outer bounds are derived for three-user interference channels where the transmitters cooperate in a unidirectional manner via a noncausal message-sharing mechanism. The three-user channel facilitates different…

Information Theory · Computer Science 2016-11-17 K. G. Nagananda , Parthajit Mohapatra , Chandra R. Murthy , Shalinee Kishore

In many wireless communication systems, radios are subject to a duty cycle constraint, that is, a radio only actively transmits signals over a fraction of the time. For example, it is desirable to have a small duty cycle in some low power…

Information Theory · Computer Science 2012-09-24 Lei Zhang , Hui Li , Dongning Guo

In a circuit-switched network, traffic can be characterized by several factors that define how communication resources are allocated and utilized during a connection. The amount of traffic basically determines how frequently connection…

Networking and Internet Architecture · Computer Science 2025-03-19 Paresh Upadhyay , Yatindra Nath Singh

Consider a pair of input distributions which after passing through a Poisson channel become $\epsilon$-close in total variation. We show that they must necessarily then be $\epsilon^{0.5+o(1)}$-close after passing through a Gaussian channel…

Information Theory · Computer Science 2023-06-30 Anzo Teh , Yury Polyanskiy

We present rigorous results for the mean first passage time and first passage time statistics for two-channel Markov additive diffusion in a 3-dimensional spherical domain. Inspired by biophysical examples we assume that the particle can…

Statistical Mechanics · Physics 2017-02-01 Aljaz Godec , Ralf Metzler