Skip to main content
SpringerLink
Log in

Distributed Space-Time Coding

  • Chapter
  • First Online:
Distributed Space-Time Coding

Part of the book series: SpringerBriefs in Computer Science ((BRIEFSCOMPUTER))

  • 756 Accesses

Abstract

This chapter is on the distributed space-time coding (DSTC) scheme for cooperative relay network. At first, the space-time coding scheme proposed for multiple-antenna system is briefly reviewed in Sect. 2.1. Then in Sect. 2.2, DSTC for a single-antenna multiple-relay network is elaborated. The performance analysis of DSTC, including the pairwise error probability (PEP) calculations and the diversity order derivation, is also provided. Some code designs for DSTC are introduced in Sect. 2.3. Finally, in Sect. 2.4, simulated error probabilities of DSTC for several network scenarios are illustrated.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Note that, compared with the condition \(P\gg 1\), this condition requires higher \(P\).

  2. 2.

    For a multiple-antenna system that uses this code in space-time coding, \(K\) symbols can be sent through \(T\) time slots. Thus the symbol-rate is \(K/T\). For a relay network with DSTC, \(2T\) time slots are actually needed to complete the transmissions of the \(K\) symbols. But to be consistent with the literature on ODs, we say that the code has symbol-rate \(K/T\).

References

  1. Alamouti SM (1998) A simple transmitter diversity scheme for wireless communications. IEEE J on Selected Areas in Communications, 16:1451–1458.

    Article  Google Scholar 

  2. Barbero LG and Thompson JS (2008) Fixing the complexity of the sphere decoder for MIMO detection. IEEE T Wireless Communications, 7:2131–2142.

    Article  Google Scholar 

  3. Damen O, Chkeif A, and Belfiore JC (2000) Lattice code decoder for space-time codes. IEEE Communications L, 4:161–163.

    Article  Google Scholar 

  4. Gradshteyn IS and Ryzhik IM (2000) Table of Integrals, Series and Products. Academic Press, 6nd ed.

    Google Scholar 

  5. Elia P, Kittipiyakul S, and Javidi T (2007) Cooperative diversity schemes for asynchronous wireless networks. Wireless Personal Communications, 43: 3–12, doi:10.1007/s11277-006-9242-3.

  6. Guo X and Xia XG (2008) A distributed space-time coding in asynchronous wireless relay networks. IEEE T on Wireless Communications, 7:1812–1816.

    Article  Google Scholar 

  7. Hassibi B and Hochwald B (2002) High-rate codes that are linear in space and time. IEEE T on Information Theory, 48:1804–1824.

    Article  MathSciNet  MATH  Google Scholar 

  8. Hassibi B and Vikalo H (2005) On the sphere-decoding algorithm I. Expected complexity. IEEE T Signal Processing, 8:2806–2818.

    Article  MathSciNet  Google Scholar 

  9. Hochwald BM and Marzetta TL (2000) Unitary space-time modulation for multiple-antenna communication in Rayleigh flat-fading. IEEE T on Information Theory, 46:543–564.

    Article  MathSciNet  MATH  Google Scholar 

  10. Hochwald B and Sweldens W (1999) Differential unitary space-time modulation. IEEE T on Communications, 48:2041–2052.

    Article  Google Scholar 

  11. Hughes B (2000) Differential space-time modulation. IEEE T on Information Theory, 46:2567–2578.

    Article  MATH  Google Scholar 

  12. Jafarkhani H (2001) A quasi-orthogonal space-time block codes. IEEE T on Communications, 49:1–4.

    Article  MATH  Google Scholar 

  13. Jafarkhani H (2005) Space-Time Coding: Theory and Practice. Cambridge Academic Press.

    Google Scholar 

  14. Jing Y (2010) Combination of MRC and distributed space-time coding in networks with multiple-antenna relays. IEEE T on Wireless Communications, 9:2550–2559.

    Article  Google Scholar 

  15. Jing Y (2004) Space-Time Code Design and Its Applications in Wireless Networks. Ph.D. Thesis, California Institute of Technology.

    Google Scholar 

  16. Jing Y and Hassibi B (2004) Wireless network, diversity, and space-time codes. Information Theory, Workshop, 2004.

    Google Scholar 

  17. Jing Y and Hassibi B (2006) Distributed space-time coding in wireless relay networks. IEEE T on Wireless Communications, 5:3524–3536.

    Article  Google Scholar 

  18. Jing Y and Hassibi B (2008) Cooperative diversity in wireless relay networks with multiple-antenna nodes. EURASIP J on Advanced Signal Process, doi:10.1155/2008/254573.

  19. Jing Y and Jafarkhani H (2007) Using orthogonal and quasi-orthogonal designs in wireless relay networks. IEEE T on Information Theory, 53:4106–4118.

    Article  MathSciNet  Google Scholar 

  20. Kiran T and Rajan BS (2006) Distributed space-time codes with reduced decoding complexity. IEEE International Symposium on Information Theory, 542–546.

    Google Scholar 

  21. Li Y, Zhang W, and Xia X-G (2009) Distributive high-rate space-frequency codes achieving full cooperative and multipath diversities for asynchronous cooperative communications. IEEE T on Vehicular Technology, 58:207–217.

    Article  Google Scholar 

  22. Oggier F and Hassibi B (2006) An algebraic family of distributed space-time codes for wireless relay networks. IEEE International Symposium on Information Theory, 538–541.

    Google Scholar 

  23. Oggier F and Hassibi B (2008) An algebraic coding scheme for Wireless Relay networks with Multiple-Antenna Nodes. IEEE T Signal Processing, 56:2957–2966.

    Article  MathSciNet  Google Scholar 

  24. Oggier F and Hassibi B (2008) Code design for multihop wireless relay networks. EURASIP J Advances Signal Processing, 2008. doi:10.1155/2008/457307.

  25. Papadias CB and Foschini GJ (2011) A space-time coding approach for systems employing four transmit antennas. International C on on Acoustics, Speech, and Signal Processing, 4:2481–2484.

    Google Scholar 

  26. Papadias CB and Foschini GJ (2003) Capacity-approaching space-time codes for systems employing four transmitter antennas. IEEE T Information Theory, 49:726–732.

    Article  MathSciNet  MATH  Google Scholar 

  27. Rajan GS and Rajan BS (2007) Algebraic distributed space-time codes with low ML decoding complexity. IEEE International Symposium on Information Theory, 1516–1520.

    Google Scholar 

  28. Su W and Xia X-G (2004) Signal constellations for quasi-orthogonal space-time block codes with full diversity. IEEE T on Information Theory, 50:2331–2347.

    Article  MathSciNet  Google Scholar 

  29. Tarokh V, Jafarkhani H, and Calderbank AR (1999) Space-time block codes from orthogonal designs. IEEE T on Information Theory, 45:1456–1467.

    Article  MathSciNet  MATH  Google Scholar 

  30. Tarokh V, Seshadri N, and Calderbank AR (1998) Space-time codes for high data rate wireless communication: Performance criterion and code construction. IEEE T on Information Theory, 44:744–765.

    Article  MathSciNet  MATH  Google Scholar 

  31. Tirkkonen O, Boariu A, and Hottinen A (2000) Minimal non-orthogonality rate 1 space-time block code for 3-Tx antennas. IEEE 6th Int. Symp. Spread-Spectrum Tech. Appl., 429432.

    Google Scholar 

  32. Van Trees HL (1998) Detection, Estimation, and Modulation Theory-Part I. New York: Wiley.

    Google Scholar 

  33. Vikalo H and Hassibi B (2005) On the sphere-decoding algorithm II. Generalizations, second-order statistics, and applications to communications. IEEE T Signal Processing, 8:2819–2834.

    Article  MathSciNet  Google Scholar 

  34. Viterbo E and Boutros J (1999) A universal lattice code decoder for fading channels. IEEE T Information Theory, 5:1639–1642.

    Article  MathSciNet  Google Scholar 

  35. Wang H and Xia X-G (2003) Upper bounds of rates of complex orthogonal space-time block codes. IEEE T on Information Theory, 49:2788–2796.

    Article  MathSciNet  Google Scholar 

  36. Wang H and Xia X-G (2005) On optimal quasi-orthogonal space-time block codes with minimum decoding complexity. IEEE International S on Information Theory, 1168–1172.

    Google Scholar 

  37. Yi Z, Ju M, Song H-K, and Kim I-M (2011) BER analysis of distributed Alamouti’s code with CSI-assiated relays. IEEE T Wireless Communications, 10:1199–1211.

    Article  Google Scholar 

  38. Yi Z and Kim DI (2007) Single-Symbol ML decodable distributed STBCs for cooperative networks. IEEE T Information Theory, 53:2977–2985.

    Article  MathSciNet  Google Scholar 

  39. Yi Z and Kim I-M (2009) Approximate BER expressions of distributed Alamouti’s code in dissimilar cooperative networks with blind relays. IEEE T Communications, 57:3571–3578.

    Article  Google Scholar 

  40. Yi Z, Kim I-M, and Kim DI (2011) Symbol rate upper bound of distributed STBC with channel phase information. IEEE T Wireless Communications, 10:745–750.

    Article  Google Scholar 

  41. Zummo SD and Al-Semari SA (2000) A tight bound on the error probability of space-time codes for rapid fading channels. IEEE, Wireless Communications and Networking Conference, 1086–1089.

    Google Scholar 

  42. Uysal M and Georghiades CN (2000) Error performance analysis of space-time codes over Rayleigh fading channels. IEEE Vehicular Technology Conference- fall, 5:2285–2290.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, University of Alberta, 9107-116 Street, Edmonton, Alberta, T6G 2V4, Canada

    Yindi Jing

Authors
  1. Yindi Jing
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yindi Jing .

Rights and permissions

Reprints and permissions

Copyright information

© 2013 The Author(s)

About this chapter

Cite this chapter

Jing, Y. (2013). Distributed Space-Time Coding. In: Distributed Space-Time Coding. SpringerBriefs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-6831-8_2

Download citation

  • DOI: https://doi.org/10.1007/978-1-4614-6831-8_2

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4614-6830-1

  • Online ISBN: 978-1-4614-6831-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation