Skip to main content
Log in

Successive Interference Cancellation Amenable Space–Time Codes with Good Multiplexing-Diversity Tradeoffs

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

In this work, we introduce a new space–time coding (STC) paradigm which is based on the joint design of quasi-orthogonal space–time block code (Q-OSTBC) and the successive interference cancellation (SIC) detector. Based on the proposed principle, two high-rate Q-OSTBCs for three and four transmit antennas are designed. The symbols of the proposed Q-OSTBCs are of judiciously designed diversity order which can be effectively exploited by the SIC based receiver to cancel interference as well as to obtain diversity gain. The proposed SIC-amenable STC’s amicable quasi-orthogonal structure also lends itself to efficient low-complexity linear decoding. Simulation results show that the proposed STC schemes achieve better multiplexing-diversity tradeoffs than the existing conventional schemes.

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

Access this article

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

Instant access to the full article PDF.

References

  1. Zheng L., Tse D. N. C. (2003) Diversity and multiplexing: A fundamental tradeoff in multiple-antenna channels. IEEE Transactions on Information Theory 49(5): 1073–1096

    Article  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  3. Wolniansky, P. W., Foschini, G. J., Golden, G. D., & Valenzuela R. A. (1998). V-BLAST: An architecture for realizing very high data rates over the rich-scattering wireless channel. In Proceedings of the URSI International Symposium on Signals, Systems and Electronics. Pisa, Italy, September–October, pp. 295–300.

  4. Alamouti S. M. (1998) A simple transmit diversity technique for wireless communications. IEEE Journal of Selected Areas in Communication 16(8): 1451–1458

    Article  Google Scholar 

  5. Wang, H. Q., & Xia, X. G. Upper bounds of rates of complex orthogonal space–time block codes. IEEE Transactions on Information Theory. 49(10), 2788–2796.

  6. Ma X., Giannakis G. B. (2003) Full-diversity full rate complex-field space–time coding. IEEE Transactions on Signal Processing 51(11): 2917–2930

    Article  MathSciNet  Google Scholar 

  7. Yao, H., & Wornell, G. W. (2003). Achieving the full MIMO diversity-multiplexing frontier with rotation-based space–time codes, In Proceedings of the Allerton Conference on Communication, Control and Computing, October.

  8. Agrell E., Eriksson T., Vardy A., Zeger K. (2002) Closest point search in lattices. IEEE Transactions on Information Theory 48(8): 2201–2214

    Article  MathSciNet  MATH  Google Scholar 

  9. Jaldén J., Ottersten B. (2005) On the complexity of sphere decoding in digital communications. IEEE Transactions on Signal Processing 53(4): 1474–1485

    Article  MathSciNet  Google Scholar 

  10. Mahadevappa, R., & ten Brink, S. (May 2004). MIMO mode table for 802.11n, Realtek semiconductors, document IEEE 802.11-04/553r0.

  11. IST-2003-507581. (February 2005). WINNER assessment of advanced beamforming and mimo technologies.

  12. Cover T. (1972) Broadcast channels. IEEE Transactions on Information Theory 18(1): 2–14

    Article  MathSciNet  MATH  Google Scholar 

  13. Viterbi A. J. (1990) Very low rate convolutional codes for maximum theoretical performance of spread-spectrum multiple-access channels. IEEE Journal of Selected Areas in Communication 8: 641–649

    Article  Google Scholar 

  14. Cover T., Toomas J. (1991) Elements of information theory. Wiley, NewYork

    Book  MATH  Google Scholar 

  15. Rimoldi B., Urbanke R. (1996) A rate splitting approach to the Gaussian multiple access channel. IEEE Transactions on Information Theory 42(8): 364–375

    Article  MATH  Google Scholar 

  16. Loyka S., Gagnon F. (2004) Performance analysis of the V-BLAST alogorithm: an analytical approach. IEEE Transactions on Wireless Communication 48: 1326–1337

    Article  Google Scholar 

  17. Wuebben, D., Rinas, J., Boehnke, R., Kuehn, V., & Kammeyer, K. (Jan 2002) Efficient algorithm for detecting layered space–time codes. In 4th International ITG conference on source and channel coding, Berlin, Germany.

  18. Jafarkhani H. (2001) A quasi-orthogonal space–time block code. IEEE Transactions on Communications 49: 1–4

    Article  MATH  Google Scholar 

  19. Hwang K. C., Lee K. B. (2005) Joint transmit and receive filters design for multiple-input multiple-ouput (MIMO) systems. IEEE Transactions on Wireless Communication 4: 1635–1649

    Article  Google Scholar 

  20. Dai, X. M. (October 2009). Successive interference cancellation amiable space–time codes with good multiplexing-diversity tradeoffs. In Proceedings of the Asia-Pacific Conference on Communications (APCC), Shanghai (Invited Paper).

  21. 3rd Generation Partnership Project. (Mar 03, 2007). Multiple input multiple output in universal telecommunication radio access (UTRA), 3GPP TR 25.876 V7.0.0.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xiaoming Dai.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dai, X. Successive Interference Cancellation Amenable Space–Time Codes with Good Multiplexing-Diversity Tradeoffs. Wireless Pers Commun 55, 645–654 (2010). https://doi.org/10.1007/s11277-009-9826-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-009-9826-9

Keywords

Navigation