Skip to main content
SpringerLink
Log in

Single-Symbol Maximum Likelihood Decodable STBCs with Fewer Zero-Entries

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

Two generalized constructions of single-symbol maximum likelihood (ML) decodable space-time block codes (SSDCs), the coordinate interleave orthogonal design (CIOD) and the generalized CIOD (GCIOD), have been proposed by Khan et al. Their main disadvantage is that there are too many zero entries in the codeword matrix. The transmission of these zero-valued symbols causes switching off some of the transmit antennas resulting in a high peak-to-average power ratio and also imposing a severe constraint on hardware implementation of the code. Based on the orthogonal construction of orthogonal space-time block codes and coordinate interleaving, a new generalized construction of SSDCs is proposed. Our proposed codes not only maintain the desirable properties of high rate, full transmit diversity and single-symbol ML decoding similar to CIODs and GCIODs, but also have fewer zero entries in its codeword matrix than CIODs and GCIODs.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

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

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  3. Lu K., Fu S., Xia X.-G. (2005) Closed-form designs of complex orthogonal space-time block codes of rates (k + 1)/2k for (2k−1) or 2k transmit antennas. IEEE Transactions on Information Theory 51: 4340–4347

    Article  MathSciNet  Google Scholar 

  4. 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 

  5. 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 

  6. Karmakar, S., & Rajan, B. S. (2006). Minimum-decoding-complexity maximum-rate space-time block codes from Clifford algebras. In Proceedings of IEEE ISIT, Seattle, USA, pp. 788–792.

  7. Dao D. N., Yuen C., Tellambura C., Guan Y. L., Tjhung T. T. (2008) Four-group decodable space-time block codes. IEEE Transactions on Signal Processing 56: 424–430

    Article  MathSciNet  Google Scholar 

  8. 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 

  9. 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 

  10. Ankita, P., & Rajan, B. S. (2010). No-zero-entry, square, single-symbol ML decodable STBCs. NCC 2010, 2010 National Conference on Communication, Chennai, India, 29–31 January.

  11. Das, S., & Rajan, B.S. (2008). Square complex orthogonal designs with no zero entry for any 2m antennas. Available on http://arxiv.org/PS_cache/arxiv/pdf/0812/0812.2458v1.pdf, December 2008.

  12. Das S., & Rajan B. S. (2008). A class of maximal-rate, low-PAPR, non-square complex orthogonal designs. Available on http://arxiv.org/abs/0808.1400v1 August 2008.

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

    Article  MathSciNet  MATH  Google Scholar 

  14. Dao, D. N., & Tellambura, C. (2008). Decoding, performance analysis, and optimal signal designs for coordinate interleaved orthogonal designs. IEEE Transactons on Wireless Communications, 7(1).

Download references

Author information

Authors and Affiliations

  1. Department of Communication Engineering, Nanjing University of Science and Technology, Nanjing, 210094, China

    Van-Bien Pham, Weixing Sheng & Xiaofeng Ma

  2. Institute of Wireless Communication and Sensor Network, Nanjing University of Science and Technology, Nanjing, 210094, China

    Mao Wang & Feng Shu

Authors
  1. Van-Bien Pham
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Weixing Sheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mao Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Feng Shu
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Xiaofeng Ma
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Weixing Sheng.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pham, VB., Sheng, W., Wang, M. et al. Single-Symbol Maximum Likelihood Decodable STBCs with Fewer Zero-Entries. Wireless Pers Commun 69, 827–839 (2013). https://doi.org/10.1007/s11277-012-0614-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-012-0614-6

Keywords

Search

Navigation