A truncated best-path algorithm

DOI10.1109/26.668716MaRDI QIDQ2714765zbMATH OpenOpenAlexFDO

Authors David Kwan, Samir Kallel

Publication date 14 August 2001

Published in IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/26.668716

zbMATH Keywords

best-path algorithmconcatenated codingconvolutional codesMAP estimationmaximum-likelihood decodingsoft-outcome decodingsymbol probabilitiestrellis codesViterbi decoding

Mathematics Subject Classification ID

Convolutional codes (94B10) Combined modulation schemes (including trellis codes) in coding theory (94B12) Decoding (94B35)

Recommendations

• scientific article; zbMATH DE number 484156
• A posteriori probability decoding of convolutional codes
• Viterbi algorithm for decoding of convolutional codes in a system with decision feedback
• A parallel Viterbi decoding algorithm
• A soft output hybrid algorithm for ML/MAP sequence estimation

This page was built for publication: A truncated best-path algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2714765)