We compare the convergence thresholds of parallel and serially concatenated codes with interleaver that employ iterative decoding algorithms working at bit or symbol level. The analysis technique is an extension to that of the symbol-level decoder presented by S. ten Brink (see Electron. Lett., vol.35, no.10, p.806-8, 1999), and is valid for very large interleavers. The comparison shows that working at symbol level always yields a lower convergence threshold. In the serial concatenation, the advantage is quite significant.
Convergence properties of iterative decoders working at bit and symbol level / Scanavino, Bartolo; Montorsi, Guido; Benedetto, Sergio. - 2:(2001), pp. 1037-1041. (Intervento presentato al convegno Global Telecommunications Conference, 2001. GLOBECOM '01. IEEE tenutosi a San Antonio, TX nel November 2001) [10.1109/GLOCOM.2001.965577].
Convergence properties of iterative decoders working at bit and symbol level
SCANAVINO, Bartolo;MONTORSI, Guido;BENEDETTO, Sergio
2001
Abstract
We compare the convergence thresholds of parallel and serially concatenated codes with interleaver that employ iterative decoding algorithms working at bit or symbol level. The analysis technique is an extension to that of the symbol-level decoder presented by S. ten Brink (see Electron. Lett., vol.35, no.10, p.806-8, 1999), and is valid for very large interleavers. The comparison shows that working at symbol level always yields a lower convergence threshold. In the serial concatenation, the advantage is quite significant.Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11583/1419410
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo