Skip to main content
SpringerLink
Log in

The maximal rates and minimal decoding delay of more general complex orthogonal designs

  • Research Papers
  • Published:
Science China Information Sciences Aims and scope Submit manuscript

Abstract

Space-time block codes based on complex orthogonal design have been widely investigated for their remarkable performance. In this paper, we propose a definition of more general complex orthogonal designs, which permits arbitrary complex factor with unit modulus in each entry. We prove that the maximal rate is still \( \frac{{m + 1}} {{2m}} \) for n = 2m or 2m − 1 antennas and minimal delay is also lower-bounded by \( (_{m - 1}^{2m} ) \). Thus, allowing complex factor with unit modulus in each entry will not improve the main performance criterion of space-time block codes.

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. A simple transmit diversity technique for wireless communications. IEEE J Sel Areas Commun, 1998, 16: 1451–1458

    Article  Google Scholar 

  2. Tarokh V, Jafarkhani H, Calderbank A R. Space-time block codes from orthogonal designs. IEEE Trans Inf Theory, 1999, 45: 1456–1467

    Article  MATH  MathSciNet  Google Scholar 

  3. Tarokh V, Seshadri N, Calderbank A R. Space-time codes for high data rate wireless communication: Performance criterion and code construction. IEEE Trans Inf Theory, 1998, 44: 744–765

    Article  MATH  MathSciNet  Google Scholar 

  4. Liang X B. Orthogonal designs with maximal rates. IEEE Trans Inf Theory, 2003, 49: 313–316

    Article  Google Scholar 

  5. Kan H, Shen H. The maximal rates of more general complex orthogonal designs. In: Proceedings of the Sixth International Conference on Parallel and Distributed Computing, Applications and Technologies (PDACT’05), Dalian, China, 2005. 177–180

  6. Adams S, Karst N, Pollack J. The minimum decoding delay of maximum rate complex orthogonal space-time block codes. IEEE Trans Inf Theory, 2007, 53: 2677–2684

    Article  MathSciNet  Google Scholar 

  7. Kan H B, Shen H. A counterexample for the open problem on the minimal delays of orthogonal designs with maximal rates. IEEE Trans Inf Theory, 2005, 51: 355–359

    Article  MathSciNet  Google Scholar 

  8. Wang H, Xia X G. Upper bounds of rates of complex orthogonal space-time block codes. IEEE Trans Inf Theory, 2003, 49: 2788–2796

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Shanghai Key Lab of Intelligent Information Processing, School of Computer Science, Fudan University, Shanghai, 200433, China

    Yuan Li, HaiBin Kan, Chen Yuan & HuanFei Ma

Authors
  1. Yuan Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. HaiBin Kan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chen Yuan
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. HuanFei Ma
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to HaiBin Kan.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, Y., Kan, H., Yuan, C. et al. The maximal rates and minimal decoding delay of more general complex orthogonal designs. Sci. China Inf. Sci. 53, 1826–1832 (2010). https://doi.org/10.1007/s11432-010-4038-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11432-010-4038-1

Keywords

Search

Navigation