1,956 research outputs found
Piggybacking Codes for Network Coding: The High/Low SNR Regime
We propose a piggybacking scheme for network coding where strong source
inputs piggyback the weaker ones, a scheme necessary and sufficient to achieve
the cut-set upper bound at high/low-snr regime, a new asymptotically optimal
operational regime for the multihop Amplify and Forward (AF) networks
Analog network coding in general SNR regime: Performance of a greedy scheme
The problem of maximum rate achievable with analog network coding for a
unicast communication over a layered relay network with directed links is
considered. A relay node performing analog network coding scales and forwards
the signals received at its input. Recently this problem has been considered
under certain assumptions on per node scaling factor and received SNR.
Previously, we established a result that allows us to characterize the optimal
performance of analog network coding in network scenarios beyond those that can
be analyzed using the approaches based on such assumptions.
The key contribution of this work is a scheme to greedily compute a lower
bound to the optimal rate achievable with analog network coding in the general
layered networks. This scheme allows for exact computation of the optimal
achievable rates in a wider class of layered networks than those that can be
addressed using existing approaches. For the specific case of Gaussian N-relay
diamond network, to the best of our knowledge, the proposed scheme provides the
first exact characterization of the optimal rate achievable with analog network
coding. Further, for general layered networks, our scheme allows us to compute
optimal rates within a constant gap from the cut-set upper bound asymptotically
in the source power.Comment: 11 pages, 5 figures. Fixed an issue with the notation in the
statement and proof of Lemma 1. arXiv admin note: substantial text overlap
with arXiv:1204.2150 and arXiv:1202.037
Incremental Relaying for the Gaussian Interference Channel with a Degraded Broadcasting Relay
This paper studies incremental relay strategies for a two-user Gaussian
relay-interference channel with an in-band-reception and
out-of-band-transmission relay, where the link between the relay and the two
receivers is modelled as a degraded broadcast channel. It is shown that
generalized hash-and-forward (GHF) can achieve the capacity region of this
channel to within a constant number of bits in a certain weak relay regime,
where the transmitter-to-relay link gains are not unboundedly stronger than the
interference links between the transmitters and the receivers. The GHF relaying
strategy is ideally suited for the broadcasting relay because it can be
implemented in an incremental fashion, i.e., the relay message to one receiver
is a degraded version of the message to the other receiver. A
generalized-degree-of-freedom (GDoF) analysis in the high signal-to-noise ratio
(SNR) regime reveals that in the symmetric channel setting, each common relay
bit can improve the sum rate roughly by either one bit or two bits
asymptotically depending on the operating regime, and the rate gain can be
interpreted as coming solely from the improvement of the common message rates,
or alternatively in the very weak interference regime as solely coming from the
rate improvement of the private messages. Further, this paper studies an
asymmetric case in which the relay has only a single single link to one of the
destinations. It is shown that with only one relay-destination link, the
approximate capacity region can be established for a larger regime of channel
parameters. Further, from a GDoF point of view, the sum-capacity gain due to
the relay can now be thought as coming from either signal relaying only, or
interference forwarding only.Comment: To appear in IEEE Trans. on Inf. Theor
Joint Unitary Triangularization for MIMO Networks
This work considers communication networks where individual links can be
described as MIMO channels. Unlike orthogonal modulation methods (such as the
singular-value decomposition), we allow interference between sub-channels,
which can be removed by the receivers via successive cancellation. The degrees
of freedom earned by this relaxation are used for obtaining a basis which is
simultaneously good for more than one link. Specifically, we derive necessary
and sufficient conditions for shaping the ratio vector of sub-channel gains of
two broadcast-channel receivers. We then apply this to two scenarios: First, in
digital multicasting we present a practical capacity-achieving scheme which
only uses scalar codes and linear processing. Then, we consider the joint
source-channel problem of transmitting a Gaussian source over a two-user MIMO
channel, where we show the existence of non-trivial cases, where the optimal
distortion pair (which for high signal-to-noise ratios equals the optimal
point-to-point distortions of the individual users) may be achieved by
employing a hybrid digital-analog scheme over the induced equivalent channel.
These scenarios demonstrate the advantage of choosing a modulation basis based
upon multiple links in the network, thus we coin the approach "network
modulation".Comment: Submitted to IEEE Tran. Signal Processing. Revised versio
Multi-Source Cooperative Communication with Opportunistic Interference Cancelling Relays
In this paper we present a multi-user cooperative protocol for wireless
networks. Two sources transmit simultaneously their information blocks and
relays employ opportunistically successive interference cancellation (SIC) in
an effort to decode them. An adaptive decode/amplify-and-forward scheme is
applied at the relays to the decoded blocks or their sufficient statistic if
decoding fails. The main feature of the protocol is that SIC is exploited in a
network since more opportunities arise for each block to be decoded as the
number of used relays NRU is increased. This feature leads to benefits in terms
of diversity and multiplexing gains that are proven with the help of an
analytical outage model and a diversity-multiplexing tradeoff (DMT) analysis.
The performance improvements are achieved without any network synchronization
and coordination. In the final part of this work the closed-form outage
probability model is used by a novel approach for offline pre-selection of the
NRU relays, that have the best SIC performance, from a larger number of NR
nodes. The analytical results are corroborated with extensive simulations,
while the protocol is compared with orthogonal and multi-user protocols
reported in the literature.Comment: in IEEE Transactions on Communications, 201
- …