Related papers: Ultimate capacity limit of a multi-span link with …
A new channel coding approach was proposed in [1] for random multiple access communication over the discrete-time memoryless channel. The coding approach allows users to choose their communication rates independently without sharing the…
Sensor nodes with energy harvesting sources are gaining popularity due to their ability to improve the network life time and are becoming a preferred choice supporting `green communication'. We study such a sensor node with an energy…
We extend Shannon's result on the capacity of channels with state information to multiple user channels. More specifically, we characterize the capacity (region) of degraded broadcast channels and physically degraded relay channels where…
In this paper, firstly, the Shannon channel capacity formula is briefly stated, and the relationship between the formula and the signal uncertainty principle is analyzed in order to prepare for deriving the formula which is able to break…
This work addresses the problem of evaluating optimal link capacities of a packet-flow network for the objective of congestion minimization. We present a simple model of packet flow in networks and present a numerical approach to evaluate…
New sufficient conditions for determining in closed form the capacity region of point-to-point memoryless two-way channels (TWCs) are derived. The proposed conditions not only relax Shannon's condition which can identify only TWCs with a…
This article serves as a brief introduction to the Shannon information theory. Concepts of information, Shannon entropy and channel capacity are mainly covered. All these concepts are developed in a totally combinatorial flavor. Some issues…
This paper concerns the capacity of the discrete noiseless channel introduced by Shannon. A sufficient condition is given for the capacity to be well-defined. For a general discrete noiseless channel allowing non-integer valued symbol…
Network life time maximization is becoming an important design goal in wireless sensor networks. Energy harvesting has recently become a preferred choice for achieving this goal as it provides near perpetual operation. We study such a…
We consider the communication channel given by a fiber optical transmission line. We develop a method to perturbatively calculate the information capacity of a nonlinear channel, given the corresponding evolution equation. Using this…
The maximum rates for reliably transmitting classical information over Bosonic multiple-access channels (MACs) are derived when the transmitters are restricted to coherent-state encodings. Inner and outer bounds for the ultimate capacity…
We study the performance of uplink transmission in a large-scale (massive) MIMO system, where all the transmitters have single antennas and the base station has a large number of antennas. Specifically, we first derive the rates that are…
We study the problem of communicating over a discrete memoryless two-way channel using non-adaptive schemes, under a zero probability of error criterion. We derive single-letter inner and outer bounds for the zero-error capacity region,…
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…
We show that the detection sensitivity of a linear detector is lower bounded by some quantum limits. For the force detection, relevant for atomic force microscopes, the lower bound is given by the so-called ultimate quantum limit. For the…
We present shape-independent upper limits to the power--bandwidth product for a single resonance in an optical scatterer, with the bound depending only on the material susceptibility. We show that quasistatic metallic scatterers can nearly…
We establish an upper bound on the noncoherent capacity pre-log of temporally correlated block-fading single-input multiple-output (SIMO) channels. The upper bound matches the lower bound recently reported in Riegler et al. (2011), and,…
We investigate the achievable rate and capacity of a non-perfect photon-counting receiver. For the case of long symbol duration, the achievable rate under on-off keying modulation is investigated based on Kullback-Leibler (KL) divergence…
We consider the Shannon cipher system in a setting where the secret key is delivered to the legitimate receiver via a channel with limited capacity. For this setting, we characterize the achievable region in the space of three figures of…
Quantum information processing technology offers several communication strategies, which offer capacity advantages over classical technologies. However, advantages typically arise only in very particular communication scenarios which are of…