46,849 research outputs found
On the Capacity of the Noncausal Relay Channel
This paper studies the noncausal relay channel, also known as the relay
channel with unlimited lookahead, introduced by El Gamal, Hassanpour, and
Mammen. Unlike the standard relay channel model, where the relay encodes its
signal based on the previous received output symbols, the relay in the
noncausal relay channel encodes its signal as a function of the entire received
sequence. In the existing coding schemes, the relay uses this noncausal
information solely to recover the transmitted message and then cooperates with
the sender to communicate this message to the receiver. However, it is shown in
this paper that by applying the Gelfand--Pinsker coding scheme, the relay can
take further advantage of the noncausally available information, which can
achieve strictly higher rates than existing coding schemes. This paper also
provides a new upper bound on the capacity of the noncausal relay that strictly
improves upon the cutset bound. These new lower and upper bounds on the
capacity coincide for the class of degraded noncausal relay channels and
establish the capacity for this class.Comment: To appear in the IEEE Transactions on Information Theor
Reduced-Dimension Linear Transform Coding of Correlated Signals in Networks
A model, called the linear transform network (LTN), is proposed to analyze
the compression and estimation of correlated signals transmitted over directed
acyclic graphs (DAGs). An LTN is a DAG network with multiple source and
receiver nodes. Source nodes transmit subspace projections of random correlated
signals by applying reduced-dimension linear transforms. The subspace
projections are linearly processed by multiple relays and routed to intended
receivers. Each receiver applies a linear estimator to approximate a subset of
the sources with minimum mean squared error (MSE) distortion. The model is
extended to include noisy networks with power constraints on transmitters. A
key task is to compute all local compression matrices and linear estimators in
the network to minimize end-to-end distortion. The non-convex problem is solved
iteratively within an optimization framework using constrained quadratic
programs (QPs). The proposed algorithm recovers as special cases the regular
and distributed Karhunen-Loeve transforms (KLTs). Cut-set lower bounds on the
distortion region of multi-source, multi-receiver networks are given for linear
coding based on convex relaxations. Cut-set lower bounds are also given for any
coding strategy based on information theory. The distortion region and
compression-estimation tradeoffs are illustrated for different communication
demands (e.g. multiple unicast), and graph structures.Comment: 33 pages, 7 figures, To appear in IEEE Transactions on Signal
Processin
Empirical Coordination with Two-Sided State Information and Correlated Source and State
The coordination of autonomous agents is a critical issue for decentralized
communication networks. Instead of transmitting information, the agents
interact in a coordinated manner in order to optimize a general objective
function. A target joint probability distribution is achievable if there exists
a code such that the sequences of symbols are jointly typical. The empirical
coordination is strongly related to the joint source-channel coding with
two-sided state information and correlated source and state. This problem is
also connected to state communication and is open for non-causal encoder and
decoder. We characterize the optimal solutions for perfect channel, for
lossless decoding, for independent source and channel, for causal encoding and
for causal decoding.Comment: 5 figures, 5 pages, presented at IEEE International Symposium on
Information Theory (ISIT) 201
Distributed video coding for wireless video sensor networks: a review of the state-of-the-art architectures
Distributed video coding (DVC) is a relatively new video coding architecture originated from two fundamental theorems namely, Slepian–Wolf and Wyner–Ziv. Recent research developments have made DVC attractive for applications in the emerging domain of wireless video sensor networks (WVSNs). This paper reviews the state-of-the-art DVC architectures with a focus on understanding their opportunities and gaps in addressing the operational requirements and application needs of WVSNs
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
- …