We analyze the performance of two short low-density parity-check codes recently proposed for updating the telecommand standard for space links. We show that the most reliable basis decoding algorithm can be efficiently applied to these codes, permitting us to achieve a significant coding gain with respect to more conventional iterative algorithms. In particular, in order to maintain limited complexity, we suggest to use a hybrid approach, that combines the two decoding procedures in a sequential manner. Thinking in terms of practical implementation, we also investigate the impact of quantization, by considering two different quantization laws and comparing their performance.
On the applicability of the most reliable basis algorithm for LDPC decoding in telecommand links / Baldi, Marco; Maturo, Nicola; Paolini, Enrico; Chiaraluce, Franco. - STAMPA. - (2015), pp. 7103192.1-7103192.6. (Intervento presentato al convegno 6th International Conference on Information and Communication Systems, ICICS 2015 tenutosi a Jordan University of Science and Technology, jor nel 2015) [10.1109/IACS.2015.7103192].
On the applicability of the most reliable basis algorithm for LDPC decoding in telecommand links
PAOLINI, ENRICO;
2015
Abstract
We analyze the performance of two short low-density parity-check codes recently proposed for updating the telecommand standard for space links. We show that the most reliable basis decoding algorithm can be efficiently applied to these codes, permitting us to achieve a significant coding gain with respect to more conventional iterative algorithms. In particular, in order to maintain limited complexity, we suggest to use a hybrid approach, that combines the two decoding procedures in a sequential manner. Thinking in terms of practical implementation, we also investigate the impact of quantization, by considering two different quantization laws and comparing their performance.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
