STBCs from representation of extended Clifford algebras

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2007, Pages 1626-1630

  Rajan, G Susinder ^a   Rajan, B Sundar ^a  

^a INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

INTERNATIONAL SYMPOSIUM; SUFFICIENT CONDITIONS;

ALGEBRA; CYBERNETICS; INFORMATION THEORY; MAXIMUM LIKELIHOOD; TECHNICAL PRESENTATIONS; TRAJECTORIES;

CODES (SYMBOLS);

EID: 51649092530     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2007.4557141     Document Type: Conference Paper

References (13)

1. V. Tarokh, H. Jafarkhani and A.R. Calderbank, "Space-Time Codes from Orthogonal Designs," IEEE Trans. Inform. Theory, Vol. 45, No. 2, pp. 744-765.
2. Olav Tirkkonen and Ari Hottinen, "Square-Matrix: Embeddable Space-Time Block Codes for Complex Signal Constellations," IEEE Trans. Inform. Theory, Vol. 48, No. 2, pp. 384-395, Feb. 2002.
3. Olav Tirkkonen, Adrian Boariu and Ari Hottinen, "Minimal Non-Orthogonality Rate 1 Space-Time Block Code for 3+ Tx Antennas," Proceedings of IEEE Int. Symp. on Spread-Spectrum Tech. & Applications., New Jersey, Sept.6-8, 2000, pp. 429-432.
4. H. Jafarkhani, "A quasi-orthogonal space-time block code," IEEE Trans. on Communications, Vol. 49, No. 1, pp. 1-4, Jan. 2001.
5. Md. Zafar Ali Khan and B. Sundar Rajan, "Single-Symbol Maximum-Likelihood Decodable Linear STBCs," IEEE Trans. Inform. Theory, Vol.52, No.5, pp.2062-2091, May 2006.
6. Sanjay Karmakar and B.Sundar Rajan, "Minimum-Decoding Complexity, Maximum-rate Space-Time Block Codes from Clifford Algebras," Proc. IEEE Int. Symp. on Inform. Theory, Seattle, July 9-14, 2006, pp.788-792.
7. Sanjay Karmakar, B.Sundar Rajan, "High-rate Multi-Symbol-Decodable STBCs from Clifford Algebras," Proceedings of 13th National Conference on Communications(NCC 2007), IIT Kanpur, Jan.26-28, 2007. Available in arXiv:cs.IT/0702023.
8. Sanjay Karmakar and B. Sundar Rajan, "Multi-group decodable STBCs from Clifford Algebras," Proceedings of IEEE Inform. Theory Workshop (ITW 2006), Chengdu, China, October 22-26, 2006, pp.448-452.
9. Chau Yuen, Yong Liang Guan, Tjeng Thiang Tjhung, "A class of four-group quasi-orthogonal space-time block code achieving full rate and full diversity for any number of antennas," in Proceedings IEEE Personal, Indoor and Mobile Radio Communications Symposium(PIMRC), Vol.1, pp.92 - 96, Berlin, Germany, Sept.11-14, 2005.
10. G. Susinder Rajan and B. Sundar Rajan, "Algebraic Distributed Space-Time Codes with Low ML Decoding Complexity," to appear in Proceedings of ISIT 2007, Nice, France, June 24-29, 2007.
11. G. Susinder Rajan and B. Sundar Rajan, "Noncoherent Low-Decoding-Complexity Space-Time Codes for Wireless Relay Networks," to appear in Proceedings of ISIT 2007, Nice, France, June 24-29, 2007.
12. N.Jacobson, Basic Algebra I, 2nd ed., New York:W.H.Freeman, 1985.
13. Jean-Pierre Serre, "Linear Representations of Finite Groups," Springer-Verlag.