Three Simple Iterative Decoding Schemes for BICM-ID

Abstract

Iterative decoding is an efficient technique to overcome the disadvantage of Bit-Interleaved Coded Modulation (BICM) over AWGN channels. In order to reduce the unnecessary iterations of the iterative decoding process, stopping criteria technique has been introduced. Since the iterative process of Bit-Interleaved Coded Modulation with Iterative Decoding (BICM-ID) is proceeded between the demapper and the SISO decoder, not as the one of turbo-decoder which is proceeded between two component decoders, the minimum iteration number of BICM-ID is 2 when using conventional stopping criteria iterative schemes. To minimize the overall iteration number of the iterative decoding process and decrease the complexity of BICM-ID receiver, three simple iterative decoding schemes for BICM-ID, called simple CE (S-CE), simple SCR (S-SCR) and simple HDA (S-HDA) respectively, are proposed in this paper. Simulation results show that the proposed schemes perform similar to the corresponding conventional ones and require less complexity, meanwhile, these proposed schemes perform almost the same as the Fixed iteration scheme with much less iterations. A GENIE scheme is included as the limit of all possible stopping criteria.