.png){kind=icon}
Return
On low complexity stack decoding of convolutional codes
.png){kind=icon}
PRE
AI
DOI：10.1109/26.768752.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
convolutional codes
sequential decoding
stack algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.3
Papers:
1.2W
Citations:
3.6W
Organization
No organization information available
Cited Papers
ShareSaveStructural Basis of the Ferrous Iron Specificity of the Yeast Ferroxidase, Fet3p.png)
Biochemistry
BiochemistryIF0
PREAI
ShareSaveShareSave
no more
no more