.png){kind=icon}
.png){kind=icon}
Return
A truncated best-path algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/26.668716.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A variant of the best-path (BP) algorithm that can be used for deducing a posteriori symbol probabilities for input sequences of unlimited length is proposed. Decoders using the proposed algorithm have fixed memory requirements and fixed decoding delays regardless of the length of the transmitted sequence. This is made possible by utilizing the Viterbi algorithm's ability to self-initialize itself and by segmenting the decoding process.
Keywords:
concatenated coding
convolutional codes
MAP estimation
maximum-likelihood decoding
soft-output decoding
trellis codes
Viterbi decoding
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