By Topic

Approaching maximum-likelihood performance with reduced complexity for a double space-time transmit diversity system

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 $31
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

2 Author(s)
Kim, H. ; Sch. of Eng., Inf. & Commun. Univ., Daejeon ; Park, H.

A reduced-complexity detector approaching maximum-likelihood (ML) detection performance is presented for the double space-time transmit diversity system. The proposed scheme exploits both the special structure of equivalent channel matrix and decision-feedback detection. This accounts for accomplishing near-ML or ML performance with significantly relieved computational loads. Moreover, to moderate the average complexity, several distance metric selection criteria are proposed. We can control performance and computational savings according to different distance metric selection rules. Numerical results show that the proposed detector requires significantly fewer computations than that of the Schnorr-Euchner sphere-decoding algorithm in terms of both the worst-case and the average complexity.

Published in:

Communications, IET  (Volume:2 ,  Issue: 5 )