DocumentCode
3122119
Title
Low complexity syndrome based decoding of Turbo codes
Author
Geldmacher, Jan ; Hueske, Klaus ; Götze, Jürgen ; Kosakowski, Martin
Author_Institution
Inf. Process. Lab., Tech. Univ. Dortmund, Dortmund, Germany
fYear
2012
fDate
1-6 July 2012
Firstpage
2371
Lastpage
2375
Abstract
A new syndrome trellis based decoding approach for Turbo coded data is described in this paper. Based on estimating error symbols instead of code symbols, it inherently features options for reducing the computational complexity of the decoding process. After deriving required transition metrics, numerical results in terms of block error rate and required equivalent iterations are presented to demonstrate the efficiency of the approach.
Keywords
computational complexity; decoding; error detection codes; trellis codes; turbo codes; block error rate; computational complexity; equivalent iterations; estimating error symbols; low complexity syndrome based decoding; syndrome trellis based decoding approach; turbo codes; Complexity theory; Convolutional codes; Iterative decoding; Maximum likelihood decoding; Signal to noise ratio; Systematics;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on
Conference_Location
Cambridge, MA
ISSN
2157-8095
Print_ISBN
978-1-4673-2580-6
Electronic_ISBN
2157-8095
Type
conf
DOI
10.1109/ISIT.2012.6283938
Filename
6283938
Link To Document