1,882 research outputs found
Recovering Multiplexing Loss Through Successive Relaying Using Repetition Coding
In this paper, a transmission protocol is studied for a two relay wireless
network in which simple repetition coding is applied at the relays.
Information-theoretic achievable rates for this transmission scheme are given,
and a space-time V-BLAST signalling and detection method that can approach them
is developed. It is shown through the diversity multiplexing tradeoff analysis
that this transmission scheme can recover the multiplexing loss of the
half-duplex relay network, while retaining some diversity gain. This scheme is
also compared with conventional transmission protocols that exploit only the
diversity of the network at the cost of a multiplexing loss. It is shown that
the new transmission protocol offers significant performance advantages over
conventional protocols, especially when the interference between the two relays
is sufficiently strong.Comment: To appear in the IEEE Transactions on Wireless Communication
Cooperative Compute-and-Forward
We examine the benefits of user cooperation under compute-and-forward. Much
like in network coding, receivers in a compute-and-forward network recover
finite-field linear combinations of transmitters' messages. Recovery is enabled
by linear codes: transmitters map messages to a linear codebook, and receivers
attempt to decode the incoming superposition of signals to an integer
combination of codewords. However, the achievable computation rates are low if
channel gains do not correspond to a suitable linear combination. In response
to this challenge, we propose a cooperative approach to compute-and-forward. We
devise a lattice-coding approach to block Markov encoding with which we
construct a decode-and-forward style computation strategy. Transmitters
broadcast lattice codewords, decode each other's messages, and then
cooperatively transmit resolution information to aid receivers in decoding the
integer combinations. Using our strategy, we show that cooperation offers a
significant improvement both in the achievable computation rate and in the
diversity-multiplexing tradeoff.Comment: submitted to IEEE Transactions on Information Theor
Multi-Antenna Cooperative Wireless Systems: A Diversity-Multiplexing Tradeoff Perspective
We consider a general multiple antenna network with multiple sources,
multiple destinations and multiple relays in terms of the
diversity-multiplexing tradeoff (DMT). We examine several subcases of this most
general problem taking into account the processing capability of the relays
(half-duplex or full-duplex), and the network geometry (clustered or
non-clustered). We first study the multiple antenna relay channel with a
full-duplex relay to understand the effect of increased degrees of freedom in
the direct link. We find DMT upper bounds and investigate the achievable
performance of decode-and-forward (DF), and compress-and-forward (CF)
protocols. Our results suggest that while DF is DMT optimal when all terminals
have one antenna each, it may not maintain its good performance when the
degrees of freedom in the direct link is increased, whereas CF continues to
perform optimally. We also study the multiple antenna relay channel with a
half-duplex relay. We show that the half-duplex DMT behavior can significantly
be different from the full-duplex case. We find that CF is DMT optimal for
half-duplex relaying as well, and is the first protocol known to achieve the
half-duplex relay DMT. We next study the multiple-access relay channel (MARC)
DMT. Finally, we investigate a system with a single source-destination pair and
multiple relays, each node with a single antenna, and show that even under the
idealistic assumption of full-duplex relays and a clustered network, this
virtual multi-input multi-output (MIMO) system can never fully mimic a real
MIMO DMT. For cooperative systems with multiple sources and multiple
destinations the same limitation remains to be in effect.Comment: version 1: 58 pages, 15 figures, Submitted to IEEE Transactions on
Information Theory, version 2: Final version, to appear IEEE IT, title
changed, extra figures adde
Cooperative Multiplexing in the Multiple Antenna Half Duplex Relay Channel
Cooperation between terminals has been proposed to improve the reliability
and throughput of wireless communication. While recent work has shown that
relay cooperation provides increased diversity, increased multiplexing gain
over that offered by direct link has largely been unexplored. In this work we
show that cooperative multiplexing gain can be achieved by using a half duplex
relay. We capture relative distances between terminals in the high SNR
diversity multiplexing tradeoff (DMT) framework. The DMT performance is then
characterized for a network having a single antenna half-duplex relay between a
single-antenna source and two-antenna destination. Our results show that the
achievable multiplexing gain using cooperation can be greater than that of the
direct link and is a function of the relative distance between source and relay
compared to the destination. Moreover, for multiplexing gains less than 1, a
simple scheme of the relay listening 1/3 of the time and transmitting 2/3 of
the time can achieve the 2 by 2 MIMO DMT.Comment: 5 pages, 5 figures submitted to ISIT 200
Cooperative Cognitive Relaying Under Primary and Secondary Quality of Service Satisfaction
This paper proposes a new cooperative protocol which involves cooperation
between primary and secondary users. We consider a cognitive setting with one
primary user and multiple secondary users. The time resource is partitioned
into discrete time slots. Each time slot, a secondary user is scheduled for
transmission according to time division multiple access, and the remainder of
the secondary users, which we refer to as secondary relays, attempt to decode
the primary packet. Afterwards, the secondary relays employ cooperative
beamforming to forward the primary packet and to provide protection to the
secondary destination of the secondary source scheduled for transmission from
interference. We characterize the diversity-multiplexing tradeoff of the
primary source under the proposed protocol. We consider certain quality of
service for each user specified by its required throughput. The optimization
problem is stated under such condition. It is shown that the optimization
problem is linear and can be readily solved. We show that the sum of the
secondary required throughputs must be less than or equal to the probability of
correct packets reception.Comment: This paper was accepted in PIMRC 201
- …