Self-compensation technique for simplified belief-propagation algorithm

檔案

日期

2007-06-01

類型

期刊名稱

IEEE TRANSACTIONS ON SIGNAL PROCESSING

卷期與頁次

第 55 卷第 6 期,頁 3061–3072

ISSN

1053-587X

語言

英文

摘要

The min-sum algorithm is the most common method to simplify the belief-propagation algorithm for decoding low-density parity-check (LDPC) codes. However, there exists a performance gap between the min-sum and belief-propagation algorithms due to nonlinear approximation. In this paper, a self-compensation technique using dynamic normalization is thus proposed to improve the approximation accuracy. The proposed scheme scales the min-sum algorithm by a dynamic factor that can be derived theoretically from order statistics. Moreover, applying the proposed technique to several LDPC codes for DVB-S2 system, the average signal-to-noise ratio degradation, which results from approximation inaccuracy and quantization error, is reduced to 0.2 dB. Not only does it enhance the error-correcting capability of the min-sum algorithm, but the proposed self-compensation technique also preserves a modest hardware cost. After realized with 0.13-mu m standard cell library, the dynamic normalization requires about 100 additional gates for each check,node unit in the min-sum algorithm.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Liao, Y.-C., Lin, C.-C., Chang, H.-C., & Liu, C.-W. (2007). Self-compensation technique for simplified belief-propagation algorithm. IEEE TRANSACTIONS ON SIGNAL PROCESSING, 55(6), 3061–3072. https://doi.org/10.1109/TSP.2007.893976

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/10765