Skip to main content
Log in

No-Zero-Entry Space-Time Block Codes Over Time-Selective Fading Channels for MIMO Systems

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

In MIMO systems, space-time block code (STBC) is good solution for improving system performance. Among the STBCs, coordinate interleaved orthogonal designs (CIODs) combined with QR-decomposition-based decision-feedback decoding (QR-DDF) allow achieving good performance for time-selective fading channels. However, half of entries in codeword matrix of CIODs are zeros. These zero entries result in high peak-to-average power ratio (PAPR) and also impose a severe constraint on hardware implementation of the code when turning off some of the transmitting antennas whenever a zero is transmitted. In this paper, we propose a new design of space-time block codes without zero entry in codeword matrix (NZE-STBCs) for time-selective fading channels. The main advantage of the proposed NZE-STBCs is that its peak-to-average ratio (PAPR) is 3 dB lower than that of CIODs, and its hardware implementation is also easier due to eliminating on-off switchers without sacrificing performance. Moreover, similar as CIODs, the proposed NZE-STBCs can use low complexity QR-DDF decoder over time-selective fading channels to enhance performance and reduce decoding complexity. Simulation results show that the proposed NZE-STBCs outperform CIODs for three transmit antennas while performing the same for two and four transmit antennas.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  1. Tarokh, V., Seshadri, N., & Calderbank, A. R. (1998). Space-time codes for high data rate wireless communication: performance criterion and code construction. IEEE Transaction on Information Theory, 44, 744–765.

    Article  MATH  MathSciNet  Google Scholar 

  2. Alamouti, S. M. (1998). A simple transmit diversity technique for wireless communications. IEEE Journal on Selected Areas in Communications, 16, 1451–1458.

    Article  Google Scholar 

  3. Tarokh, V., Jafarkhani, H., & Calderbank, A. R. (1999). Space-time block codes from orthogonal designs. IEEE Transaction on Information Theory, 45, 1456–1467.

    Article  MATH  MathSciNet  Google Scholar 

  4. Jafarkhani, H. (2001). A quasi-orthogonal space-time block codes. IEEE Transaction on Communication, 49, 1–4.

    Article  MATH  Google Scholar 

  5. Tirkkonen, O., Boariu, A., & Hottinen, A. (2000). Minimal non-orthogonality rate 1 space-time block code for 3-Tx antennas. In Proceedings of IEEE interntional symposium spread spectrum techniques and applications (ISSSTA’00) (pp. 429–432). NJ, Sep. 6–8, 2000

  6. Papadias, C. B., & Foschini, G. J. (Mar. 2003). Capacity-approaching space-time codes for systems employing four transmitter antennas. IEEE Transaction on Information Theory, 49, 726–732.

    Google Scholar 

  7. Sharma, N., & Papadias, C. B. (Mar. 2003). Improved quasi-orthogonal codes through constellation rotation. IEEE Transaction on Communications, 51, 332–335.

    Google Scholar 

  8. Su, W., & Xia, X.-G. (Oct. 2004). Signal constellations for quasi-orthogonal space-time block codes with full diversity. IEEE Transaction on Information Theory, 50, 2331–2347.

    Google Scholar 

  9. Khan, M. Z. A., & Rajan, B. S. (2002). Space-time block codes from co-ordinate interleaved orthogonal designs. In Proceedings of IEEE international symposium on information theory (ISIT). Lausanne, Switzerland :

  10. Khan, M. Z. A., & Rajan, B. S. (2006). Single-symbol maximum-likelihood decodable linear STBCs. IEEE Transactions on Information Theory, 52(5), 2062–2091.

    Article  MathSciNet  Google Scholar 

  11. Yuen, C., Guan, Y. L., & Tjhung, T. T. (2008). Power-balanced orthogonal space-time block code. IEEE Transactions on Vehicular Technology, 57(5), 3304–3309.

    Article  Google Scholar 

  12. Yuen, C., Guan, Y. L., & Tjhung, T. T. (2005). Quasi-orthogonal STBC with minimum decoding complexity. IEEE Transactions on Wireless Communications, 4(5), 2089–2094.

    Article  Google Scholar 

  13. Wang, H., Wang, D., & Xia, X. G. (2009). On optimal quasi-orthogonal space-time block codes with minimum decoding complexity. IEEE Transactions on Information Theory, 55(3), 1104–1130.

    Article  MathSciNet  Google Scholar 

  14. Sinnokrot, M. O., & Barry, J. R. (2009). A single-symbol-decodable space-time block code with full rate and low peak-to-average power ratio. IEEE Transactions on Wireless Communications, 8(5), 2242–2246.

    Article  Google Scholar 

  15. Lee, H.-J. (Dec. 2007). Wireless systems incorporating full-diversity single-symbol decodable space-time block codes: Performance evaluations and developments. In Doctor Dissertation. The University of Texas, Austin

  16. Jakes, W. C. (1974). Microwave mobile communication. New York: Wiley.

    Google Scholar 

  17. Dayal, P., & Varanasi, M. K. (May 2005). Maximal diversity algebraic space-time codes with low peak-to-mean power ratio. IEEE Transactions on Information Theory, 51(5), 1691–1708.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Van-Bien Pham.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pham, VB., Sheng, WX. No-Zero-Entry Space-Time Block Codes Over Time-Selective Fading Channels for MIMO Systems. Wireless Pers Commun 75, 35–47 (2014). https://doi.org/10.1007/s11277-013-1339-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-013-1339-x

Keywords

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy