319 research outputs found
The Multi-way Relay Channel
The multiuser communication channel, in which multiple users exchange
information with the help of a relay terminal, termed the multi-way relay
channel (mRC), is introduced. In this model, multiple interfering clusters of
users communicate simultaneously, where the users within the same cluster wish
to exchange messages among themselves. It is assumed that the users cannot
receive each other's signals directly, and hence the relay terminal in this
model is the enabler of communication. In particular, restricted encoders,
which ignore the received channel output and use only the corresponding
messages for generating the channel input, are considered. Achievable rate
regions and an outer bound are characterized for the Gaussian mRC, and their
comparison is presented in terms of exchange rates in a symmetric Gaussian
network scenario. It is shown that the compress-and-forward (CF) protocol
achieves exchange rates within a constant bit offset of the exchange capacity
independent of the power constraints of the terminals in the network. A finite
bit gap between the exchange rates achieved by the CF and the
amplify-and-forward (AF) protocols is also shown. The two special cases of the
mRC, the full data exchange model, in which every user wants to receive
messages of all other users, and the pairwise data exchange model which
consists of multiple two-way relay channels, are investigated in detail. In
particular for the pairwise data exchange model, in addition to the proposed
random coding based achievable schemes, a nested lattice coding based scheme is
also presented and is shown to achieve exchange rates within a constant bit gap
of the exchange capacity.Comment: Revised version of our submission to the Transactions on Information
Theor
On the Capacity of the Two-user Gaussian Causal Cognitive Interference Channel
This paper considers the two-user Gaussian Causal Cognitive Interference
Channel (GCCIC), which consists of two source-destination pairs that share the
same channel and where one full-duplex cognitive source can causally learn the
message of the primary source through a noisy link. The GCCIC is an
interference channel with unilateral source cooperation that better models
practical cognitive radio networks than the commonly used model which assumes
that one source has perfect non-causal knowledge of the other source's message.
First the sum-capacity of the symmetric GCCIC is determined to within a
constant gap. Then, the insights gained from the derivation of the symmetric
sum-capacity are extended to characterize the whole capacity region to within a
constant gap for more general cases. In particular, the capacity is determined
(a) to within 2 bits for the fully connected GCCIC when, roughly speaking, the
interference is not weak at both receivers, (b) to within 2 bits for the
Z-channel, i.e., when there is no interference from the primary user, and (c)
to within 2 bits for the S-channel, i.e., when there is no interference from
the secondary user. The parameter regimes where the GCCIC is equivalent, in
terms of generalized degrees-of-freedom, to the noncooperative interference
channel (i.e., unilateral causal cooperation is not useful), to the non-causal
cognitive interference channel (i.e., causal cooperation attains the ultimate
limit of cognitive radio technology), and to bilateral source cooperation are
identified. These comparisons shed lights into the parameter regimes and
network topologies that in practice might provide an unbounded throughput gain
compared to currently available (non cognitive) technologies.Comment: Under second round review in IEEE Transactions in Information Theory
- Submitted September 201
Distributed space-time coding for two-way wireless relay networks
In this paper, we consider distributed space-time coding for two-way wireless relay networks, where communication between two terminals is assisted by relay nodes. Relaying protocols using two, three, and four time slots are proposed. The protocols using four time slots are the traditional amplify-and-forward (AF) and decode-and-forward (DF) protocols, which do not consider the property of the two-way traffic. A new class of relaying protocols, termed as partial decode-and-forward (PDF), is developed for the two time slots transmission, where each relay first removes part of the noise before sending the signal to the two terminals. Protocols using three time slots are proposed to compensate the fact that the two time slots protocols cannot make use of direct transmission between the two terminals. For all protocols, after processing their received signals, the relays encode the resulting signals using a distributed linear dispersion (LD) code. The proposed AF protocols are shown to achieve the diversity order of min{N,K}(1- (log log P/log P)), where N is the number of relays, P is the total power of the network, and K is the number of symbols transmitted during each time slot. When random unitary matrix is used for LD code, the proposed PDF protocols resemble random linear network coding, where the former operates on the unitary group and the latter works on the finite field. Moreover, PDF achieves the diversity order of min{N,K} but the conventional DF can only achieve the diversity order of 1. Finally, we find that two time slots protocols also have advantages over four-time-slot protocols in media access control (MAC) layer
- …