It is well known that queues with exponentially distributed service time have the smallest Shannon capacity among all single-server queues with the same service rate. However, the capacity of other service disiplines such as Gaussian service timing channels (GSTC) remains unknown. In this paper, we outline a preliminary investigation into timing channel capacity, when the service distributions ...

Introduction: Iilformation theory research has show1 that multiple transmit multiple receivc (MTMR) arrays can achieve enormous capacity gains over single-antenna systems by exploiting multipaths in the rich scattcring wircless channel [I , 21. Practical signalling schemes have been proposed which achieve a large fraction of the Shannon capacity, and one such scheme is the Bell Labs Layered Spa...

This paper is concerned with control of stochastic systems subject to finite communication channel capacity. Necessary conditions for reconstruction and stability of system outputs are derived using the Information Transmission theorem and the Shannon lower bound. These conditions are expressed in terms of the Shannon entropy rate and the distortion measure employed to describe reconstruction a...

We consider three capacity definitions for general channels with channel side information at the receiver, where the channel is modeled as a sequence of finite dimensional conditional distributions not necessarily stationary, ergodic, or information stable. The Shannon capacity is the highest rate asymptotically achievable with arbitrarily small error probability. The capacity versus outage is ...

The quantum capacity of thermal noise channel (which is addressed as Gaussian quantum channel before) is studied, it turns out to be the maximum of the coherent information of a single use of the channel. The quantum capacity is achieved when the input state is a thermal noise state with infinitive energy. The capacity is achievable with quantum error-correction code. The quantum capacities of ...

Our field has a rather remarkable history, in that it sprang almost fully fledged from the brow of one individual. In his original papers [1], Claude Shannon both posed the fundamental problems of information theory and also, to a large extent, answered them. Shannon's good news was this: for every memoryless channel there exists a parameter C, the channel capacity, such that the probability of...

We investigate the eeect of fading correlation and branch gain imbalance on the Shannon capacity of diversity systems in conjunction with adaptive transmission techniques. This capacity provides the theoretical upper bound for the spectral eeciency of adaptive transmission schemes. We obtain closed-form expressions for this capacity for Rayleigh fading channels under four adaptation policies: o...

Abstract—We consider the capacity of a narrowband point to point communication system employing multiple-element antenna arrays at both the transmitter and the receiver with covariance feedback. Under covariance feedback the receiver is assumed to have perfect Channel State Information (CSI) while at the transmitter the channel matrix is modeled as consisting of zero mean complex jointly Gaussi...

This paper considers the downlink traffic from a base station to two different clients. When assuming infinite backlog, it is known that inter-session network coding (INC) can significantly increase the throughput. However, the corresponding scheduling solution (when assuming dynamic arrivals instead and requiring bounded delay) is still nascent. For the 2-flow downlink scenario, we propose the...