2,035 research outputs found
On the Outage Capacity of Correlated Multiple-Path MIMO Channels
The use of multi-antenna arrays in both transmission and reception has been
shown to dramatically increase the throughput of wireless communication
systems. As a result there has been considerable interest in characterizing the
ergodic average of the mutual information for realistic correlated channels.
Here, an approach is presented that provides analytic expressions not only for
the average, but also the higher cumulant moments of the distribution of the
mutual information for zero-mean Gaussian (multiple-input multiple-output) MIMO
channels with the most general multipath covariance matrices when the channel
is known at the receiver. These channels include multi-tap delay paths, as well
as general channels with covariance matrices that cannot be written as a
Kronecker product, such as dual-polarized antenna arrays with general
correlations at both transmitter and receiver ends. The mathematical methods
are formally valid for large antenna numbers, in which limit it is shown that
all higher cumulant moments of the distribution, other than the first two scale
to zero. Thus, it is confirmed that the distribution of the mutual information
tends to a Gaussian, which enables one to calculate the outage capacity. These
results are quite accurate even in the case of a few antennas, which makes this
approach applicable to realistic situations.Comment: submitted for publication IEEE Trans. Information Theory; IEEEtran
documentstyl
Boltzmann meets Nash: Energy-efficient routing in optical networks under uncertainty
Motivated by the massive deployment of power-hungry data centers for service
provisioning, we examine the problem of routing in optical networks with the
aim of minimizing traffic-driven power consumption. To tackle this issue,
routing must take into account energy efficiency as well as capacity
considerations; moreover, in rapidly-varying network environments, this must be
accomplished in a real-time, distributed manner that remains robust in the
presence of random disturbances and noise. In view of this, we derive a pricing
scheme whose Nash equilibria coincide with the network's socially optimum
states, and we propose a distributed learning method based on the Boltzmann
distribution of statistical mechanics. Using tools from stochastic calculus, we
show that the resulting Boltzmann routing scheme exhibits remarkable
convergence properties under uncertainty: specifically, the long-term average
of the network's power consumption converges within of its
minimum value in time which is at most ,
irrespective of the fluctuations' magnitude; additionally, if the network
admits a strict, non-mixing optimum state, the algorithm converges to it -
again, no matter the noise level. Our analysis is supplemented by extensive
numerical simulations which show that Boltzmann routing can lead to a
significant decrease in power consumption over basic, shortest-path routing
schemes in realistic network conditions.Comment: 24 pages, 4 figure
- …