We propose new decoding algorithms to be embedded in the iterative decoding strategy of parallel concatenated convolutional codes. They are derived from the optimum maximum-a-posteriori algorithm and permit a continuous decoding of the coded sequence without requiring trellis termination of the constituent codes. Two basic versions of the continuous algorithm and their suboptimum simplifications are described. Simulation results refer to the applications of the new algorithms to a highly efficient rate 1/3 concatenated code; they show performance only 0.6 dB worse than the Shannon limit.
Soft-output decoding algorithms for continuous decoding of parallel concatenated convolutional codes / Benedetto, S.; Divsalar, D.; Montorsi, Guido; Pollara, F.. - 1:(1996), pp. 112-117. (Intervento presentato al convegno IEEE International Conference on Communications 1996, ICC '96 tenutosi a Dallas, TX nel 23-27 Jun 1996) [10.1109/ICC.1996.540255].
Soft-output decoding algorithms for continuous decoding of parallel concatenated convolutional codes
MONTORSI, Guido;
1996
Abstract
We propose new decoding algorithms to be embedded in the iterative decoding strategy of parallel concatenated convolutional codes. They are derived from the optimum maximum-a-posteriori algorithm and permit a continuous decoding of the coded sequence without requiring trellis termination of the constituent codes. Two basic versions of the continuous algorithm and their suboptimum simplifications are described. Simulation results refer to the applications of the new algorithms to a highly efficient rate 1/3 concatenated code; they show performance only 0.6 dB worse than the Shannon limit.Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11583/1414306
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo