Archivio Istituzionale della RicercaIn this paper, we propose a new solution to parallel concatenation of trellis codes with multilevel amplitude/phase modulations and a suitable bit by bit iterative decoding structure. Examples are given for throughput 2 and 4 bits/sec/Hz with 8 PSK, 16 QAM, and 64 QAM modulations. For parallel concatenated trellis codes in the examples, rate 2/3 and 4/5, 8, and 16-state binary convolutional codes with Ungerboeck mapping by set partitioning (natural mapping), a reordered mapping, and Gray code mapping are used. The performance of these codes is within 1 dB from the Shannon limit at a bit error probability of 10 -7 for a given throughput, which outperforms the performance of all codes reported in the past for the same throughput.
Parallel concatenated trellis coded modulation / Benedetto, S.; Divsalar, D.; Montorsi, Guido; Pollara, F.. - 2:(1996), pp. 974-978. (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.541356].
Parallel concatenated trellis coded modulation
MONTORSI, Guido;
1996
Abstract
In this paper, we propose a new solution to parallel concatenation of trellis codes with multilevel amplitude/phase modulations and a suitable bit by bit iterative decoding structure. Examples are given for throughput 2 and 4 bits/sec/Hz with 8 PSK, 16 QAM, and 64 QAM modulations. For parallel concatenated trellis codes in the examples, rate 2/3 and 4/5, 8, and 16-state binary convolutional codes with Ungerboeck mapping by set partitioning (natural mapping), a reordered mapping, and Gray code mapping are used. The performance of these codes is within 1 dB from the Shannon limit at a bit error probability of 10 -7 for a given throughput, which outperforms the performance of all codes reported in the past for the same throughput.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11583/1414309
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo