.png){kind=icon}
Return
A maximum-likelihood soft-decision sequential decoding algorithm for binary convolutional codes
.png){kind=icon}
PRE
AI
DOI：10.1109/26.983310.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this letter, we present a trellis-based maximum-likelihood soft-decision sequential decoding algorithm (MLSDA) for binary convolutional codes. Simulation results show that, for (2, 1, 6) and (2, 1, 16) codes antipodally transmitted over the AWGN channel, the average computational effort required by the algorithm is several orders of magnitude less than that of the Viterbi algorithm. Also shown via simulations upon the same system models is that, under moderate SNR, the algorithm is about four times faster than the conventional sequential decoding algorithm (i.e., stack algorithm with Fano metric) having comparable bit-error probability.
Keywords:
coding
convolutional codes
decoding
maximum-likelihood
sequential decoding
soft-decision
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
ShareSaveShareSavePrognostic roles of mRNA expression of notch receptors in non-small cell lung cancer.png)
Oncotarget
OAAI
OncotargetIF0
OAAIShareSaveShareSaveShareSaveShareSave no more
no more