Title :
Comparison of low complexity turbo-like coding structures
Author :
Nefedov, Nikolai
Author_Institution :
Commun. Lab., Helsinki Univ. of Technol., Espoo, Finland
Abstract :
In this paper we consider the serially concatenated codes where the inner code is an accumulator (rate 1 differential encoder). To compare different constructions we calculated the tangential sphere bounds on word and bit error probabilities for maximum likelihood (ML) decoding and used these bounds as references for simulations. Based on these studies we introduce novel turbo-like schemes called accumulated woven convolutional codes (AWCC) which in some cases provide advantages over considered turbo-like coding structures
Keywords :
concatenated codes; convolutional codes; error statistics; interleaved codes; maximum likelihood decoding; turbo codes; ML decoding; accumulated woven convolutional codes; bit error probability; inner code; low complexity; maximum likelihood decoding; moderate interleaver size; rate 1 differential encoder; serially concatenated codes; tangential sphere bounds; turbo-like coding structures; word error probability; Bit error rate; Concatenated codes; Convolutional codes; Equations; Error probability; Graphical models; Land mobile radio; Maximum likelihood decoding; Mobile communication; Quality of service;
Conference_Titel :
Communications, 2001. ICC 2001. IEEE International Conference on
Conference_Location :
Helsinki
Print_ISBN :
0-7803-7097-1
DOI :
10.1109/ICC.2001.936271
