Elsevier

Physical Communication

Volume 1, Issue 3, September 2008, Pages 209-220
Physical Communication

Full length article
Cooperative space–time block coding with amplify-and-forward strategy: Exact bit error probability and adaptive forwarding schemes

https://doi.org/10.1016/j.phycom.2008.08.001Get rights and content

Abstract

Cooperative space–time block coding (STBC) is a distributed way to exploit spatial diversity. Because of its simplicity, the amplify-and-forward (AF) strategy is often used at relays. However, the exact performance of this strategy is not available in the existing works. Therefore, in the first part of this paper, we analyze the performance of cooperative STBC with the AF strategy. Exact bit error probabilities (BEP) are derived in closed form for three existing protocols.

Since the AF strategy simply forwards the signals at the relays, the noise at the relay is also forwarded to the destination, and it degrades the received signals from both the relay and the source, due to the receiver structure of STBC. In the second part of this paper, we examine the effect of the forwarded noise and propose a condition under which the relay should stop forwarding the signals. Based on this condition, adaptive forwarding schemes for cooperative STBC are proposed. The performances of these schemes are studied and the exact BEP’s are also obtained in closed form. Finally, the energy efficiencies of these adaptive schemes are discussed.

Introduction

Space–time coding (STC) [1] is a well known technique to exploit spatial diversity and mitigate the fading problem in wireless communication. However, it is usually difficult to install multiple antennas in one mobile communication node, due to its limited size. In such scenarios, we can exploit spatial diversity through the cooperation of neighboring nodes [2], [3], [4]. Therefore, STC can be cooperatively applied among several single antenna users, e.g. [5], [6], [7], [8], by creating a “virtual array” of antennas.

More specifically, the transmission is completed in two phases. In the first phase, the source node sends information to relay nodes, and in the second phase, the relay nodes and the source node transmit together using STC. The relay nodes can either amplify and forward (AF), or decode and forward (DF) the received signal. The DF strategy can provide a better performance [9] compared with the AF strategy, but it has a higher complexity in decoding the signals. Therefore, the simpler AF strategy is also an attractive choice.

The performance of cooperative STC has been studied in many works. For example, [10], [11], [12] have studied the performance of cooperative STC with DF strategy. Recently, we have derived the exact bit error probability (BEP) for cooperative space–time block codes (CSTBC) with DF strategy, over nonidentical Ricean channels [13]. At the same time, many works, e.g. [14], [15], [16], [17], have investigated CSTBC with AF strategy. Under a high SNR assumption, [14] obtained an upper bound on the pair-wise error probability; [15] derived asymptotic BEP results with both perfect and imperfect channel state information (CSI); [16] generalized the CSTBC to the case of an arbitrary number of relays and hops, and presented an asymptotic symbol error probability (SEP) result. Ref. [17] also derived the asymptotic SEP, which was used to optimize the power allocation.

However, none of the above mentioned works has obtained the exact error performance. Therefore, the first target of this paper is to analyze the exact bit error performance of CSTBC with AF strategy. Three existing transmission protocols are considered, and exact BEP results are obtained in closed form for all of these protocols. Based on the exact BEP, we compare our results with the existing asymptotic BEP in [15]. Then, we compare the performances of the protocols in different situations and examine the robustness of these protocols.

For the CSTBC with AF strategy, since the relay simply forwards the received signals, the additive noise at the relay is also forwarded. Due to the decoder structure of space–time block code, the forwarded noise degrades the received signals from both the relay and the source. Sometimes, when the forwarded noise is too large, the advantage of cooperative diversity vanishes, and even an error floor can be observed [9], [15]. Therefore, in the second part of this paper, we address the key question of how the relay should decide whether to forward the signals and cooperate to form an STBC. We first examine the effect of the forwarded noise on the received SNR and find a critical condition, under which the forwarded signal from the relay will be deleterious. According to this condition, we propose adaptive forwarding schemes for CSTBC with full CSI, partial CSI and no CSI available at the relay. The exact BEP’s of these adaptive CSTBC schemes, which are much better than that of the conventional CSTBC, are also obtained in closed form. Finally, the energy efficiencies of these adaptive schemes are also discussed.

The rest of this paper is organized as follows: Section 2 describes the system model. The exact BEP results of the conventional CSTBC are derived in Section 3. A comparison of different protocols is also provided in this section. Section 4 proposes and analyzes the adaptive CSTBC schemes, together with numerical examples and discussion. A summary is given in Section 5.

Section snippets

System model

We consider a cooperative transmission scenario with three nodes, where each node only has one antenna. The source S transmits information to the destination D, with the assistance from the relay R. We assume all the nodes are half duplex, such that they cannot transmit and receive simultaneously. Therefore, we use a time-division multiple-access strategy here, and the transmission is completed in two phases. According to different settings of the source and the destination, three existing

Performance of protocol III

Applying the symbol-by-symbol detector for orthogonal STBC [18], [21], the decision metrics for s1 and s2 are given, respectively, as sˆ1=ERDESRhRDhSRr1+ESDhSDr2,sˆ2=ESDhSDr1ERDESRhRDhSRr2. The BEP of s1 and s2 are the same, due to symmetry. For equally-likely symbols, we can assume s1=1 without loss of generality, and the conditional BEP can be computed from the probability P([sˆ1ejα]<0|s1=1,hSR,hSD,hRD)[22], where α is some angle that depends on the modulation scheme. Therefore, the

Adaptive forwarding schemes

In the last section, we mentioned that if both the source and the relay transmit in the second phase (Protocol I and III), the forwarded noise from the relay will degrade the total received SNR at the destination. In this section, we first reexamine the received SNR in the second phase. From (8), (9), we can see that the received SNR’s for s1 and s2 are the same, and are given by γSTBC=ESRERD|hSR|2|hRD|2(ERD|hRD|2+1)NoSNR from the RD link+ESD|hSD|2(ERD|hRD|2+1)NoSNR from the SD link. The

Conclusion

In this paper, we have analyzed the performances of CSTBC with AF strategy. Three existing protocols are considered and exact BEP results are obtained in closed forms. Based on the BEP results, we first show that our exact result is more accurate than the existing asymptotic BEP results. We also compare the performances of the three protocols in different situations. It is shown that protocol I has a better performance than the other two; protocols I and II are robust to deep fades on the SR

Jun He obtained the Bachelor Degree from the Department of Information Science and Electrical Engineering of Zhejiang University in 2003. Since August 2004, he has been working towards his Ph.D. degree in the Department of Electrical and Computer Engineering of National University of Singapore. His research interests include digital communication over fading channel, MIMO systems, space–time coding and cooperative transmission.

References (25)

  • V. Tarohk et al.

    Space–time codes for high data rate wireless communications: Performance criterion and code construction

    IEEE Trans. Inform. Theory

    (1998)
  • J.N. Laneman, G.W. Wornell, Energy efficient antenna sharing and relaying for wireless networks, in: Proc. IEEE WCNC,...
  • A. Sendonaris et al.

    User cooperation diversity-part I: System description

    IEEE Trans. Commun.

    (2003)
  • A. Sendonaris et al.

    User cooperation diversity-part II: Implementation aspects and performance analysis

    IEEE Trans. Commun.

    (2003)
  • J.N. Laneman et al.

    Distributed space–time-coded protocols for exploiting cooperative diversity in wireless networks

    IEEE Trans. Inform. Theory

    (2003)
  • P.A. Anghel, G. Leus, M. Kaveh, Multi-user space–time coding in cooperative networks, in: Proc. ICASSP, vol. 4, 2003,...
  • S. Barbarossa, G. Scutari, Cooperative diversity through virtual arrays in multihop network, in: Proc. ICASSP, vol. 5,...
  • M. Dohler et al.

    A resource allocation strategy for distributed MIMO multi-hop communication systems

    IEEE Commun. Lett.

    (2004)
  • S. Barbarossa, G. Scutari, Distributed space–time coding strategies for wideband multihop networks: Regenerative vs....
  • A. Stefanov, E. Erkip, On the performance analysis of cooperative space–time coded systems, in: Proc. WCNC, 2003, pp....
  • M. Dohler, M. Hussain, H. Aghvami, Performance of distributed space–time block codes, in: Proc. VTC, 2004, pp....
  • G. Scutari et al.

    Distributed space–time coding for regenerative relay networks

    IEEE Trans. Wireless Commun.

    (2005)
  • Cited by (2)

    Jun He obtained the Bachelor Degree from the Department of Information Science and Electrical Engineering of Zhejiang University in 2003. Since August 2004, he has been working towards his Ph.D. degree in the Department of Electrical and Computer Engineering of National University of Singapore. His research interests include digital communication over fading channel, MIMO systems, space–time coding and cooperative transmission.

    Pooi Yuen Kam [M ’83, SM’87] was born in Ipoh, Malaysia in 1951, and educated at the Massachusetts Institute of Technology, Cambridge, Mass., where he obtained the S.B., S.M., and Ph.D. degrees in electrical engineering in 1972, 1973, and 1976, respectively.

    From 1976 to 1978, he was a member of the technical staff at the Bell Telephone Laboratories, Holmdel, NJ, where he was engaged in packet network studies. Since 1978, he has been with the Department of Electrical and Computer Engineering, National University of Singapore, where he is now a professor. He served as the Deputy Dean of Engineering and the Vice Dean for Academic Affairs, Faculty of Engineering of the National University of Singapore, from 2000 to 2003. His research interests are in detection and estimation theory, digital communications and coding. He spent the sabbatical year 1987 to 1988 at the Tokyo Institute of Technology, Tokyo, Japan, under the sponsorship of the Hitachi Scholarship Foundation. In year 2006, he was invited to the School of Engineering Science, Simon Fraser University, Burnaby, BC, Canada as the David Bested Fellow.

    Kam is a member of Eta Kappa Nu, Tau Beta Pi, and Sigma Xi. Since 1996, he has been the Editor for Modulation and Detection for Wireless Systems of the IEEE Transactions on Communications. He won the Best Paper Award at the IEEE VTC 2004 - Fall.

    View full text