Archivio Istituzionale della RicercaThe trellis complexity of causal and noncausal interleavers are studied via the introduction of the input-output interleaver code. The “average” complexity of a uniform interleaver is computed. The trellis complexity of a turbo code is then tied to the complexity of the constituent interleaver. A procedure of complexity reduction by coordinate permutation is also presented, together with some examples of its application.
Analysis of the trellis complexity of interleavers and turbocodes / Garello, Roberto; Montorsi, Guido; Benedetto, Sergio; G., Cancellieri. - (2000), pp. 65-65. (Intervento presentato al convegno IEEE International Symposium on Information Theory tenutosi a Sorrento (ITA) nel 25-30 Jun 2000) [10.1109/ISIT.2000.866355].
Analysis of the trellis complexity of interleavers and turbocodes
GARELLO, Roberto;MONTORSI, Guido;BENEDETTO, Sergio;
2000
Abstract
The trellis complexity of causal and noncausal interleavers are studied via the introduction of the input-output interleaver code. The “average” complexity of a uniform interleaver is computed. The trellis complexity of a turbo code is then tied to the complexity of the constituent interleaver. A procedure of complexity reduction by coordinate permutation is also presented, together with some examples of its application.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11583/1414291
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo