Share This Article:

Block Layering Approach in TAST Codes

Abstract Full-Text HTML Download Download as PDF (Size:228KB) PP. 788-792
DOI: 10.4236/ijcns.2010.310105    4,467 Downloads   7,519 Views  

ABSTRACT

Threaded Algebraic Space Time (TAST) codes developed by Gamal et al. is a powerful class of space time codes in which different layers are combined and separated by appropriate Diophantine number . In this paper we introduce a technique of block layering in TAST codes, in which a series of layers (we call it Block layers) has more than one transmit antenna at the same time instant. As a result we use fewer layers (Diophantine numbers) for the four transmit antennas scheme, which enhances the coding gain of our proposed scheme. In each block layer we incorporate Alamouti’s transmit diversity scheme which decreases the decoding complexity. The proposed code achieves a normalized rate of 2 symbol/s. Simulation result shows that this type of codes outperforms TAST codes in certain scenarios.

Conflicts of Interest

The authors declare no conflicts of interest.

Cite this paper

Z. Ahmed, J. Cances and V. Meghdadi, "Block Layering Approach in TAST Codes," International Journal of Communications, Network and System Sciences, Vol. 3 No. 10, 2010, pp. 788-792. doi: 10.4236/ijcns.2010.310105.

References

[1] S. M. Alamouti, “A Simple Transmit Diversity Technique for Wireless Communication,” IEEE Journal on Selected Areas in Communications, Vol. 16, No. 8, 1998, pp. 1451-1458.
[2] X. -B. Liang and X. -G. Xia, “On the Nonexistence of Rate-One Generalized Complex Orthogonal Designs,” IEEE Transactions on Information Theory, Vol. 49. No. 11, 2003, pp. 2984-2988.
[3] V. Tarokh, H. Jafarkhani and A. R. Calderbank, “Space Time Block Codes from Orthogonal Designs,” IEEE Transactions on Information Theory, Vol. 45 No. 5, 1999, pp. 1456-1467.
[4] G. J. Foschini, “Layered Space Time Architecture or Wireless Communication in a Fading Environment when Using Multiple Antennas,” Bell Labs Technical Journal, Vol. 1, No. 2, 1996, pp. 41-59.
[5] H. Gamal and A. R. Hammon, “A New Approach to Layered Space Time Coding and Signal Processing,” IEEE Transactions on Information Theory, Vol. 47, No. 6, 2001, pp 2321-2334.
[6] H. E. Gamal and M. O. Deman, “Universal Space Time Coding,” IEEE Transactions on Information Theory, Vol. 49, No. 5, 2003, pp. 1097-1119.
[7] M. O. Damen, A. Tewfik and J.-C. Belfiore, “A Construction of a Space-Time Code Based on Number Theory,” IEEE Transactions on Information Theory, Vol. 48, No. 3, 2002, pp. 753-760.
[8] F. Oggier, J. Belfiore and E. Viterbo, “Cyclic Division Algebras: A Tool for Space Time Coding,” now, Boston, Delft, 2007.
[9] B. A. Sethuraman, B. S. Rajan and V. Shashidhar, “Full- Diversity, High-Rate Space Time Block Codes from Division Algebras,”IEEE Transactions on Information Theory, Vol. 49, No. 10, 2003, pp. 2596-2616.
[10] M. O. Damen, K. A. Meraim and J. -C. Belfiore, “Diagonal Algebraic Space-Time Block Codes,” IEEE Transactions on Information Theory, Vol. 48, No. 3, 2002, pp. 628-636.
[11] J. Boutros and E. Viterbo, “Signal Space Diversity: A Power and Bandwidth Efficient Diversity Technique for the Rayleigh Fading Channel,” IEEE Transactions on Information Theory, Vol. 44, No. 4, 1998, pp. 1453-1467.

  
comments powered by Disqus

Copyright © 2018 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.