22 research outputs found
Crystallization in large wireless networks
We analyze fading interference relay networks where M single-antenna
source-destination terminal pairs communicate concurrently and in the same
frequency band through a set of K single-antenna relays using half-duplex
two-hop relaying. Assuming that the relays have channel state information
(CSI), it is shown that in the large-M limit, provided K grows fast enough as a
function of M, the network "decouples" in the sense that the individual
source-destination terminal pair capacities are strictly positive. The
corresponding required rate of growth of K as a function of M is found to be
sufficient to also make the individual source-destination fading links converge
to nonfading links. We say that the network "crystallizes" as it breaks up into
a set of effectively isolated "wires in the air". A large-deviations analysis
is performed to characterize the "crystallization" rate, i.e., the rate (as a
function of M,K) at which the decoupled links converge to nonfading links. In
the course of this analysis, we develop a new technique for characterizing the
large-deviations behavior of certain sums of dependent random variables. For
the case of no CSI at the relay level, assuming amplify-and-forward relaying,
we compute the per source-destination terminal pair capacity for M,K converging
to infinity, with K/M staying fixed, using tools from large random matrix
theory.Comment: 30 pages, 6 figures, submitted to journal IEEE Transactions on
Information Theor
Asymptotic Capacity and Optimal Precoding Strategy of Multi-Level Precode & Forward in Correlated Channels
We analyze a multi-level MIMO relaying system where a multiple-antenna
transmitter sends data to a multipleantenna receiver through several relay
levels, also equipped with multiple antennas. Assuming correlated fading in
each hop, each relay receives a faded version of the signal transmitted by the
previous level, performs precoding on the received signal and retransmits it to
the next level. Using free probability theory and assuming that the noise power
at the relay levels - but not at the receiver - is negligible, a closed-form
expression of the end-to-end asymptotic instantaneous mutual information is
derived as the number of antennas in all levels grow large with the same rate.
This asymptotic expression is shown to be independent from the channel
realizations, to only depend on the channel statistics and to also serve as the
asymptotic value of the end-to-end average mutual information. We also provide
the optimal singular vectors of the precoding matrices that maximize the
asymptotic mutual information : the optimal transmit directions represented by
the singular vectors of the precoding matrices are aligned on the eigenvectors
of the channel correlation matrices, therefore they can be determined only
using the known statistics of the channel matrices and do not depend on a
particular channel realization.Comment: 5 pages, 3 figures, to be published in proceedings of IEEE
Information Theory Workshop 200
Performance Analysis of Optimal Single Stream Beamforming in MIMO Dual-Hop AF Systems
This paper investigates the performance of optimal single stream beamforming
schemes in multiple-input multiple-output (MIMO) dual-hop amplify-and-forward
(AF) systems. Assuming channel state information is not available at the source
and relay, the optimal transmit and receive beamforming vectors are computed at
the destination, and the transmit beamforming vector is sent to the transmitter
via a dedicated feedback link. Then, a set of new closed-form expressions for
the statistical properties of the maximum eigenvalue of the resultant channel
is derived, i.e., the cumulative density function (cdf), probability density
function (pdf) and general moments, as well as the first order asymptotic
expansion and asymptotic large dimension approximations. These analytical
expressions are then applied to study three important performance metrics of
the system, i.e., outage probability, average symbol error rate and ergodic
capacity. In addition, more detailed treatments are provided for some important
special cases, e.g., when the number of antennas at one of the nodes is one or
large, simple and insightful expressions for the key parameters such as
diversity order and array gain of the system are derived. With the analytical
results, the joint impact of source, relay and destination antenna numbers on
the system performance is addressed, and the performance of optimal beamforming
schemes and orthogonal space-time block-coding (OSTBC) schemes are compared.
Results reveal that the number of antennas at the relay has a great impact on
how the numbers of antennas at the source and destination contribute to the
system performance, and optimal beamforming not only achieves the same maximum
diversity order as OSTBC, but also provides significant power gains over OSTBC.Comment: to appear in IEEE Journal on Selected Areas in Communications special
issue on Theories and Methods for Advanced Wireless Relay
Throughput Scaling of Wireless Networks With Random Connections
This work studies the throughput scaling laws of ad hoc wireless networks in
the limit of a large number of nodes. A random connections model is assumed in
which the channel connections between the nodes are drawn independently from a
common distribution. Transmitting nodes are subject to an on-off strategy, and
receiving nodes employ conventional single-user decoding. The following results
are proven:
1) For a class of connection models with finite mean and variance, the
throughput scaling is upper-bounded by for single-hop schemes, and
for two-hop (and multihop) schemes.
2) The throughput scaling is achievable for a specific
connection model by a two-hop opportunistic relaying scheme, which employs
full, but only local channel state information (CSI) at the receivers, and
partial CSI at the transmitters.
3) By relaxing the constraints of finite mean and variance of the connection
model, linear throughput scaling is achievable with Pareto-type
fading models.Comment: 13 pages, 4 figures, To appear in IEEE Transactions on Information
Theor
Ergodic Capacity Analysis of Amplify-and-Forward MIMO Dual-Hop Systems
This paper presents an analytical characterization of the ergodic capacity of
amplify-and-forward (AF) MIMO dual-hop relay channels, assuming that the
channel state information is available at the destination terminal only. In
contrast to prior results, our expressions apply for arbitrary numbers of
antennas and arbitrary relay configurations. We derive an expression for the
exact ergodic capacity, simplified closed-form expressions for the high SNR
regime, and tight closed-form upper and lower bounds. These results are made
possible to employing recent tools from finite-dimensional random matrix theory
to derive new closed-form expressions for various statistical properties of the
equivalent AF MIMO dual-hop relay channel, such as the distribution of an
unordered eigenvalue and certain random determinant properties. Based on the
analytical capacity expressions, we investigate the impact of the system and
channel characteristics, such as the antenna configuration and the relay power
gain. We also demonstrate a number of interesting relationships between the
dual-hop AF MIMO relay channel and conventional point-to-point MIMO channels in
various asymptotic regimes.Comment: 40 pages, 9 figures, Submitted to to IEEE Transactions on Information
Theor