E. Bixio and . Rimoldi, A decomposition approach to cpm, IEEE Trans. Inf. Theory, vol.34, issue.2, pp.260-270, 1988.

P. Moqvist, M. Tor, and . Aulin, Serially concatenated continuous phase modulation with iterative decoding, IEEE Transactions on Communications, vol.49, issue.11, pp.1901-1915, 2001.
DOI : 10.1109/26.966054

R. Krishna, . Narayanan, L. Gordon, and . Stuber, A serial concatenation approach to iterative demodulation and decoding, IEEE Trans. Commun, vol.47, issue.7, pp.956-961, 1999.

A. Graell-i-amat, C. Nour, and . Douillard, Serially concatenated continuous phase modulation for satellite communications, IEEE Transactions on Wireless Communications, vol.8, issue.6, pp.3260-3269, 2009.
DOI : 10.1109/TWC.2009.081051

R. Chaggara, C. Boucheret, . Bazile, . Bouisson, J. Ducasse et al., Continuous phase modulation for future satellite communication systems in ka band, Proceedings. 2004 International Conference on Information and Communication Technologies: From Theory to Applications, 2004., pp.269-270, 2004.
DOI : 10.1109/ICTTA.2004.1307730

R. Krishna, I. Narayanan, . Altunbas, and . Narayanaswami, Design of serial concatenated msk schemes based on density evolution, IEEE Trans. Commun, vol.51, issue.8, pp.1283-1295, 2003.

R. Krishna, I. Narayanan, R. Altunbas, and . Narayanaswami, On the design of ldpc codes for msk, IEEE Global Telecommunications Conference, 2001. GLOBECOM'01. IEEE, pp.1011-1015, 2001.

A. Ganesan, Capacity estimation and code design principles for continuous phase modulation (CPM), 2003.

M. Xiao and T. Aulin, Irregular repeat continuous phase modulation, IEEE communications letters, vol.9, issue.8, pp.722-725, 2005.

T. Benaddi, C. Poulliat, M. Boucheret, B. Gadat, and G. Lesthievent, Design of unstructured and protograph-based LDPC coded continuous phase modulation, 2014 IEEE International Symposium on Information Theory, pp.1982-1986, 2014.
DOI : 10.1109/ISIT.2014.6875180

A. Jimenez-felstrom and K. Zigangirov, Time-varying periodic convolutional codes with low-density parity-check matrix, IEEE Transactions on Information Theory, vol.45, issue.6, pp.2181-2191, 1999.
DOI : 10.1109/18.782171

S. Kudekar, J. Thomas, . Richardson, L. Rüdiger, and . Urbanke, Threshold Saturation via Spatial Coupling: Why Convolutional LDPC Ensembles Perform So Well over the BEC, IEEE Transactions on Information Theory, vol.57, issue.2, pp.803-834, 2011.
DOI : 10.1109/TIT.2010.2095072
URL : http://arxiv.org/abs/1001.1826

G. David, M. Mitchell, . Lentmaier, J. Daniel, and . Costello, Awgn channel analysis of terminated ldpc convolutional codes, Information Theory and Applications Workshop (ITA), pp.1-5, 2011.

S. Kudekar, T. Richardson, and R. Urbanke, Spatially coupled ensembles universally achieve capacity under belief propagation, 2012 IEEE International Symposium on Information Theory Proceedings (ISIT). IEEE, pp.453-457, 2012.
DOI : 10.1109/isit.2012.6284229
URL : http://arxiv.org/abs/1201.2999

L. Schmalen, . Stephan, and . Brink, Combining spatially coupled ldpc codes with modulation and detection, Proceedings of 2013 9th International ITG Conference on Systems, Communication and Coding (SCC). VDE, pp.1-6, 2013.

S. Phong, A. Nguyen, . Yedla, D. Henry, K. R. Pfister et al., Spatially-coupled codes and threshold saturation on intersymbol-interference channels, 2011.

C. Häger, A. Alvarado, F. Brännström, and E. Agrell, Optimized bit mappings for spatially coupled LDPC codes over parallel binary erasure channels, 2014 IEEE International Conference on Communications (ICC), 2013.
DOI : 10.1109/ICC.2014.6883627

J. Thorpe, Low-density parity-checks codes (ldpc) constructed from protographs, IPN Progress Report, pp.42-154, 2003.

G. David, M. Mitchell, D. Lentmaier, and . Jr, Spatially coupled ldpc codes constructed from protographs, 2014.

J. Thomas, . Richardson, L. Rüdiger, and . Urbanke, The capacity of low-density parity-check codes under messagepassing decoding, IEEE Trans. Inf. Theory, vol.47, issue.2, pp.599-618, 2001.

L. Bahl, . Cocke, J. Jelinek, and . Raviv, Optimal decoding of linear codes for minimizing symbol error rate (Corresp.), IEEE Transactions on Information Theory, vol.20, issue.2, pp.284-287, 1974.
DOI : 10.1109/TIT.1974.1055186

T. Benaddi, C. Poulliat, M. Boucheret, B. Gadat, and G. Lesthievent, Design of systematic GIRA codes for CPM, 2014 8th International Symposium on Turbo Codes and Iterative Information Processing (ISTC), 2014.
DOI : 10.1109/ISTC.2014.6955075
URL : https://hal.archives-ouvertes.fr/hal-01147234

. Stephan-ten and . Brink, Convergence behavior of iteratively decoded parallel concatenated codes, IEEE Trans. Commun, vol.49, issue.10, pp.1727-1737, 2001.

G. Stephan-ten-brink, A. Kramer, and . Ashikhmin, Design of Low-Density Parity-Check Codes for Modulation and Detection, IEEE Transactions on Communications, vol.52, issue.4, pp.670-678, 2004.
DOI : 10.1109/TCOMM.2004.826370

G. Liva and M. Chiani, Protograph LDPC Codes Design Based on EXIT Analysis, IEEE GLOBECOM 2007-2007 IEEE Global Telecommunications Conference, pp.3250-3254, 2007.
DOI : 10.1109/GLOCOM.2007.616

G. David, . Mitchell, E. Ali, . Pusane, J. Daniel et al., Minimum distance and trapping set analysis of protographbased ldpc convolutional codes, IEEE Trans. Inf. Theory, vol.59, issue.1, pp.254-281, 2013.

M. Lentmaier, G. David, G. Mitchell, . Fettweis, J. Daniel et al., Asymptotically good LDPC convolutional codes with AWGN channel thresholds close to the Shannon limit, 2010 6th International Symposium on Turbo Codes & Iterative Information Processing, 2010.
DOI : 10.1109/ISTC.2010.5613891

H. Howard, . Ma, K. Jack, and . Wolf, On tail biting convolutional codes, IEEE Trans. Commun, vol.34, pp.104-111, 1986.