Reduced-Complexity Near-ML Detector for a Coded DSTTD-OFDM System

Hyounkuk KIM
Hyuncheol PARK

IEICE TRANSACTIONS on Communications   Vol.E91-B    No.11    pp.3749-3752
Publication Date: 2008/11/01
Online ISSN: 1745-1345
DOI: 10.1093/ietcom/e91-b.11.3749
Print ISSN: 0916-8516
Type of Manuscript: LETTER
Category: Wireless Communication Technologies
double space-time transmit diversity (DSTTD),  maximum-likelihood (ML) detector,  

Full Text: PDF>>
Buy this Article

This letter introduces an efficient near-maximum likelihood (ML) detector for a coded double space-time transmit diversity-orthogonal frequency division multiplexing (DSTTD-OFDM) system. The proposed near-ML detector constructs a candidate vector set through a relaxed minimization method. It reduces computational loads from O(2|A|2) to O(|A|2), where |A| is the modulation order. Numerical results indicate that the proposed near-ML detector provides both almost ML performance and considerable complexity savings.