DocumentCode :
2624104
Title :
Search methods for rate 1/N convolutional codes used in concatenated systems
Author :
Paaske, Erik ; Jensen, Ole Riis
Author_Institution :
Inst. of Circuit Theory & Telecommun., Tech. Univ. Denmark, Lyngby, Denmark
fYear :
1994
fDate :
27 Jun-1 Jul 1994
Firstpage :
277
Abstract :
Different criteria for selection of good convolutional codes have been tested and the interesting conclusion is that the Viterbi bound on BER evaluated at a higher Eb/N0 value is the best guide when selecting codes for use on low Eb/N0 channels
Keywords :
channel capacity; channel coding; coding errors; concatenated codes; convolutional codes; error statistics; maximum likelihood estimation; search problems; telecommunication channels; BER; Viterbi bound; concatenated coding systems; convolutional codes; low SNR channels; search methods; Bit error rate; Circuit testing; Circuit theory; Concatenated codes; Convolutional codes; Reed-Solomon codes; Search methods; Signal to noise ratio; Upper bound; Viterbi algorithm;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on
Conference_Location :
Trondheim
Print_ISBN :
0-7803-2015-8
Type :
conf
DOI :
10.1109/ISIT.1994.395017
Filename :
395017
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=2624104
بازگشت