Fano-Based Iterative Sequential Detection Algorithm for Double-Sttd System

This paper presents iterative sequential detection (ISD) scheme using the modified Fano algorithm (MFA) for a double-STTD system. The proposed scheme can be decomposed into three interrelated steps to overcome the limitation of sequential detection for MIMO systems, which are preprocessing, iterative tree searching, and optimal decision. At the first step, preprocessing is performed to decide the number of iterations and to enumerate the candidate symbols. Then, the tree searching step is followed, where a modified version of Fano algorithm is performed to find the candidate symbol sequences. Finally, the optimal sequence is selected among the candidate sequences. In particular, the variable number of candidate symbols determined in the first and second steps plays an important role of reducing the receiver complexity significantly. Simulation results show that the proposed algorithm has a significant reduction in complexity with a small performance degradation