On sparse graph coding for coherent and noncoherent demodulation

Charles-Ugo Piat-Durozoi (1, 2) , Charly Poulliat (2, 3) , Nathalie Thomas (2, 3) , Marie-Laure Boucheret (2, 3) , Guy Lesthievent (4)

1 TéSA - Télécommunications Spatiales et Aéronautiques - Telecommunications for Space ant Aeronautics
2 IRIT-SC - Signal et Communications
3 Toulouse INP - Institut National Polytechnique (Toulouse)
4 CNES - Centre National d'Études Spatiales [Toulouse]

In this paper, we consider a bit-interleaved coded modulation scheme (BICM) composed of an error correcting code serially concatenated with a M-ary non linear modulation with memory. We first compare demodulation strategies for both the coherent and the non coherent cases. Then, we perform an asymptotic analysis and try to show that the design of coding schemes performing well for both the coherent and the non coherent regimes should be done carefully when considering sparse graph based codes such as low-density parity-check (LDPC) codes. It will be shown that optimized coding schemes for the non coherent setting can perform fairly well when using coherent demodulation, while on the contrary, optimized coding schemes for the coherent setting may lead to “non stable” coding schemes in the non coherent setting.

Mots clés: Bit-interleaved coded modulation scheme; Noncoherent demodulation; Sparse graph coding; Optimized coding schemes; Error correcting code; Serial concatenation; M-ary nonlinear modulation; Asymptotic analysis; Low-density parity-check codes; LDPC codes; BICM

Domaines: Algorithme et structure de données [cs.DS]; Traitement du signal et de l'image [eess.SP]

Charles-Ugo Piat-Durozoi, Charly Poulliat, Nathalie Thomas, Marie-Laure Boucheret, Guy Lesthievent. On sparse graph coding for coherent and noncoherent demodulation. IEEE International Symposium on Information Theory (ISIT 2017), Jun 2017, Aachen, Germany. pp.1-5. ⟨hal-02603868⟩