Low-complexity LDPC coded BICM-ID with orthogonal modulations

A low-complexity low density parity check (LDPC) coded bit-interleaved coded modulation with iterative decoding (BICM-ID) scheme with orthogonal modulations is proposed. With a novel mapping strategy of coded bits to symbols, the proposed scheme is equivalent to a generalised LDPC code with Hadamard constraints and thus orthogonal demodulation can be merged into the iterative LDPC decoding process, resulting in a simpler implementation and a lower computational complexity.

[1]  Xiaodong Li,et al.  Bit-interleaved coded modulation with iterative decoding , 1997, IEEE Communications Letters.

[2]  Li Ping,et al.  Generalized Low-Density Parity-Check Codes Based on Hadamard Constraints , 2007, IEEE Transactions on Information Theory.

[3]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[4]  Giuseppe Caire,et al.  Bit-interleaved coded modulation , 2008, Proceedings of ICC'97 - International Conference on Communications.

[5]  Li Ping,et al.  Low-complexity soft-input soft-output demodulation of orthogonal modulation , 2007, IEEE Communications Letters.

[6]  Li Ping,et al.  Zigzag codes and concatenated zigzag codes , 2001, IEEE Trans. Inf. Theory.

[7]  Matthew C. Valenti,et al.  Iterative demodulation and decoding of turbo-coded M-ary noncoherent orthogonal modulation , 2005, IEEE Journal on Selected Areas in Communications.