Simplified robust fixed-complexity sphere decoder

A simplified robust fixed-complexity sphere decoder (SRFSD) is proposed in this paper. SRFSD reduces the complexity of robust fixed complexity sphere decoder (RFSD) by choosing a detection order minimizing the upper bound of the power of the interference in single expansion (SE) stage. Theoretical proof is given to support the feasibility of SRFSD. Simulation results show that SRFSD retains the robustness of RFSD, and sharply reduces the complexity of RFSD with little sacrifice in bit error rate (BER) performance.