DocumentCode
2385021
Title
Analysis of the trellis complexity of interleavers and turbo codes
Author
Garello, Roberto ; Montorsi, Guido ; Benedetto, Sergio ; Cancellieri, Giovanni
Author_Institution
Dipt. di Elettronica e Autom., Ancona Univ., Italy
fYear
2000
fDate
2000
Firstpage
65
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
Keywords
block codes; computational complexity; interleaved codes; trellis codes; turbo codes; average complexity; causal interleavers; complexity reduction; coordinate permutation; input-output interleaver code; noncausal interleavers; trellis complexity; turbo codes; uniform interleaver; Block codes; Constraint theory; Convolutional codes; Electronic mail; State-space methods; Turbo codes;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2000. Proceedings. IEEE International Symposium on
Conference_Location
Sorrento
Print_ISBN
0-7803-5857-0
Type
conf
DOI
10.1109/ISIT.2000.866355
Filename
866355
Link To Document