10,482 research outputs found
Slepian-Wolf Coding Over Cooperative Relay Networks
This paper deals with the problem of multicasting a set of discrete
memoryless correlated sources (DMCS) over a cooperative relay network.
Necessary conditions with cut-set interpretation are presented. A \emph{Joint
source-Wyner-Ziv encoding/sliding window decoding} scheme is proposed, in which
decoding at each receiver is done with respect to an ordered partition of other
nodes. For each ordered partition a set of feasibility constraints is derived.
Then, utilizing the sub-modular property of the entropy function and a novel
geometrical approach, the results of different ordered partitions are
consolidated, which lead to sufficient conditions for our problem. The proposed
scheme achieves operational separation between source coding and channel
coding. It is shown that sufficient conditions are indeed necessary conditions
in two special cooperative networks, namely, Aref network and finite-field
deterministic network. Also, in Gaussian cooperative networks, it is shown that
reliable transmission of all DMCS whose Slepian-Wolf region intersects the
cut-set bound region within a constant number of bits, is feasible. In
particular, all results of the paper are specialized to obtain an achievable
rate region for cooperative relay networks which includes relay networks and
two-way relay networks.Comment: IEEE Transactions on Information Theory, accepte
Joint Source-Channel Cooperative Transmission over Relay-Broadcast Networks
Reliable transmission of a discrete memoryless source over a multiple-relay
relay-broadcast network is considered. Motivated by sensor network
applications, it is assumed that the relays and the destinations all have
access to side information correlated with the underlying source signal. Joint
source-channel cooperative transmission is studied in which the relays help the
transmission of the source signal to the destinations by using both their
overheard signals, as in the classical channel cooperation scenario, as well as
the available correlated side information. Decode-and-forward (DF) based
cooperative transmission is considered in a network of multiple relay terminals
and two different achievability schemes are proposed: i) a regular encoding and
sliding-window decoding scheme without explicit source binning at the encoder,
and ii) a semi-regular encoding and backward decoding scheme with binning based
on the side information statistics. It is shown that both of these schemes lead
to the same source-channel code rate, which is shown to be the "source-channel
capacity" in the case of i) a physically degraded relay network in which the
side information signals are also degraded in the same order as the channel;
and ii) a relay-broadcast network in which all the terminals want to
reconstruct the source reliably, while at most one of them can act as a relay.Comment: Submitted to IEEE Transactions on Information Theory, 201
On Joint Source-Channel Coding for Correlated Sources Over Multiple-Access Relay Channels
We study the transmission of correlated sources over discrete memoryless (DM)
multiple-access-relay channels (MARCs), in which both the relay and the
destination have access to side information arbitrarily correlated with the
sources. As the optimal transmission scheme is an open problem, in this work we
propose a new joint source-channel coding scheme based on a novel combination
of the correlation preserving mapping (CPM) technique with Slepian-Wolf (SW)
source coding, and obtain the corresponding sufficient conditions. The proposed
coding scheme is based on the decode-and-forward strategy, and utilizes CPM for
encoding information simultaneously to the relay and the destination, whereas
the cooperation information from the relay is encoded via SW source coding. It
is shown that there are cases in which the new scheme strictly outperforms the
schemes available in the literature. This is the first instance of a
source-channel code that uses CPM for encoding information to two different
nodes (relay and destination). In addition to sufficient conditions, we present
three different sets of single-letter necessary conditions for reliable
transmission of correlated sources over DM MARCs. The newly derived conditions
are shown to be at least as tight as the previously known necessary conditions.Comment: Accepted to TI
Lossy Source Transmission over the Relay Channel
Lossy transmission over a relay channel in which the relay has access to
correlated side information is considered. First, a joint source-channel
decode-and-forward scheme is proposed for general discrete memoryless sources
and channels. Then the Gaussian relay channel where the source and the side
information are jointly Gaussian is analyzed. For this Gaussian model, several
new source-channel cooperation schemes are introduced and analyzed in terms of
the squared-error distortion at the destination. A comparison of the proposed
upper bounds with the cut-set lower bound is given, and it is seen that joint
source-channel cooperation improves the reconstruction quality significantly.
Moreover, the performance of the joint code is close to the lower bound on
distortion for a wide range of source and channel parameters.Comment: Proceedings of the 2008 IEEE International Symposium on Information
Theory, Toronto, ON, Canada, July 6 - 11, 200
- …