Low-complexity LDPC coded BICM-ID with orthogonal modulations

Low-complexity LDPC coded BICM-ID with orthogonal modulations

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

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. 1)
      • R.G. Gallager . Low-density parity-check codes. IRE Trans. Inf. Theory , 1 , 21 - 28
    2. 2)
    3. 3)
    4. 4)
      • G. Yue , L. Ping , X. Wang . Generalized low-density parity-check codes based on Hadamard constraints. IEEE Trans. Inf. Theory , 3 , 1058 - 1079
    5. 5)
      • S. Che , P. Wang , L. Ping , X. Wang . Low-complexity soft-input soft-output demodulation of orthogonal modulation. IEEE Commun. Lett. , 12 , 919 - 921
    6. 6)
    7. 7)

Related content

This is a required field
Please enter a valid email address