Skip to main content

A Low-Complexity Decoding Algorithm for Quasi-orthogonal Space-Time Block Codes

  • Conference paper
  • First Online:
Electronics, Communications and Networks V

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 382))

  • 1013 Accesses

Abstract

In this paper we discuss full-rate quasi-orthogonal space-time block code with a low decoding problem. Based on the traditional Bilateral Jacobi transformation, we propose a new decoding algorithm which can reduce the multiplication and root computation complexity at the Multiple Input Multiple Output (MIMO) receivers. Simulation results show that the bit error probability of our scheme is comparable to that of the traditional algorithms but its computation complexity is much lower than the traditional algorithms.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Jafarkhani, H.: A quasi-orthogonal space-time block code. IEEE Trans. Commun. 49, 1–4 (2001)

    Article  MATH  Google Scholar 

  2. Choi, M., Lee, H., Nam, H.: Error rate analysis of quasi-orthogonal space–time block codes with power scaling. Electron. Lett. 50(25), 1940–1942 (2014)

    Article  Google Scholar 

  3. Nimmagadda, S.M., Sajja, S.G, Bhima, P.R.: Quasi-Orthogonal space-time block codes based on circulant matrix for eight transmit antennas. In: International Conference on IEEE Communications and Signal Processing (ICCSP), , 1953–1957. IEEE, Piscataway (2014)

    Google Scholar 

  4. Shen, Q.J.: The faster algorithms of plane rotation. Numerical mathematics. J. Chin. Univ. 1, 82–86 (1980)

    Google Scholar 

  5. Chen, M.Y., Cioffi, J.M.: Space-time block codes with symbol-by-symbol maximum-likelihood detections. IEEE J. Selected Topics Signal Process. 3(6), 910–915 (2009)

    Article  Google Scholar 

  6. Leuschner, J., Yousefi, S.: On the ML decoding of quasi-orthogonal space-time block codes via sphere decoding and exhaustive search. IEEE Trans. Wireless Commun. 7(11), 4088–4093 (2008)

    Article  Google Scholar 

  7. Ahmadi, A., Talebi, S., Shahabinejad, M.: A new approach to fast decode quasi-orthogonal space-time block codes. IEEE Trans. Wireless Commun. 14, 165–176 (2015)

    Article  Google Scholar 

  8. Astal, M.-T.E.L., Abu-Hudrouss, A.M., Olivier, J.C.: Improved signal detection of wireless relaying networks employing space-time block codes under imperfect synchronization. Wireless Pers. Commun. 82, 1–18 (2014)

    Google Scholar 

  9. Lee, H.: Robust full-diversity full-rate quasi-orthogonal STBC for four transmit antennas. Electron. Lett. 24th, 45(20), 1004–1005 (2009)

    Google Scholar 

  10. Jia, M.R., Xiao, L.P.: Improved QO-STBC for three and four transmit antennas. J. China Univ. Posts Telecommun. 17(4), 42–46 (2010)

    Article  Google Scholar 

  11. Xiao, L.P., Dai, X.X.: A novel QO-STBC scheme with linear decoding. J. China Univ. Posts Telecommun. 5(5), 53–57 (2011)

    Article  Google Scholar 

  12. Ranju, M.A.A.A., Rafi, R.S.: Analysis of rate one quasi-orthogonal space-time block coding over rayleigh fading channel. Int. J. Commun. Netw. Syst. Sci. 07, 196–202 (2014)

    Google Scholar 

  13. Park, U., Kim, S.Y., Lim, K., Li, J.: A novel QO-STBC scheme with linear decoding for three and four transmit antennas. IEEE Commun. Lett. 12(12), 868–870 (2008)

    Article  Google Scholar 

Download references

Acknowledgements

This paper is supported by the National Natural Science Foundation of China (61571250&61571108), the Project of Education Department of Zhejiang Province (Y201432108), the Open Research Fund of National Mobile Communications Research Laboratory of Southeast University (2011D18), and the Open Fund for the Information and Communication Engineering Key-Key Discipline of Zhejiang Province, Ningbo University(xkxl1414).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to You-Ming Li .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media Singapore

About this paper

Cite this paper

Jin, XP., Li, YM., Li, ZQ., Jin, N. (2016). A Low-Complexity Decoding Algorithm for Quasi-orthogonal Space-Time Block Codes. In: Hussain, A. (eds) Electronics, Communications and Networks V. Lecture Notes in Electrical Engineering, vol 382. Springer, Singapore. https://doi.org/10.1007/978-981-10-0740-8_3

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-0740-8_3

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-0738-5

  • Online ISBN: 978-981-10-0740-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics