104 research outputs found
Bounds on the Capacity of the Relay Channel with Noncausal State at Source
We consider a three-terminal state-dependent relay channel with the channel
state available non-causally at only the source. Such a model may be of
interest for node cooperation in the framework of cognition, i.e.,
collaborative signal transmission involving cognitive and non-cognitive radios.
We study the capacity of this communication model. One principal problem is
caused by the relay's not knowing the channel state. For the discrete
memoryless (DM) model, we establish two lower bounds and an upper bound on
channel capacity. The first lower bound is obtained by a coding scheme in which
the source describes the state of the channel to the relay and destination,
which then exploit the gained description for a better communication of the
source's information message. The coding scheme for the second lower bound
remedies the relay's not knowing the states of the channel by first computing,
at the source, the appropriate input that the relay would send had the relay
known the states of the channel, and then transmitting this appropriate input
to the relay. The relay simply guesses the sent input and sends it in the next
block. The upper bound is non trivial and it accounts for not knowing the state
at the relay and destination. For the general Gaussian model, we derive lower
bounds on the channel capacity by exploiting ideas in the spirit of those we
use for the DM model; and we show that these bounds are optimal for small and
large noise at the relay irrespective to the strength of the interference.
Furthermore, we also consider a special case model in which the source input
has two components one of which is independent of the state. We establish a
better upper bound for both DM and Gaussian cases and we also characterize the
capacity in a number of special cases.Comment: Submitted to the IEEE Transactions on Information Theory, 54 pages, 6
figure
Bounds on the Capacity of the Relay Channel with Noncausal State Information at Source
We consider a three-terminal state-dependent relay channel with the channel
state available non-causally at only the source. Such a model may be of
interest for node cooperation in the framework of cognition, i.e.,
collaborative signal transmission involving cognitive and non-cognitive radios.
We study the capacity of this communication model. One principal problem in
this setup is caused by the relay's not knowing the channel state. In the
discrete memoryless (DM) case, we establish lower bounds on channel capacity.
For the Gaussian case, we derive lower and upper bounds on the channel
capacity. The upper bound is strictly better than the cut-set upper bound. We
show that one of the developed lower bounds comes close to the upper bound,
asymptotically, for certain ranges of rates.Comment: 5 pages, submitted to 2010 IEEE International Symposium on
Information Theor
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
Cooperative Relaying with State Available Non-Causally at the Relay
We consider a three-terminal state-dependent relay channel with the channel
state noncausally available at only the relay. Such a model may be useful for
designing cooperative wireless networks with some terminals equipped with
cognition capabilities, i.e., the relay in our setup. In the discrete
memoryless (DM) case, we establish lower and upper bounds on channel capacity.
The lower bound is obtained by a coding scheme at the relay that uses a
combination of codeword splitting, Gel'fand-Pinsker binning, and
decode-and-forward relaying. The upper bound improves upon that obtained by
assuming that the channel state is available at the source, the relay, and the
destination. For the Gaussian case, we also derive lower and upper bounds on
the capacity. The lower bound is obtained by a coding scheme at the relay that
uses a combination of codeword splitting, generalized dirty paper coding, and
decode-and-forward relaying; the upper bound is also better than that obtained
by assuming that the channel state is available at the source, the relay, and
the destination. In the case of degraded Gaussian channels, the lower bound
meets with the upper bound for some special cases, and, so, the capacity is
obtained for these cases. Furthermore, in the Gaussian case, we also extend the
results to the case in which the relay operates in a half-duplex mode.Comment: 62 pages. To appear in IEEE Transactions on Information Theor
Energy-Efficient Communication over the Unsynchronized Gaussian Diamond Network
Communication networks are often designed and analyzed assuming tight
synchronization among nodes. However, in applications that require
communication in the energy-efficient regime of low signal-to-noise ratios,
establishing tight synchronization among nodes in the network can result in a
significant energy overhead. Motivated by a recent result showing that
near-optimal energy efficiency can be achieved over the AWGN channel without
requiring tight synchronization, we consider the question of whether the
potential gains of cooperative communication can be achieved in the absence of
synchronization. We focus on the symmetric Gaussian diamond network and
establish that cooperative-communication gains are indeed feasible even with
unsynchronized nodes. More precisely, we show that the capacity per unit energy
of the unsynchronized symmetric Gaussian diamond network is within a constant
factor of the capacity per unit energy of the corresponding synchronized
network. To this end, we propose a distributed relaying scheme that does not
require tight synchronization but nevertheless achieves most of the energy
gains of coherent combining.Comment: 20 pages, 4 figures, submitted to IEEE Transactions on Information
Theory, presented at IEEE ISIT 201
Noisy Network Coding with Partial DF
In this paper, we propose a noisy network coding integrated with partial
decode-and-forward relaying for single-source multicast discrete memoryless
networks (DMN's). Our coding scheme generalizes the
partial-decode-compress-and-forward scheme (Theorem 7) by Cover and El Gamal.
This is the first time the theorem is generalized for DMN's such that each
relay performs both partial decode-and-forward and compress-and-forward
simultaneously. Our coding scheme simultaneously generalizes both noisy network
coding by Lim, Kim, El Gamal, and Chung and distributed decode-and-forward by
Lim, Kim, and Kim. It is not trivial to combine the two schemes because of
inherent incompatibility in their encoding and decoding strategies. We solve
this problem by sending the same long message over multiple blocks at the
source and at the same time by letting the source find the auxiliary covering
indices that carry information about the message simultaneously over all
blocks.Comment: 5 pages, 1 figure, to appear in Proc. IEEE ISIT 201
- …