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.

Analysis and performance evaluation of new coding options for space telecommand links - Part I: AWGN channels / Marco, Baldi; Franco, Chiaraluce; Garello, Roberto; Nicola, Maturo; Ignacio Aguilar, Sanchez; Stefano, Cioni. - In: INTERNATIONAL JOURNAL OF SATELLITE COMMUNICATIONS AND NETWORKING. - ISSN 1542-0981. - (2015), pp. 509-525. [10.1002/sat.1092]

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

GARELLO, Roberto;
2015

Abstract

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.
File in questo prodotto:
File Dimensione Formato  
SAT1092.pdf

non disponibili

Tipologia: 2. Post-print / Author's Accepted Manuscript
Licenza: Non Pubblico - Accesso privato/ristretto
Dimensione 1.84 MB
Formato Adobe PDF
1.84 MB Adobe PDF   Visualizza/Apri   Richiedi una copia
Pubblicazioni consigliate

Caricamento pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11583/2591603
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo