Skip to Main content Skip to Navigation
Conference papers

On sparse graph coding for coherent and noncoherent demodulation

Abstract : 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.
Complete list of metadatas

Cited literature [23 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02603868
Contributor : Open Archive Toulouse Archive Ouverte (oatao) <>
Submitted on : Saturday, May 16, 2020 - 9:10:57 AM
Last modification on : Thursday, May 21, 2020 - 1:36:43 AM

File

Piat-Durozoi_22232.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02603868, version 1
  • OATAO : 22232

Citation

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⟩

Share

Metrics

Record views

7

Files downloads

5