DocumentCode :
1643327
Title :
Recursive flexible convolutional encoders for parallel concatenation
Author :
Katsiotis, Alexandros ; Kalouptsidis, Nicholas ; Rizomiliotis, Panagiotis
Author_Institution :
Univ. of Athens, Athens, Greece
fYear :
2012
Firstpage :
250
Lastpage :
254
Abstract :
In this paper, path pruning and puncturing are employed for the construction of recursive systematic convolutional encoders that can vary both their rate and decoding complexity. The basic goal is to use the resulting encoders in parallel concatenated coding schemes, leading to flexible turbo code constructions. A family of good constituent encoders is provided. Simulation results indicate that with the proposed method, in various SNR ranges, a decrease in computational complexity can result even in an increase in performance.
Keywords :
computational complexity; concatenated codes; convolutional codes; decoding; SNR ranges; computational complexity; decoding complexity; flexible turbo code constructions; parallel concatenated coding schemes; parallel concatenation; path pruning; path puncturing; recursive flexible convolutional encoders; recursive systematic convolutional encoders; Computational complexity; Convolutional codes; Decoding; Signal to noise ratio; Systematics; Turbo codes;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Turbo Codes and Iterative Information Processing (ISTC), 2012 7th International Symposium on
Conference_Location :
Gothenburg
ISSN :
2165-4700
Print_ISBN :
978-1-4577-2114-4
Electronic_ISBN :
2165-4700
Type :
conf
DOI :
10.1109/ISTC.2012.6325237
Filename :
6325237
Link To Document :
بازگشت