DocumentCode
1516831
Title
On low complexity stack decoding of convolutional codes
Author
D´Souza, J. ; Maskara, S.L.
Author_Institution
Dept. of Electron. & Electr. Commun. Eng., Indian Inst. of Technol., Kharagpur, India
Volume
47
Issue
5
fYear
1999
fDate
5/1/1999 12:00:00 AM
Firstpage
648
Lastpage
652
Abstract
This article presents techniques for improving the distribution of the number of stack entries, for stack sequential decoding over a hard quantized channel, with emphasis on high rate codes. It is shown that, for a class of high rate b/(b+1) codes, a table-based true high rate approach can be easily implemented for obtaining a decoding advantage over the punctured approach. Modified algorithms, which significantly improve the distribution of the number of stack entries and decoding time, are proposed for rate 1/N codes and high rate b/(b+1) codes
Keywords
computational complexity; convolutional codes; quantisation (signal); sequential decoding; telecommunication channels; convolutional codes; decoding time; hard quantized channel; high rate codes; low complexity stack decoding; modified algorithms; punctured approach; sequential decoding; stack entries distribution; table-based true high rate approach; Communications Society; Convolutional codes; Decoding;
fLanguage
English
Journal_Title
Communications, IEEE Transactions on
Publisher
ieee
ISSN
0090-6778
Type
jour
DOI
10.1109/26.768752
Filename
768752
Link To Document