Please use this identifier to cite or link to this item:
https://idr.l2.nitk.ac.in/jspui/handle/123456789/12363Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | D'Souza, J. | - |
| dc.contributor.author | Maskara, S.L. | - |
| dc.date.accessioned | 2020-03-31T08:39:05Z | - |
| dc.date.available | 2020-03-31T08:39:05Z | - |
| dc.date.issued | 1999 | - |
| dc.identifier.citation | IEEE Transactions on Communications, 1999, Vol.47, 5, pp.648-652 | en_US |
| dc.identifier.uri | http://idr.nitk.ac.in/jspui/handle/123456789/12363 | - |
| dc.description.abstract | 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. | en_US |
| dc.title | On low complexity stack decoding of convolutional codes | en_US |
| dc.type | Article | en_US |
| Appears in Collections: | 1. Journal Articles | |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.