A Low-Complexity CRC-Based Decoding Algorithm for SLM-ML OFDM Systems

In this letter, a low-complexity selected mapping (SLM) algorithm without phase sequence index information, e.g., side information (SI), is proposed. Different from the SLM algorithm without SI using maximum likelihood (ML), the proposed algorithm uses cyclic redundancy check (CRC) to terminate the decoding calculation in advance. Meanwhile, a small amount of known information is adopeted to assist CRC and a simpler phase sequence set is applied to the SLM. The calculation complexity and bit error rate (BER) of typical algorithms are compared with different phase sequence groups under several different channel conditions. As a result, lower computation complexity is obtained with the same peak to average power ratio (PAPR) suppression effect and no BER increase.