Efficient blind decoding of orthogonal space-time block codes over time-selective fading channels

IEEE Wireless Communications and Networking Conference, WCNC

Volumn 3, Issue , 2006, Pages 1644-1649

  Cui, Tao ^a   Tellambura, Chintha ^b  

^a California Institute of Technology   (United States)

^b UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BLIND DECODING; ORTHOGONAL SPACE-TIME BLOCK CODES (OSTBCS); PHASE AMBIGUITY PROBLEMS; QUADRATIC MINIMIZATION;

COMPUTATIONAL COMPLEXITY; DECODING; FADING CHANNELS; MEAN SQUARE ERROR; OPTIMIZATION; PROBLEM SOLVING; RAYLEIGH FADING; SPACE TIME ADAPTIVE PROCESSING;

BLOCK CODES;

EID: 34250317828     PISSN: 15253511     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WCNC.2005.1424760     Document Type: Conference Paper

References (15)

1. S. M. Alamouti, "A simple transmit diversity technique for wireless communications," IEEE J. Select. Areas Commun., vol. 16, no. 8, pp. 1451-1458, Oct. 1998.
2. V. Tarokh, H. Jafarkhani, and A. Calderbank, "Space-time block coding for wireless communications: performance results," IEEE J. Select. Areas Commun., vol. 17, no. 3, pp. 451-460, March 1999.
3. F.-C. Zheng and A. Burr, "Orthogonal space-time block coding over time-selective fading channels: a PIC detector for the H/sub i/ systems," in Proc. of ICC, Jun. 2004, pp. 687-691.
4. P. Stoica and G. Ganesan, "Space-time block codes: trained, blind and semi-blind detection," in Proc. of ICASSP, May 2002, pp. 7-11.
5. 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. 2489-2498, Oct. 2002.
6. W.-K. Ma, P. C. Ching, T. Davidson, and X. G. Xia, "Blind maximum-likelihood decoding for orthogonal space-time block codes: a semidefinite relaxation approach," in Proc. of GLOBECOM, Dec. 2003, pp. 2094-2098.
7. U. Fincke and M. Pohst, "Improved methods for calculating vectors of short length in a lattice, inlcuding a complexity analysis," Math. Computation, vol. 44, pp. 463-471, Apr. 1985.
8. G. D. Golden, G. J. Foschini, R. A. Valenzuela, and P. W. Wolniansky, "Detection algorithm and initial laboratory results using the V-BLAST space-time communication architecture," Electron. Lett., vol. 35, no. 1, pp. 14-15, Jan. 1999.
9. 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, May 1996.
10. B. Hassibi and B. M. Hochwald, "High-rate codes that are linear in space and time," IEEE Trans. Inform. Theory, vol. 48, no. 7, pp. 1804-1824, July 2002.
11. 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.
12. R. A. Horn and C. R. Johnson, Matrix analysis. Cambridge, New York: Cambridge University Press, 1985.
13. T. Cui and C.Tellambura, "Joint channel estimation and data detection for OFDM systems via sphere decoding," in Proc. of GLOBECOM, Dec. 2004.
14. M. C. Necker and G. L. Stuber, "Totally blind channel estimation for OFDM on fast varying mobile radio channels," IEEE Trans. Wireless Commun., vol. 3, no. 5, pp. 1514-1525, Sept. 2004.
15. C. Budianu and L. Tong, "Channel estimation for space-time otthogonal block codes," IEEE Trans. Signal Processing, vol. 50, no. 10, pp. 2515-2528, Oct. 2002.