On coding for Faster-Than-Nyquist signaling

Romain Tajan (1) , Bouchra Benammar (1) , Charly Poulliat (1, 2) , Marie-Laure Boucheret (1, 2)

1 IRIT-SC - Signal et Communications
2 Toulouse INP - Institut National Polytechnique (Toulouse)

In this paper, we study the design of sparse graph based codes for Faster-Than-Nyquist (FTN) signaling. Using an asymptotic approach based on EXIT charts, we show that good low-density parity check codes can be designed that perform well under iterative detection and decoding and that have better performance than a FTN scheme using a code optimized for the additive white Gaussian noise channel.

Mots clés: Detectors; Noise; Receivers; Optimization; Iterative decoding; Modulation

Domaines: Synthèse d'image et réalité virtuelle [cs.GR]; Traitement du signal et de l'image [eess.SP]; Traitement des images [eess.IV]; Vision par ordinateur et reconnaissance de formes [cs.CV]; Intelligence artificielle [cs.AI]

Romain Tajan, Bouchra Benammar, Charly Poulliat, Marie-Laure Boucheret. On coding for Faster-Than-Nyquist signaling. IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom 2015), May 2015, Constanta, Romania. pp. 92-96. ⟨hal-01461709⟩