3,170 research outputs found
An Efficient Adaptive Distributed Space-Time Coding Scheme for Cooperative Relaying
A non-regenerative dual-hop wireless system based on a distributed space-time
coding strategy is considered. It is assumed that each relay retransmits an
appropriately scaled space-time coded version of its received signal. The main
goal of this paper is to investigate a power allocation strategy in relay
stations, which is based on minimizing the outage probability. In the high
signal-to-noise ratio regime for the relay-destination link, it is shown that a
threshold-based power allocation scheme (i.e., the relay remains silent if its
channel gain with the source is less than a prespecified threshold) is optimum.
Monte-Carlo simulations show that the derived on-off power allocation scheme
performs close to optimum for finite signal-to-noise ratio values. Numerical
results demonstrate a dramatic improvement in system performance as compared to
the case that the relay stations forward their received signals with full
power. In addition, a hybrid amplify-and-forward/detect-and-forward scheme is
proposed for the case that the quality of the source-relay link is good.
Finally, the robustness of the proposed scheme in the presence of channel
estimation errors is numerically evaluated.Comment: submitted to IEEE Transactions on Wireless Communications (24 pages
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
Adaptive Randomized Distributed Space-Time Coding in Cooperative MIMO Relay Systems
An adaptive randomized distributed space-time coding (DSTC) scheme and
algorithms are proposed for two-hop cooperative MIMO networks. Linear minimum
mean square error (MMSE) receivers and an amplify-and-forward (AF) cooperation
strategy are considered. In the proposed DSTC scheme, a randomized matrix
obtained by a feedback channel is employed to transform the space-time coded
matrix at the relay node. Linear MMSE expressions are devised to compute the
parameters of the adaptive randomized matrix and the linear receive filter. A
stochastic gradient algorithm is also developed to compute the parameters of
the adaptive randomized matrix with reduced computational complexity. We also
derive the upper bound of the error probability of a cooperative MIMO system
employing the randomized space-time coding scheme first. The simulation results
show that the proposed algorithms obtain significant performance gains as
compared to existing DSTC schemes.Comment: 4 figure
Distributed Space-Time Coding Based on Adjustable Code Matrices for Cooperative MIMO Relaying Systems
An adaptive distributed space-time coding (DSTC) scheme is proposed for
two-hop cooperative MIMO networks. Linear minimum mean square error (MMSE)
receive filters and adjustable code matrices are considered subject to a power
constraint with an amplify-and-forward (AF) cooperation strategy. In the
proposed adaptive DSTC scheme, an adjustable code matrix obtained by a feedback
channel is employed to transform the space-time coded matrix at the relay node.
The effects of the limited feedback and the feedback errors are assessed.
Linear MMSE expressions are devised to compute the parameters of the adjustable
code matrix and the linear receive filters. Stochastic gradient (SG) and
least-squares (LS) algorithms are also developed with reduced computational
complexity. An upper bound on the pairwise error probability analysis is
derived and indicates the advantage of employing the adjustable code matrices
at the relay nodes. An alternative optimization algorithm for the adaptive DSTC
scheme is also derived in order to eliminate the need for the feedback. The
algorithm provides a fully distributed scheme for the adaptive DSTC at the
relay node based on the minimization of the error probability. Simulation
results show that the proposed algorithms obtain significant performance gains
as compared to existing DSTC schemes.Comment: 6 figure
Regenerative and Adaptive schemes Based on Network Coding for Wireless Relay Network
Recent technological advances in wireless communications offer new
opportunities and challenges for relay network.To enhance system performance,
Demodulate-Network Coding (Dm-NC) scheme has been examined at relay node; it
works directly to De-map the received signals and after that forward the
mixture to the destination. Simulation analysis has been proven that the
performance of Dm-NC has superiority over analog-NC. In addition, the
Quantize-Decode-NC scheme (QDF-NC) has been introduced. The presented
simulation results clearly provide that the QDF-NC perform better than
analog-NC. The toggle between analogNC and QDF-NC is simulated in order to
investigate delay and power consumption reduction at relay node.Comment: 11 pages, 8 figures, International Journal of Computer Networks &
Communications (IJCNC), Vol.4, No.3, May 201
- …