Analysis and performance evaluation of new coding options for space telecommand links - Part I: AWGN channels

We investigate and compare, over the additive white Gaussian noise channel, different options for updating the error correcting code currently used in space mission telecommand links. Besides some more consolidated proposals, using low-density parity-check codes, we characterize and assess the performance of alternative schemes, based on parallel turbo codes and soft-decision decoded BCH codes. The analysis considers relevant metrics AQ2 like the codeword error rate, the frame error rate, and the undetected frame error rate. The considered codes include binary and non-binary low-density parity-check codes, parallel turbo codes and extended BCH codes, with different decoding algorithms. The complexity of the various schemes and possible limits for their application are considered and discussed. Several numerical examples are provided

[1]  Yuli You.  Joint Channel Coding , 2010 .

[2]  Torleiv Kløve,et al.  Exact and Approximate Expressions for the Probability of Undetected Errors of Varshamov–Tenengol'ts Codes , 2008, IEEE Transactions on Information Theory.

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

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

[5]  Igal Sason,et al.  An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels , 2006, IEEE Transactions on Information Theory.

[6]  Roberto Garello,et al.  MHOMS: high-speed ACM modem for satellite applications , 2005, IEEE Wireless Communications.

[7]  Ramesh Pyndiah,et al.  New Approach to Order Statistics Decoding of Long Linear Block Codes , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[8]  Marco Chiani,et al.  Turbo Codes Based on Time-Variant Memory-1 Convolutional Codes over Fq , 2011, 2011 IEEE International Conference on Communications (ICC).

[9]  Marc P. C. Fossorier,et al.  Box and match techniques applied to soft-decision decoding , 2002, IEEE Transactions on Information Theory.

[10]  Marco Chiani,et al.  Codes on high-order fields for the CCSDS next generation uplink , 2012, 2012 6th Advanced Satellite Multimedia Systems Conference (ASMS) and 12th Signal Processing for Space Communications Workshop (SPSC).

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

[12]  Marc P. C. Fossorier,et al.  Sphere-packing bounds revisited for moderate block lengths , 2004, IEEE Transactions on Information Theory.

[13]  Jing Sun,et al.  Interleavers for turbo codes using permutation polynomials over integer rings , 2005, IEEE Transactions on Information Theory.

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

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

[16]  Shu Lin,et al.  Soft-decision decoding of linear block codes based on ordered statistics , 1994, IEEE Trans. Inf. Theory.

[17]  Frank R. Kschischang,et al.  On the trellis structure of block codes , 1994, IEEE Trans. Inf. Theory.

[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]  Shigeichi Hirasawa,et al.  Fast Algorithm for Generating Candidate Codewords in Reliability-Based Maximum Likelihood Decoding , 2005, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..