Simple Iterative Near-ML Detection for D-STTD Systems

In this paper, a computationally efficient iterative detection algorithm (IDA) for D-STTD systems is presented. To find an optimal sequence by iterative searching, the proposed scheme consists of two stages. Firstly, the IDA establishes the candidate sequences. Then, it iteratively finds an optimal sequence by examining the candidate sequences until the early termination condition is satisfied. The adaptation of the number of candidate sequences makes the proposed IDA more efficient in computational complexity. The proposed detector is shown to achieve the near-ML performance with significantly reduced complexity.