Self-compensation technique for simplified belief-propagation algorithm
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
3072 | en_US |
dc.citation.issue |
6 | en_US |
dc.citation.spage |
3061 | en_US |
dc.citation.volume |
55 | en_US |
dc.citation.woscount |
3 | |
dc.contributor.author |
Liao, Yen-Chin | en_US |
dc.contributor.author |
Lin, Chien-Ching | en_US |
dc.contributor.author |
Chang, Hsie-Chia | en_US |
dc.contributor.author |
Liu, Chih-Wei | en_US |
dc.contributor.department |
電子工程學系及電子研究所 | zh_TW |
dc.contributor.department |
Department of Electronics Engineering and Institute of Electronics | en_US |
dc.date.accessioned |
2014-12-08T15:13:59Z | |
dc.date.available |
2014-12-08T15:13:59Z | |
dc.date.issued |
2007-06-01 | en_US |
dc.description.abstract |
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. | en_US |
dc.identifier.doi |
10.1109/TSP.2007.893976 | en_US |
dc.identifier.issn |
1053-587X | en_US |
dc.identifier.journal |
IEEE TRANSACTIONS ON SIGNAL PROCESSING | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1109/TSP.2007.893976 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/10765 | |
dc.identifier.wosnumber |
WOS:000246705500025 | |
dc.language.iso |
en_US | en_US |
dc.subject |
belief-propagation | en_US |
dc.subject |
dynamic normalization | en_US |
dc.subject |
iterative decoding | en_US |
dc.subject |
low-density parity-check (LDPC) codes | en_US |
dc.subject |
min-sum algorithm | en_US |
dc.subject |
self compensation | en_US |
dc.title |
Self-compensation technique for simplified belief-propagation algorithm | en_US |
dc.type |
Article | en_US |
檔案
- 000246705500025.pdf (880.6 KB, Adobe PDF)
所屬典藏: 期刊論文
引用此條目
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
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/10765