Error correcting codes in telecommand and telemetry for European Space Agency missions: An overview and new perspectives

Error correcting codes have always played a prominent role in the definition of secure and reliable space missions. Both telecommand (TC) and telemetry (TM) have benefited by the introduction of suitable co/decoding schemes, ranging from classic Bose-Chaudhuri-Hocquenghem, Reed-Solomon and convolutional codes to more recent state-of-the art codes based on soft-decision and iterative decoding. As a matter of fact, space TM was one of the first scenarios to propose implementation of the concept of turbo coding that, since twenty years, has traced a new paradigm in the field of error correction. At present the scene is dominated by low-density parity-check codes and these are being progressively included in the design of future missions, in either deep-space or near-Earth scenarios, for the possibility they offer to increase the data rate and/or to reduce the signal-to-noise ratio. The European Space Agency is very active in the field and continuously gives relevant contributions to the standardization activities within the Consultative Committee for Space Data Systems. This paper provides an overview of the error correcting codes included in the current TC and TM recommendations and discusses the new solutions recently proposed in view of most demanding missions, also able to operate in hostile environments like, for example, in the presence of jamming.

[1]  Dariush Divsalar,et al.  The Development of Turbo and LDPC Codes for Deep-Space Applications , 2007, Proceedings of the IEEE.

[2]  F. Pollara,et al.  Bounded angle iterative decoding of LDPC codes , 2008, MILCOM 2008 - 2008 IEEE Military Communications Conference.

[3]  G. David Forney,et al.  Convolutional Codes III. Sequential Decoding , 1974, Inf. Control..

[4]  Marco Chiani,et al.  Non‐binary protograph low‐density parity‐check codes for space communications , 2012, Int. J. Satell. Commun. Netw..

[5]  Marc P. C. Fossorier,et al.  Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices , 2004, IEEE Trans. Inf. Theory.

[6]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[7]  David Declercq,et al.  Decoding Algorithms for Nonbinary LDPC Codes Over GF$(q)$ , 2007, IEEE Transactions on Communications.

[8]  Roberto Garello,et al.  Turbo Code Applications on Telemetry and Deep Space Communications , 2005 .

[9]  Marco Chiani,et al.  Channel Coding for Future Space Missions: New Requirements and Trends , 2007, Proceedings of the IEEE.

[10]  Roberto Garello,et al.  Chapter 13: Turbo Code Applications on Telemetry and Deep Space Communications , 2005 .

[11]  Christoforos N. Hadjicostis,et al.  Soft-Decision Decoding Using Ordered Recodings on the Most Reliable Basis , 2007, IEEE Transactions on Information Theory.

[12]  Marco Baldi,et al.  On a Family of Circulant Matrices for Quasi-Cyclic Low-Density Generator Matrix Codes , 2011, IEEE Transactions on Information Theory.

[13]  A. Glavieux,et al.  Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[14]  Green Book,et al.  TM SYNCHRONIZATION AND CHANNEL CODING — SUMMARY OF CONCEPT AND RATIONALE , 2006 .

[15]  Dariush Divsalar,et al.  Capacity-approaching protograph codes , 2009, IEEE Journal on Selected Areas in Communications.

[16]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[17]  Blue Book,et al.  TM SYNCHRONIZATION AND CHANNEL CODING , 2011 .

[18]  Roberto Garello,et al.  Computing the free distance of turbo codes and serially concatenated codes with interleavers: algorithms and applications , 2001, IEEE J. Sel. Areas Commun..

[19]  John Cocke,et al.  Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[20]  Dariush Divsalar,et al.  Changing the Coding System on a Spacecraft in Flight , 1993, Proceedings. IEEE International Symposium on Information Theory.

[21]  Van Nostrand,et al.  Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm , 1967 .

[22]  David J. C. MacKay,et al.  Good Error-Correcting Codes Based on Very Sparse Matrices , 1997, IEEE Trans. Inf. Theory.

[23]  Stefano Cioni,et al.  Advanced Coding Schemes against Jamming in Telecommand Links , 2013, MILCOM 2013 - 2013 IEEE Military Communications Conference.

[24]  Stefano Cioni,et al.  Advanced Channel Coding for Space Mission Telecommand Links , 2013, 2013 IEEE 78th Vehicular Technology Conference (VTC Fall).

[25]  Andres I. Vila Casado,et al.  The all-zero iterative decoding algorithm for turbo code minimum distance computation , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[26]  C. Shannon Probability of error for optimal codes in a Gaussian channel , 1959 .