This 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.

Simple item page
dc.contributor.authorD'Souza, J.
dc.contributor.authorMaskara, S.L.
dc.date.accessioned2026-02-05T11:00:32Z
dc.date.issuedOn low complexity stack decoding of convolutional codes
dc.description.abstract1999
dc.identifier.citationIEEE Transactions on Communications, 1999, 47, 5, pp. 648-652
dc.identifier.issn906778
dc.identifier.urihttps://doi.org/10.1109/26.768752
dc.identifier.urihttps://idr.nitk.ac.in/handle/123456789/28036
dc.publisherIEEE
dc.subjectAlgorithms
dc.subjectComputational complexity
dc.subjectDecoding
dc.subjectSequential decoding
dc.subjectStack decoding
dc.subjectConvolutional codes
dc.titleThis 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.

Files

Collections

Journal Articles