Deep space communications require error correction codes able to reach extremely low bit-error-rates, possibly with a steep waterfall region and without error floor. Several schemes have been proposed in the literature to achieve these goals. Most of them rely on the concatenation of different codes that leads to high hardware implementation complexity and poor resource sharing. This work proposes a scheme based on the concatenation of non-custom LDPC and turbo codes that achieves excellent error correction performance. Moreover, since both LDPC and turbo codes can be decoded with the BCJR algorithm, our preliminary results show that an efficient hardware architecture with high resource reuse can be designed.
Concatenated Turbo/LDPC codes for deep space communications: performance and implementation / Condo C.. - ELETTRONICO. - (2013), pp. 1-6. ((Intervento presentato al convegno SPACOMM 2013 tenutosi a Mestre nel 21-26 Aprile 2013.
Titolo: | Concatenated Turbo/LDPC codes for deep space communications: performance and implementation | |
Autori: | ||
Data di pubblicazione: | 2013 | |
Abstract: | Deep space communications require error correction codes able to reach extremely low bit-error-ra...tes, possibly with a steep waterfall region and without error floor. Several schemes have been proposed in the literature to achieve these goals. Most of them rely on the concatenation of different codes that leads to high hardware implementation complexity and poor resource sharing. This work proposes a scheme based on the concatenation of non-custom LDPC and turbo codes that achieves excellent error correction performance. Moreover, since both LDPC and turbo codes can be decoded with the BCJR algorithm, our preliminary results show that an efficient hardware architecture with high resource reuse can be designed. | |
ISBN: | 9781612082646 | |
Appare nelle tipologie: | 4.1 Contributo in Atti di convegno |
File in questo prodotto:
File | Descrizione | Tipologia | Licenza | |
---|---|---|---|---|
LDPCturboConcat.pdf | 1. Preprint / submitted version [pre- review] | PUBBLICO - Tutti i diritti riservati | Visibile a tuttiVisualizza/Apri |
http://hdl.handle.net/11583/2507647