A novel JFG detection-decoding approach of a vertical shuffle scheduling for iterative MIMO receivers with NB-LDPC codes

摘要

MIMO systems exploit multi-path propagation in a rich broadcast environment to improve throughput and performance of digital communication systems. The correspondent demappers require additional computational complexity. In this paper, a new detection-decoding approach based on vertical shuffle scheduling is proposed. Space exploration for the maximum likelihood detection is reduced to a dynamic region that surrounds the received symbol. Thus, a dynamic approach is proposed to detect the closest point of the channel observation without calculating all the candidate symbols in a constellation. In addition, a novel method based on EXIT chart study is proposed to find the sufficient number of neighboring points to search around a local minimum and then compute by recursion their Euclidean distances. Compared to the conventional Maximum Likelihood detector, the proposed algorithm allows a reduction in the computational complexity, in terms of number of multiplication, reaching 98%. The simulation results show that the proposed algorithm outperforms the state-of-the-art algorithms like MMSE, sphere decoding, DBTC and DaVinci codes.