Design of Iterative Demapping Schedules for Reduced-Complexity BICM-ID with Binary LDPC Codes and Orthogonal Modulations

Remi Chauvat (1) , Axel Garcia-Pena (2) , Matteo Paonni

1 ENAC - Ecole Nationale de l'Aviation Civile
2 SIGNAV - ENAC Equipe TELECOM-SIGNAV

LDPC-coded modulations are attractive solutions for many communications links. BICM provides a very simple, flexible yet effective way of combining binary channel codes with non-binary modulations. However, iterative demapping is sometimes necessary to increase the coding gains. This is especially the case for orthogonal modulations where the "BICM capacity" falls far away from the coded modulation capacity. Unfortunately, iterative demapping results in a significant computational cost. A pragmatic solution to reduce this computational cost aims at restricting the number of demapping activations. In this article, a strategy to compute the minimum number of demapping activations necessary for a target estimated BER performance is presented and results are introduced for BICM-ID with binary LDPC-coded orthogonal modulations. Iterative demap-ping schedules optimized for a limited number of demapper activations are designed and evaluated in the finite code length regime.

Mots clés: Schedules; Limiting; Bit error rate; Modulation; Receivers; Market research

Domaines: Informatique [cs]; Sciences de l'ingénieur [physics]

Remi Chauvat, Axel Garcia-Pena, Matteo Paonni. Design of Iterative Demapping Schedules for Reduced-Complexity BICM-ID with Binary LDPC Codes and Orthogonal Modulations. 2021 11th International Symposium on Topics in Coding (ISTC), Aug 2021, Montreal, Canada. pp.1-5, ⟨10.1109/ISTC49272.2021.9594275⟩. ⟨hal-03679543⟩