STBCs with reduced sphere decoding complexity for two-user MIMO-MAC

GLOBECOM - IEEE Global Telecommunications Conference

Volumn , Issue , 2009, Pages

  Harshan, J ^a   Sundar Rajan, B ^a  

^a INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ALAMOUTI; COMPLEX ORTHOGONAL DESIGNS; EXPLICIT CONSTRUCTIONS; MULTIPLE ACCESS CHANNELS; MULTIPLE-INPUT-MULTIPLE-OUTPUT; R MATRICES; SPACE-TIME BLOCK CODE; SPHERE DECODING; SUFFICIENT CONDITIONS; TRANSMIT ANTENNA; WORST CASE;

BLOCK CODES; DECODING; DESIGN; FADING CHANNELS; INFORMATION THEORY;

SPHERES;

EID: 77951526055     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GLOCOM.2009.5425864     Document Type: Conference Paper

References (14)

1. J. Harshan and B. Sundar Rajan, "Finite Signal-set Capacity of Two-user Gaussian Multiple Access Channel" in the proceedings of IEEE International Symposium on Information Theory, (ISIT 2008), Toronto, Canada, July 06-11, 2008. pp. 1203-1207.
2. J. Harshan and B. Sundar Rajan, "Coding for Two-User Gaussian MAC with PSK and PAM Signal Sets", in the proceedings of IEEE International Symposium on Information Theory, (ISIT 2009), Seoul, South Korea, June 28- July 03, 2009, pp. 1859-1863.
3. J. Harshan and B. Sundar Rajan, "Coding for two-user SISO and MIMO multiple access channels", available online at arXiv:0901.0168v3 [cs.IT]
4. M.E. Gartner and H. Bolcskei, "Multiuser space-time/frequency code design", in the proceedings of IEEE International Symposium on Information Theory, (ISIT 2006), pp.2819-2823.
5. V. Tarokh, H. Jafarkhani and A. R. Calderbank, "Space time block codes from orthogonal designs" IEEE Transactions on Information theory, vol.45, no.05, 1999, pp.1456-1467.
6. X Liang, "Orthogonal designs with maximal rates", IEEE Transactions on Information theory, vol.49, no.10, 2003, pp. 2468-2503.
7. Zhihang Yi and Il-Min Kim "Single symbol ML decodable distributed STBCs for cooperative networks", IEEE Transactions on Information theory, vol.53, no.8, 2007, pp. 2977-2985.
8. J. Harshan and B. Sundar Rajan, "High-Rate, Single-Symbol ML Decodable Precoded DSTBCs for Cooperative Networks", IEEE Transactions on Information Theory, Vol. 55, No. 05, May. 2009, pp. 2004-2015..
9. E. Viterbo and J. Boutros, "Universal lattice code decoder for fading channels," IEEE Transactions on Information theory, vol.45, no.05, pp.1639-1642. July 1999.
10. Mohamed Oussama Damen, Hesham El Gamal and Giuseppe Caire, "On Maximum-likelihood detection and the search for the closest lattice point," IEEE Transactions on Information theory, vol.49, no.10, pp.2389-2402, Oct 2003.
11. B. Hassibi and B.M. Hochwald, "High-rate codes that are linear in space and time", IEEE Transactions on Information theory, vol.48, no.7, Jul. 2002, pages 1804-1824.
12. E.Biglieri, Yi Hong and E. Viterbo, "On fast-decodable space-time block codes", IEEE Trans. Inform. Theory, vol. 55, no. 2, pp. 524-530, Feb 2009.
13. Mohanned O. Sinnokrot and John. R. Barry, "Fast Maximum-Likelihood decoding of Golden code", Available online. arXiv:0811.2201[cs.IT], November 2008.
14. K. Pavan Srinath and B. Sundar Rajan, " Low ML-Decoding Complexity, Large Coding Gain, Full-Rate, Full-Diversity STBCs for 2 X 2 and 4 X 2 MIMO Systems", Available online. arXiv:0809.0635[cs.IT], September 2008.