DocumentCode
2469413
Title
Near optimally decoding long convolutional codes in short packet
Author
Wei, Lei
Author_Institution
Dept. of Eng., Australian Nat. Univ., Canberra, ACT, Australia
fYear
1998
fDate
16-21 Aug 1998
Firstpage
205
Abstract
We show that long convolutional codes can be near optimally decoded in a short packet format. This outperforms turbo codes and the Viterbi decoder by at least 0.5 dB on Gaussian channels
Keywords
Gaussian channels; channel coding; convolutional codes; decoding; 0.5 dB; Gaussian channels; long convolutional codes; near optimal decoding; performance; short packet format; Australia; Bidirectional control; Bit error rate; Convolutional codes; Decoding; Feeds; Gaussian channels; Turbo codes; Upper bound; Viterbi algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
Conference_Location
Cambridge, MA
Print_ISBN
0-7803-5000-6
Type
conf
DOI
10.1109/ISIT.1998.708806
Filename
708806
Link To Document