Please use this identifier to cite or link to this item: https://idr.l1.nitk.ac.in/jspui/handle/123456789/12363
Full metadata record
DC FieldValueLanguage
dc.contributor.authorD'Souza, J.-
dc.contributor.authorMaskara, S.L.-
dc.date.accessioned2020-03-31T08:39:05Z-
dc.date.available2020-03-31T08:39:05Z-
dc.date.issued1999-
dc.identifier.citationIEEE Transactions on Communications, 1999, Vol.47, 5, pp.648-652en_US
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/12363-
dc.description.abstractThis letter presents techniques for improving the distribution of the number of stack entries, for stack sequential decoding over 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 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.en_US
dc.titleOn low complexity stack decoding of convolutional codesen_US
dc.typeArticleen_US
Appears in Collections:1. Journal Articles

Files in This Item:
File Description SizeFormat 
12363.pdf113.91 kBAdobe PDFThumbnail
View/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.