A new full-rate full-diversity space-time block code with nonvanishing determinants and simplified maximum-likelihood decoding

IEEE Transactions on Signal Processing

Volumn 56, Issue 6, 2008, Pages 2461-2469

  Paredes, Javier M ^a   Gershman, Alex B ^a   Gharavi Alkhansari, Mohammad ^b  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

^b SONY CORPORATION   (Japan)

Author keywords

Full rate full diversity codes; Nonvanishing determinant property; Optimal diversity multiplexing gain tradeoff; Space time block codes; Sphere decoder

Indexed keywords

COMPUTATIONAL COMPLEXITY; DECODING; MAXIMUM LIKELIHOOD; MULTIPLEXING;

FULL-RATE FULL-DIVERSITY CODES; OPTIMAL DIVERSITY-MULTIPLEXING GAIN TRADEOFF; SPACE-TIME BLOCK CODE; SPHERE DECODER;

BLOCK CODES;

EID: 44849137759     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2007.916135     Document Type: Article

References (30)

1. V. Tarokh, N. Seshadri, and A. R. Calderbank, "Space-time codes for high date rate wireless communication: Performance criterion and code construction," IEEE Trans. Inf. Theory, vol. 44, pp. 744-765, Mar. 1998.
2. S. Alamouti, "A simple transmit diversity for wireless communications," IEEE J. Sel. Areas Commun., 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. Inf. Theory, vol. 45, pp. 1456-1467. Jul. 1999.
4. S. Sandhu and A. J. Paulraj, "Space-time block codes: A capacity perspective," IEEE Commun. Lett., vol. 4, pp. 384-386, Dec. 2000.
5. W. Su, Z. Safar, and K. J. R. Liu, "Full-rate full-diversity space-frequency codes with optimum coding Advantage," IEEE Trans. Inf. Theory, vol. 51, no. 1, pp. 229-249, Jan. 2005.
6. B. Hassibi and B. M. Hochwald, "High-rate codes that are linear in space and time," IEEE Trans. Theory, vol. 48, pp. 1804-1824, Jul. 2002.
7. R. W. Heath and A. J. Paulraj, "Linear dispersion codes for MIMO systems based on frame theory," IEEE Trans. Signal Process., vol. 50, no. 10, pp. 2429-2441, Oct. 2002.
8. N. D. Sidiropoulos and R. S. Budampati, "Khatri-Rao space-time codes," IEEE Trans. Signal Process., vol. 50, no. 10, pp. 2396-2407, Oct. 2002.
9. X. Ma and G. B. Giannakis, "Full-diversity full-rate complex-field space-time coding," IEEE Trans. Inf. Theory, vol. 51, no. 11, pp. 2917-2930, Nov. 2003.
10. M. O. Damen and N. C. Beaulieu, "On two high-rate algebraic space-time codes," IEEE Trans. Inf. Theory, vol. 49, pp. 1059-1063, Apr. 2003.
11. A. Hottinen and O. Tirkkonen, "Precoder designs for high rate Space-time block codes," in Proc. Conf. Inform. Sciences and Systems Princeton, NJ, Mar. 17-19, 2004.
12. J. K. Zhang, J. Liu, and K. M. Wong, "Trace-orthogonal full diversity cyclotomic space-time codes," in Space-Time Processing for MIMO Communications, A. B. Gershman and N. D. Sidiropoulos, Eds. Chester, U.K.: Wiley, 2005, pp. 169-208.
13. L. Zheng and D. N. C. Tse, "Diversity and multiplexing: A fundamental tradeoff in multiple-antenna channels," IEEE Trans. Theory, vol. 45, pp. 1073-1096, May 2003.
14. H. Yao and G. Wornell "Achieving the full MIMO diversity-multiplexing frontier with rotation based space-time codes," in Proc. Allerton Conf. Commun., Control, Computing, Monticello, IL., Oct. 2003.
15. S. Tavildar and P. Viswanath, "Approximately universal codes over slow fading channel," IEEE Trans. Inf. Theory, vol. 52, pp. 3233-3258, Jul. 2006.
16. P. Dayal and M. K. Varanasi, "An optimal two transmit antenna space-time code and its stacked extensions, in Proc. Asilomar Conf. Signals, Systems. Computers, Pacific. Grove, CA, Nov. 2003, pp. 987-991.
17. J.-C. Belfiore, G. Rekaya, and E. Viterbo, "The Golden code: A 2 × 2 full-rate space-time code with non-vanishing determinants," IEEE Trans. Inf. Theory, vol. 51, pp. 1431-1436, Apr. 2005.
18. T. Kiran and S. B. Rajan, "STBC-schemes with non-vanishing determinant for certain number of transmit antennas," IEEE Trans. Inf. Theory vol. 51, pp. 2964-2992, Aug. 2005.
19. P. Elia, K. R. Kumar, S. A. Pawar, P. V. Kumar, and H. Lu, "Explicit construction of space-time block codes: Achieving the diversity-multiplexing gain tradeoff," IEEE Trans. Inf. Theory, vol. 52, pp. 3896-3884, Sep. 2006.
20. F. Oggier, G. Rekaya, J.-C. Belfiore, and E. Viterbo, "Perfect space time block codes," IEEE Trans. Inf. Theory, vol. 52, pp. 3885-3902, Sep. 2006.
21. E. Agrell, T. Eriksson, A. Vardy, and K. Zeger, "Closest point search in lattices," IEEE Trans. Inf. Theory, vol. 48, pp. 2201-2214, Aug. 2002.
22. O. Damen, A. Chkeif, and J.-C. Belfiore, "Lattice code, decoder for space-time codes," IEEE Commun. Lett., vol. 4, pp. 161-163, May 2000.
23. J. Paredes, A. B. Gershman, and M. Gharavi-Alkhansari, "A 2 × 2 space-time code with non-vanishing determinants and fast maximum likelihood decoding," in Proc. Int. Conf. Acoustic, Speech, Signal Processing (ICASSP), Honolulu, HI, Apr. 2007, vol. 2, pp. 877-880.
24. M. Gharavi-Alkhansari and A. B. Gershman "Constellation space invariance of orthogonal space-time block codes," IEEE Trans. Inf. Theory, vol. 51. no. 1, pp. 1051-1055, Jan. 2005.
25. D. Rainish, "Diversity transform for fading channels," IEEE Trans, Commun., vol. 44, pp. 1653-1661, Dec. 1996.
26. V. M. DaSilva and E. S. Sousa, "Fading-resistant mudulation using several transmitter antennas," IEEE Trans. Commun., vol. 45, pp. 1236-1244, Oct. 1997.
27. J. A. Nelder and R. Mead, "A simplex method for function minimization," Comput. J. vol. 7, PP. 308-313, 1965.
28. D. Pham, K. Pattipati, P. Willet, and J. Luo, "An Improved complex sphere decoder for V-BLAST systems," IEEE Signal Process. Lett., vol. 11, pp. 7488-751, Sep. 2004.
29. E. Larsson and P. Stoica, Space-Time Block Coding for Wireless Communications, 1st ed. Cambridge, U.K.: Cambridge Univ. Press, 2003.
30. B. Hochwald and S. ten Brink, Achieving near-capacity on a multiple-antenna channel," IEEE Trans. Commun., vol. 51, pp. 389-399, Mar. 2003.