Minimum-decoding-complexity, maximum-rate space-time block codes from Clifford algebras

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2006, Pages 788-792

  Karmakar, Sanjay ^a   Sundar Rajan, B ^a  

^a INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

SPACE-TIME BLOCK CODES (STBC); SYMBOLBY-SYMBOL DECODABLE (SSD);

ALGEBRA;

BLOCK CODES;

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

References (16)

1. B. Hassibi and B. Hochwald, "High-rate codes that are linear in space and time," IEEE Trans. Inform. Theory, vol.48, no.7, pp.1804-1824, July 2002.
2. S.M. Alamouti, "A simple transmitter diversity scheme for wireless communications," IEEE J. Select Areas Comm., vol 16 pp. 1451-1458, Oct. 1998.
3. V. Tarokh, H. Jafarkhani and A. R. Calderbank, "Space-Time block codes from orthogonal designs," IEEE Trans. Inform. Theory, vol.45, pp. 1456-1467, July 1999.
4. Also "Correction to "Space-time block codes from orthogonal designs," IEEE Trans. Inform. Theory, vol. 46, no.1, p.314, Jan. 2000.
5. O. Tirkkonen and A. Hottinen, "Square-matrix embeddable space-time block codes for complex signal constellations," IEEE Trans. Inform. Theory, vol.48, no.2, Feb. 2002.
6. G. Ganesan and P. Stoica, "Space-time diversity using orthogonal and amicable orthogonal designs," in Proc. IEEE Int. Conf. Acoustics, Speech and Signal Processing (ICASSP 2000), Istanbul, Turkey, 2000, pp. 2561-2564.
7. Md. Zafar Ali Khan and B. Sundar Rajan,"Space-Time Block Codes from Co-ordinate Interleaved Orthogonal Designs," Proc: IEEE International Symposium on Information Theory,(ISYT 2002), Lausanne, Switzerland, June 30-July 5, 2002, p.275.
8. Md. Zafar Ali Khan and B. Sundar Rajan, "A co-ordinate interleaved orthogonal design for four transmit antennas," IISc-DRDO Technical Report No:TR-PME-2002-17, Department of Electrical Communication Engineering, Indian Institute of Science, Bangalore, India, October 2002 (Downloadable from http://ece.iisc.ernet.in/bsrajan).
9. Md. Zafar Ali Khan, Single-symbol and Double-symbol decodable STBCs for MIMO fading channels, Ph.D. Thesis, Indian Institute of Science, Bangalore, India, July 2003.
10. Md. Zafar Ali Khan and B. Sundar Rajan,"Single-Symbol Maximum-Likelihood Decodable Linear STBCs," Communicated to IEEE Transactions on Information Theory, June 2005.
11. H.Wang, D.Wang and X-G.Xia,"On optimal QOSTBC with minimal decoding complexity," Submitted to IEEE transactions on Information Theory.
12. H.Wang, D.Wang and X-G.Xia,"On Optimal Quasi-orthogonal space-time block codes with minimum decoding complexity," Proc. ISIT 2005, Adelaide, Nov. 2005, pp. 1168-1172.
13. C.Yuen, Y.L. Guan and T.T. Tjhung, " Full rate full diversity STBC with constellation rotation," Proc. VTC 2003, Spring vol. 1, pp. 296-300, Seogwipo, Korea, April 2003.
14. G.Yuen, Y.L.Guan and T.T.Tjhung, "Construction of quasi-orthogonal STBC with minimum decoding complexity," Proc. ISIT 2004, Chicago, June/July 2004, p.308.
15. G.Yuen, Y.L.Guan and T.T.Tjhung, "Optimizing quasi-orthogonal STBC with group-constrained linear transformation," Proc. GLOBECOM 2004, Dallas, Texas, Dec. 2004, pp.550-554.
16. G.Yuen, Y.L.Guan and T.T.Tjhung, "Quasi-orthogonal STBC with minimum decoding complexity: Further results," Proc. WCNC 2005, pp.483-488.