By Topic

Blind maximum-likelihood decoding for orthogonal space-time block codes: a semidefinite relaxation approach

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Wing-Kin Ma ; Dept. of Electron. Eng., Chinese Univ. of Hong Kong, Shatin, China ; Ching, P.C. ; Davidson, T.N. ; Xia, X.-G.

Orthogonal space-time block codes (OSTBCs) have attracted much attention because they provide an effective and simple scheme for fully utilizing the diversity gain in multi-antenna systems. We address the problem of decoding OSTBCs without channel state information. We place our emphasis on the blind maximum-likelihood (ML) method with the BPSK constellation, and show that blind ML decoding requires the solution of a computationally hard optimization problem. To overcome this computational difficulty, we propose using a high-precision and efficient approximation algorithm, called semidefinite relaxation (SDR), to implement blind ML decoding suboptimally. The resultant SDR-ML blind decoder is efficient in that its complexity is approximately cubic in the number of symbols processed, and is promising for its appealing theoretical worst-case approximation accuracy. Simulation results show that the bit error performance of the SDR-ML blind decoder is substantially better than that of several other blind decoders including the cyclic ML method and the subspace method.

Published in:

Global Telecommunications Conference, 2003. GLOBECOM '03. IEEE  (Volume:4 )

Date of Conference:

1-5 Dec. 2003