Two-Layer LDPC Codes for Low Complexity ML Detection in GSM Systems

Abstract

Although maximum-likelihood (ML) detection is able to achieve optimal performance in generalized spatial modulation (GSM) systems, its exhaustive search leads to an intractable computational complexity. In this letter, two-layer low-density parity-check (TL-LDPC) codes are proposed to reduce the combinations of transmission vectors in LDPC coded GSM systems. Simulation results show that the complexity of the ML detection in the TL-LDPC-coded GSM systems is much lower than that of the ML detection in conventional LDPC-coded GSM systems with a negligible performance loss.