Conference Paper

Orthogonal space time block coding for two-way wireless relay networks under imperfect synchronization.

DOI: 10.1109/IWCMC.2011.5982790 Conference: Proceedings of the 7th International Wireless Communications and Mobile Computing Conference, IWCMC 2011, Istanbul, Turkey, 4-8 July, 2011
Source: DBLP

ABSTRACT In this paper distributed space time block codes (D-STBCs) are applied within an asynchronous two-way cooperative wireless relay network using two relay nodes. A parallel interference cancelation (PIC) detection scheme with low structural and computational complexity is applied at the terminal nodes in order to overcome the effect of imperfect synchronization among the cooperative relay nodes. Simulation results based on end-to-end bit error rate (BER) illustrate that the PIC detection algorithm can mitigate the inter symbol interference (ISI) introduced by the asynchronism, and that only a small number of iterations is necessary within the PIC detection to improve the system performance.

0 Bookmarks
 · 
50 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: 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.
    IEEE Transactions on Signal Processing 03/2009; · 2.81 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Space-time block codes (STBCs) from orthogonal designs proposed by Alamouti, and Tarokh-Jafarkhani-Calderbank have attracted considerable attention lately due to their fast maximum-likelihood (ML) decoding and full diversity. However, the maximum symbol transmission rate of an STBC from complex orthogonal designs for complex signals is only 3/4 for three and four transmit antennas, and it is difficult to construct complex orthogonal designs with rate higher than 1/2 for more than four transmit antennas. Recently, Jafarkhani, Tirkkonen-Boariu-Hottinen, and Papadias-Foschini proposed STBCs from quasi-orthogonal designs, where the orthogonality is relaxed to provide higher symbol transmission rates. With the quasi-orthogonal structure, the quasi-orthogonal STBCs still have a fast ML decoding, but do not have the full diversity. The performance of these codes is better than that of the codes from orthogonal designs at low signal-to-noise ratio (SNR), but worse at high SNR. This is due to the fact that the slope of the performance curve depends on the diversity. It is desired to have the quasi-orthogonal STBCs with full diversity to ensure good performance at high SNR. In this paper, we achieve this goal by properly choosing the signal constellations. Specifically, we propose that half of the symbols in a quasi-orthogonal design are chosen from a signal constellation set A and the other half of them are chosen from a rotated constellation e<sup>jφ</sup> A. The resulting STBCs can guarantee both full diversity and fast ML decoding. Moreover, we obtain the optimum selections of the rotation angles φ for some commonly used signal constellations. Simulation results show that the proposed codes outperform the codes from orthogonal designs at both low and high SNRs.
    IEEE Transactions on Information Theory 11/2004; · 2.62 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The use of the spatial dimension is known to greatly increase the reliability of quasi-static (i.e., nonergodic) wireless channels. In this paper, it is demonstrated that most of this gain can also be achieved through collaborative communications with single-antenna/multiple-antenna nodes when there is one receiving agent. In particular, for the single-antenna case, communication is considered to take place between clusters of nearby nodes. The existence of collaborative codes for which the intra-cluster negotiation penalty is, in principle, small (and almost all the diversity gain of traditional space-time codes may be realized) is shown. For example, for a single transmitter node with two collaborators and one receiver node, if the collaborators have as little as a 10-dB path loss advantage over the receiver, the penalty for collaboration over traditional space-time systems is negligible.
    IEEE Transactions on Information Theory 07/2005; · 2.62 Impact Factor