1,881 research outputs found
Approaching Gaussian Relay Network Capacity in the High SNR Regime: End-to-End Lattice Codes
We present a natural and low-complexity technique for achieving the capacity
of the Gaussian relay network in the high SNR regime. Specifically, we propose
the use of end-to-end structured lattice codes with the amplify-and-forward
strategy, where the source uses a nested lattice code to encode the messages
and the destination decodes the messages by lattice decoding. All intermediate
relays simply amplify and forward the received signals over the network to the
destination. We show that the end-to-end lattice-coded amplify-and-forward
scheme approaches the capacity of the layered Gaussian relay network in the
high SNR regime. Next, we extend our scheme to non-layered Gaussian relay
networks under the amplify-and-forward scheme, which can be viewed as a
Gaussian intersymbol interference (ISI) channel. Compared with other schemes,
our approach is significantly simpler and requires only the end-to-end design
of the lattice precoding and decoding. It does not require any knowledge of the
network topology or the individual channel gains
Multiple Unicast Capacity of 2-Source 2-Sink Networks
We study the sum capacity of multiple unicasts in wired and wireless multihop
networks. With 2 source nodes and 2 sink nodes, there are a total of 4
independent unicast sessions (messages), one from each source to each sink node
(this setting is also known as an X network). For wired networks with arbitrary
connectivity, the sum capacity is achieved simply by routing. For wireless
networks, we explore the degrees of freedom (DoF) of multihop X networks with a
layered structure, allowing arbitrary number of hops, and arbitrary
connectivity within each hop. For the case when there are no more than two
relay nodes in each layer, the DoF can only take values 1, 4/3, 3/2 or 2, based
on the connectivity of the network, for almost all values of channel
coefficients. When there are arbitrary number of relays in each layer, the DoF
can also take the value 5/3 . Achievability schemes incorporate linear
forwarding, interference alignment and aligned interference neutralization
principles. Information theoretic converse arguments specialized for the
connectivity of the network are constructed based on the intuition from linear
dimension counting arguments.Comment: 6 pages, 7 figures, submitted to IEEE Globecom 201
On the Achievable Rates of Multihop Virtual Full-Duplex Relay Channels
We study a multihop "virtual" full-duplex relay channel as a special case of
a general multiple multicast relay network. For such channel,
quantize-map-and-forward (QMF) (or noisy network coding (NNC)) achieves the
cut-set upper bound within a constant gap where the gap grows {\em linearly}
with the number of relay stages . However, this gap may not be negligible
for the systems with multihop transmissions (i.e., a wireless backhaul
operating at higher frequencies). We have recently attained an improved result
to the capacity scaling where the gap grows {\em logarithmically} as ,
by using an optimal quantization at relays and by exploiting relays' messages
(decoded in the previous time slot) as side-information. In this paper, we
further improve the performance of this network by presenting a mixed scheme
where each relay can perform either decode-and-forward (DF) or QMF with
possibly rate-splitting. We derive the achievable rate and show that the
proposed scheme outperforms the QMF-optimized scheme. Furthermore, we
demonstrate that this performance improvement increases with .Comment: To be presented at ISIT 201
- …