Codes achieving the DMD tradeoff of the MIMO-ARQ channel

IEEE International Symposium on Information Theory - Proceedings

Volumn 2005-January, Issue , 2005, Pages

  Pawar, Sameer A ^a   Kumar, K Raj ^a   Kumar, P Vijay ^a   Elia, Petros ^b   Sethuraman, B A ^c  

^a INDIAN INSTITUTE OF SCIENCE   (India)

^b UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^c CALIFORNIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); RAYLEIGH FADING; RECEIVING ANTENNAS;

CYCLIC DIVISION ALGEBRAS; DIVERSITY-MULTIPLEXING; EXPLICIT CONSTRUCTIONS; FADING MIMO CHANNELS; MULTIPLEXING GAINS; NOISELESS FEEDBACK; QUASI-STATIC CHANNELS; SUFFICIENT CRITERION;

SIGNAL TO NOISE RATIO;

EID: 79551618085     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2005.1523468     Document Type: Conference Paper

References (16)

1. H. El Gamal, G. Caire and M. O. Damen, “The MIMO ARQ Channel: Diversity-Multiplexing-Delay Tradeoff,” Submitted to IEEE Trans. Inform. Theory, November 2004.
2. L. Zheng and D. Tse, “Diversity and Multiplexing: A Fundamental Tradeoff in Multiple-Antenna Channels,” IEEE Trans. Info. Theory, vol. 49, no. 5, pp. 1073-1096, May 2003.
3. H. Yao, G.W. Wornell,“Structured space-time block codes with optimal diversity-multiplexing tradeoff and minimum delay,” GLOBECOM 2003. IEEE, Vol. 4, 1-5 Dec. 2003 pp. 1941 - 1945.
4. P. Dayal and M. K. Varanasi,“An Optimal Two Transmit Antenna Space-Time Code and its Stacked Extensions,” Proc. Asilomar Conf. on Signals, Systems and Computers, Monterey, CA, Nov. 2003.
5. J.-C. Belfiore, G. Rekaya and E.Viterbo, “The Golden code: a 2 × 2 full-rate space-time code with non-vanishing determinants,” Proc. IEEE Int. Symp. Inform. Th (ISIT 2004), pp. 308, June 27-July 2, Chicago 2004.
6. Genyuan Wang and Xiang-Gen Xia, “On optimal multi-layer cyclotomic space-time code design,” IEEE Trans. on Info. Theory, pp. 1102-1135, Volume: 51, Issue: 3, March 2005.
7. S. Tavildar and P. Viswanath, “Permutation codes for the parallel fading channel: Achieving the diversity-Multiplexing tradeoff,” Proc. CISS-2004, Feb. 2004.
8. S. Tavildar and P. Viswanath, “Approximately universal codes over slow fading channels,” Submitted to IEEE Trans. Info. Theory, Feb. 2005.
9. S. Tavildar and P. Viswanath,“Permutation Codes: Achieveing the Diversity-Multiplexing Tradeoff,” Proc. IEEE Int. Symp. Inform. Th (ISIT 2004), Chicago, pp. 98, June 27-July 2, 2004.
10. H. El Gamal, G. Caire and M.O. Damen,“Lattice Coding and Decoding Achieve the Optimal Diversity-Multilpexing Tradeoff of MIMO Channels,”IEEE Trans. Inform. Theory, vol. 50, pp. 968-985, June 2004.
11. Kiran.T. and B.Sundar Rajan, “STBC-schemes with non-vanishing determinant for certain number of transmit antennas,” Submitted to IEEE Trans. Inform. Theory, August 2004.
12. Petros Elia, K. Raj Kumar, Sameer A. Pawar, P. Vijay Kumar and Hsiao-feng Lu, “Explicit, Minimum-Delay Space-Time Codes Achieving The Diversity-Multiplexing Gain Tradeoff,” Submitted to IEEE Trans. Inform. Theory, Sept. 2004.
13. B. A. Sethuraman, B. Sundar Rajan and V. Shashidhar, “Full-diversity, High-rate, Space-Time Block Codes from Division Algebras,” IEEE Trans. Info. Theory, vol. 49, pp. 2596-2616, Oct. 2003.
14. Petros Elia, K. Raj Kumar, Sameer A. Pawar, P. Vijay Kumar and Hsiao-feng Lu, “Explicit, Minimum-Delay Space-Time Codes Achieving The Diversity-Multiplexing Gain Tradeoff,” Accepted for presentation in the 2005 IEEE Intl. Symp. Info. Theory (ISIT-05), Sept. 2005.
15. Roger A. Horn and Charles R. Johnson, Matrix analysis, Cambridge University Press, 1999.
16. A. Edelman,“Eigen Values and Condition Numbers of Random Matrices,” SIAM J. Matrix Anal. Appl., vol. 9 No. 4, pp. 543-560, Oct 1988.