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

Reliability-based iterative decoding of LDPC codes using likelihood accumulation

delete2007-08-01
delete24
PRE
AI
M
Ming Jiang *
C
Chunming Zhao
L
Li Zhang
DOI：10.1109/LCOMM.2007.070450delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
In this work, we present an improvement on low complexity serial concatenation of belief propagation (BP) order statistic decoding (OSD) algorithm for low-density parity-check (LDPC) codes. We introduce a more reliable method to reconstruct ordered information sequence in terms of the accumulated log-likelihood ratio (LLR) transitions of variable nodes. We give a general expression for both the existing BPOSD algorithm and our proposed, new method according to a structure similar to an infinite impulse response (IIR) filter. This improved algorithm achieves noticeable performance gains with only modest increase in computation complexity.
Keywords:
low-density parity-check codes
accumulated log-likelihood ratio
reliability decoding

Journal

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

Organization

No organization information available