331 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 Symbol-Based Signaling for Networks with Multiple Relays
Wireless channels suffer from severe inherent impairments and hence
reliable and high data rate wireless transmission is particularly challenging to
achieve. Fortunately, using multiple antennae improves performance in wireless
transmission by providing space diversity, spatial multiplexing, and power gains.
However, in wireless ad-hoc networks multiple antennae may not be acceptable
due to limitations in size, cost, and hardware complexity. As a result, cooperative
relaying strategies have attracted considerable attention because of their abilities
to take advantage of multi-antenna by using multiple single-antenna relays.
This study is to explore cooperative signaling for different relay networks,
such as multi-hop relay networks formed by multiple single-antenna relays and
multi-stage relay networks formed by multiple relaying stages with each stage
holding several single-antenna relays. The main contribution of this study is the
development of a new relaying scheme for networks using symbol-level
modulation, such as binary phase shift keying (BPSK) and quadrature phase shift
keying (QPSK). We also analyze effects of this newly developed scheme when it
is used with space-time coding in a multi-stage relay network. Simulation results
demonstrate that the new scheme outperforms previously proposed schemes:
amplify-and-forward (AF) scheme and decode-and-forward (DF) scheme
DMT Optimality of LR-Aided Linear Decoders for a General Class of Channels, Lattice Designs, and System Models
The work identifies the first general, explicit, and non-random MIMO
encoder-decoder structures that guarantee optimality with respect to the
diversity-multiplexing tradeoff (DMT), without employing a computationally
expensive maximum-likelihood (ML) receiver. Specifically, the work establishes
the DMT optimality of a class of regularized lattice decoders, and more
importantly the DMT optimality of their lattice-reduction (LR)-aided linear
counterparts. The results hold for all channel statistics, for all channel
dimensions, and most interestingly, irrespective of the particular lattice-code
applied. As a special case, it is established that the LLL-based LR-aided
linear implementation of the MMSE-GDFE lattice decoder facilitates DMT optimal
decoding of any lattice code at a worst-case complexity that grows at most
linearly in the data rate. This represents a fundamental reduction in the
decoding complexity when compared to ML decoding whose complexity is generally
exponential in rate.
The results' generality lends them applicable to a plethora of pertinent
communication scenarios such as quasi-static MIMO, MIMO-OFDM, ISI,
cooperative-relaying, and MIMO-ARQ channels, in all of which the DMT optimality
of the LR-aided linear decoder is guaranteed. The adopted approach yields
insight, and motivates further study, into joint transceiver designs with an
improved SNR gap to ML decoding.Comment: 16 pages, 1 figure (3 subfigures), submitted to the IEEE Transactions
on Information Theor
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
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
- …