.png){kind=icon}
Return
Soft-decision priority-first decoding algorithms for variable-length error-correcting codes
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2008.080561.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Joint source-channel decoding has recently received extensive attention due to the rise in the applications of multimedia wireless communication. Based on a code trellis rather than on a code tree, this work presents a maximum a posteriori (MAP) soft-decision priority-first decoding algorithm and its approximations for variable-length error-correcting codes. Simulation results indicate that for the code with average codeword length 6.269 bits and free distance 3, under moderate signal-to-noise ratio, one of the proposed algorithms almost reaches the lowest decoding complexity, and has nearly the same performance on symbol error probability as the MAP decoding.
Keywords:
variable-length error-correcting codes
MAP
soft-decision
joint source/channel coding
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W
Organization
Cited Papers
Low-complexity iterative joint source-channel decoding for variable-length encoded Markov sources
.png){kind=icon}
PREAI
ShareSave
ShareSaveShareSaveShareSaveFrom rift to foreland basin: A case example from the Magallanes‐Austral basin, southernmost Andes
PREAI
ShareSave no more
no more