73 research outputs found
Diversity-Multiplexing Tradeoff of Asynchronous Cooperative Diversity in Wireless Networks
Synchronization of relay nodes is an important and critical issue in
exploiting cooperative diversity in wireless networks. In this paper, two
asynchronous cooperative diversity schemes are proposed, namely, distributed
delay diversity and asynchronous space-time coded cooperative diversity
schemes. In terms of the overall diversity-multiplexing (DM) tradeoff function,
we show that the proposed independent coding based distributed delay diversity
and asynchronous space-time coded cooperative diversity schemes achieve the
same performance as the synchronous space-time coded approach which requires an
accurate symbol-level timing synchronization to ensure signals arriving at the
destination from different relay nodes are perfectly synchronized. This
demonstrates diversity order is maintained even at the presence of asynchronism
between relay node. Moreover, when all relay nodes succeed in decoding the
source information, the asynchronous space-time coded approach is capable of
achieving better DM-tradeoff than synchronous schemes and performs equivalently
to transmitting information through a parallel fading channel as far as the
DM-tradeoff is concerned. Our results suggest the benefits of fully exploiting
the space-time degrees of freedom in multiple antenna systems by employing
asynchronous space-time codes even in a frequency flat fading channel. In
addition, it is shown asynchronous space-time coded systems are able to achieve
higher mutual information than synchronous space-time coded systems for any
finite signal-to-noise-ratio (SNR) when properly selected baseband waveforms
are employed
OFDM based Distributed Space Time Coding for Asynchronous Relay Networks
Recently Li and Xia have proposed a transmission scheme for wireless relay
networks based on the Alamouti space time code and orthogonal frequency
division multiplexing to combat the effect of timing errors at the relay nodes.
This transmission scheme is amazingly simple and achieves a diversity order of
two for any number of relays. Motivated by its simplicity, this scheme is
extended to a more general transmission scheme that can achieve full
cooperative diversity for any number of relays. The conditions on the
distributed space time block code (DSTBC) structure that admit its application
in the proposed transmission scheme are identified and it is pointed out that
the recently proposed full diversity four group decodable DSTBCs from precoded
co-ordinate interleaved orthogonal designs and extended Clifford algebras
satisfy these conditions. It is then shown how differential encoding at the
source can be combined with the proposed transmission scheme to arrive at a new
transmission scheme that can achieve full cooperative diversity in asynchronous
wireless relay networks with no channel information and also no timing error
knowledge at the destination node. Finally, four group decodable distributed
differential space time block codes applicable in this new transmission scheme
for power of two number of relays are also provided.Comment: 5 pages, 2 figures, to appear in IEEE International Conference on
Communications, Beijing, China, May 19-23, 200
End-To-End Performance Analysis of Two-Hop Asynchronous Cooperative Diversity
International audienceFor mobile users without antenna arrays, transmission diversity can be achieved with cooperative space-time encoded transmissions. This paper present an end-to-end performance analysis of Two-Hop asynchronous cooperative diversity with regenerative relays over Rayleigh Block-Flat-Fading channel. We present a precoding frame-based scheme with packet-wise encoding which enables best synchronization and channel estimation. We derive the bit-error rate and the end-to-end bit-error rate expressions for binary phase-shift keying. We present the performance of the frame-error rate and the end-to-end frame-error rate. Finally, comparisons between three system configurations are presented. Numerical results show that the simulations coincide with the analytical results
Distributed Linear Convolutional Space-Time Coding for Two-Relay Full-Duplex Asynchronous Cooperative Networks
In this paper, a two-relay full-duplex asynchronous cooperative network with
the amplify-and-forward (AF) protocol is considered. We propose two distributed
space-time coding schemes for the cases with and without cross-talks,
respectively. In the first case, each relay can receive the signal sent by the
other through the cross-talk link. We first study the feasibility of cross-talk
cancellation in this network and show that the cross-talk interference cannot
be removed well. For this reason, we design space-time codes by utilizing the
cross-talk signals instead of removing them. In the other case, the self-coding
is realized individually through the loop channel at each relay node and the
signals from the two relay nodes form a space-time code. The achievable
cooperative diversity of both cases is investigated and the conditions to
achieve full cooperative diversity are presented. Simulation results verify the
theoretical analysis.Comment: 11 pages, 7 figures, accepted by IEEE transactions on wireless
communication
Differential Distributed Space-Time Coding with Imperfect Synchronization
Differential distributed space-time coding (D-DSTC) has been considered to
improve both diversity and data-rate in cooperative communications in the
absence of channel information. However, conventionally, it is assumed that
relays are perfectly synchronized in the symbol level. In practice, this
assumption is easily violated due to the distributed nature of the relay
networks. This paper proposes a new differential encoding and decoding process
for D-DSTC systems with two relays. The proposed method is robust against
synchronization errors and does not require any channel information at the
destination. Moreover, the maximum possible diversity and symbol-by-symbol
decoding are attained. Simulation results are provided to show the performance
of the proposed method for various synchronization errors and the fact that our
algorithm is not sensitive to synchronization error.Comment: to appear in IEEE Globecom, 201
CHANNEL ESTIMATION AND EQUALIZATION FOR ASYNCHRONOUS MULTIPLE FREQUENCY OFFSET NETWORKS
A single frequency network transmission is assumed, and we study the impact of distinct carrier frequency offset (CFO) between the local oscillator at each transmitter and the local oscillator at the receiver. Due to the nature of cooperative communications, multiple frequency offsets may occur and the traditional frequency offset compensations may not apply. For this problem, equalization for the time varying channel has been used in the literature, where the equalization matrix inverse needs to be retaken every symbol. In this paper, we propose computationally efficient minimum mean square error (MMSE) and MMSE decision feedback equalizers (MMSE-DFE) when multiple frequency offsets are present, where the equalization matrix inverses do not need to be retaken every symbol. Our proposed equalization methods apply to linear convolutively coded cooperative systems, where linear convolutive space-time coding is used to achieve the full cooperative diversity when there are timing errors from the cooperative users or relay nodes, i.e., asynchronous cooperative communication systems
- …