arrow
返回

Decoding low density parity check codes with finite quantization bits

delete2000-02-01
delete75
PRE
AI
李平 (Li Ping) *
W
W.K. Leung
DOI:10.1109/4234.824757delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
This letter is concerned with the implementation issue of the sum-product algorithm (SPA) for decoding the low density parity check codes, It is shown that the direct implementation of the original form of SPA is sensitive to the quantization effect. We propose a parity likelihood ratio technique to overcome the problem. It is shown that for comparable performance the new method can be implemented with much less quantization bits, which can lead to considerably lower decoding cost.
Keyword:
error correcting codes
low density parity check codes
turbo codes

期刊

IEEE Communications Letters 封面图
IEEE Communications Letters
IF:
4.4
论文数:
1.3W
被引数:
2.2W

机构

暂无机构信息
引用论文

引用论文

Helisterculins A and B, Two New (7.5′,8.2′)-Neolignans, and Helisorin, the First (6.4′,7.5′,8.2′)-Neolignan, from the Indonesian Medicinal PlantHelicteres isora
err1999-03-10
err0
PREAI
errYasuhiro Tezuka; Masataka Terazono; Tomoco I. Kusumoto; Yukiko Kawashima; Yasumaru Hatanaka; Shigetoshi Kadota; Masao Hattori; Tsuneo Namba; Tohru Kikuchi; Ken Tanaka; Sutardjo Supriyatna
err分享
err收藏
没有更多内容