logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

Error restricted fast MAP decoding of VLC

delete2005-10-01
delete6
PRE
AI
M
Ming Jia *
J
Jiangtao Wen
S
Shaozhi Ye
X
Xing Li
DOI：10.1109/LCOMM.2005.10005delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Joint source channel techniques based on Variable-Length Coding (VLC) have been widely used. One of the most famous VLC decoders is optimal Maximum A Posteriori (MAP) decoder based on directed graph search and soft-input theory. Due to the high complexity of directed graph search, many reduced complexity methods have been proposed. In this paper, we propose two error restricted algorithms for fast MAP decoding of VLC and compare them with three existing methods. Simulation results show that our methods outperform existing methods in terms of decoding complexity with nearly the same performance on Symbol Error Rate (SER) of optimal decoding. When used in a larger codeword set, the superiority in decoding complexity of our methods is more remarkable.
Keywords:
joint source-channel decoding
MAP estimation
SISO decoding
variable length code

Journal

IEEE Communications Letters cover
IEEE Communications Letters
IF:
4.4
Papers:
1.3W
Citations:
2.2W

Organization

No organization information available