On implementing the blind ML receiver for orthogonal space-time block codes

ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

Volumn III, Issue , 2005, Pages

  Ma, Wing Kin ^a   Vo, B N ^a   Davidson, T N ^b   Ching, P C ^c  

^a UNIVERSITY OF MELBOURNE   (Australia)

^b MCMASTER UNIVERSITY   (Canada)

^c CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; ERROR DETECTION; MAXIMUM LIKELIHOOD ESTIMATION; OPTIMIZATION; POLYNOMIAL APPROXIMATION; SIGNAL RECEIVERS; SIGNAL TO NOISE RATIO; SPACE TIME ADAPTIVE PROCESSING;

BOOLEAN QUADRATIC PROGRAM; DETECTION PROBLEM; HIGH-PRECISION BQP; SPHERE DECODING;

BLOCK CODES;

EID: 33646772869     PISSN: 15206149     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICASSP.2005.1415740     Document Type: Conference Paper

References (15)

1. A.L. Swindlehurst and G. Leus, "Blind and semi-blind equalization for generalized space-time block codes," IEEE Trans. Signal Processing, vol. 50, no. 10, pp. 2589-2498, 2002.
2. E.G. Larsson, P. Stoica, and J. Li, "Orthogonal space-time block codes: maximum likelihood detection for unknown channels and unstructured interferences," IEEE Trans. Signal Processing, vol. 51, no. 2, pp. 362-372, 2003.
3. V. Tarokh, H. Jafarkhani, and A.R. Calderbank, "Space-time block codes from orthogonal designs," IEEE Trans. Inform. Theory, vol. 45, no. 5, pp. 1456-1467, 1999.
4. S. Shahbazpanahi, A.B. Gershman, and J.H. Manton, "Closed-form blind decoding of orthogonal space-time block codes," Proc. 2004 Int. Conf. Acoust., Speech and Signal Processing, May 2004.
5. W.-K. Ma, P.C. Ching, T.N. Davidson, and X.-G. Xia, "Blind maximum-likelihood decoding for orthogonal space-time block codes: A semidefinite relaxation approach," Proc. IEEE 2003 Global Commun. Conf., December 2003.
6. W.-K. Ma, B.-N. Vo, T.N. Davidson, and P.C. Ching, "Blind ML detection of orthogonal space-time block codes: high-performance, efficient implementations," submitted to IEEE Trans. Signal Processing, April 2004, accepted subject to minor revisions, Nov. 2004.
7. M.X. Goemans and D.P. Williamson, "Improved approximation algorithms for maximum cut and satisfiability problem using semi-definite programming," Journal of ACM, vol. 42, pp. 1115-1145, 1995.
8. S. Zhang, "Quadratic maximization and semidefinite relaxation," Math. Program., vol. 87, pp. 453-465, 2000.
9. W.-K. Ma, T.N. Davidson, K.M. Wong, Z.-Q. Luo, and PC. Ching, "Quasi-maximum-likelihood multiuser detection using semi-definite relaxation with applications to synchronous CDMA," IEEE Trans. Signal Processing, vol. 50, no. 4, pp. 912-922, 2002.
10. P.H. Tan and L.K. Rasmussen, "The application of semidefinite programming for detection in CDMA," IEEE J. Select. Areas Commun., vol. 19, no. 8, pp. 1442-1449, 2001.
11. J. Jaldén, C. Martin, and B. Ottersten, "Semidefinite programming for detection in linear systems - optimality conditions and space-time decoding," Proc. 2003 Int. Conf. Acoust., Speech and Signal Processing, vol. 4, pp. 9-12, 2003.
12. E. Viterbo and J. Boutros, "A universal lattice code decoder for fading channels," IEEE Trans. Inform. Theory, vol. 45, no. 5, pp. 1639-1642, 1999.
13. E. Agrell, T. Eriksson, A. Vardy, and K. Zeger, "Closest point searches in lattices," IEEE Trans. Inform. Theory, vol. 48, no. 2, pp. 2201-2214, 2002.
14. M.O. Damen, H. El Gamal, and G. Caire, "On maximum-likelihood detection and the search for the closest lattice point," IEEE Trans. Inform. Theory, vol. 49, no. 10, pp. 2389-2402, 2003.
15. C. Helmberg, F. Rendl, R.J. Vanderbei, and H. Wolkowicz, "An interior-point method for semidefinite programming," SIAM J. Optim., vol. 6, no. 2, pp. 342-361, 1996.