An Iterative Soft-decision Decoding Algorithm for Reed-Solomon Codes

檔案

本條目沒有附加檔案。

日期

2017-01-01

期刊名稱

2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT)

卷期與頁次

頁 2775–2779

語言

英文

摘要

This paper proposes an iterative soft-decision decoding algorithm for Reed-Solomon (RS) codes. The proposed decoding algorithm combines the concepts of adapting the parity-check matrix and informed dynamic scheduling decoding. The parity-check matrix is re-arranged before each iteration, where the systematic part is mapped to the least reliable bits, consequently reducing their influence on the other bits. Using dynamic scheduling, the more important decoding messages are updated to these least reliable bits, meaning that the majority of the error bits with low reliability can be corrected. When the proposed integrated decoding is applied to (255, 239) RS code, the difference between its frame error rate performance (FER) and the maximum-likelihood (ML) bound can be reduced to 0.8 dB, and a gain of about 0.1 dB is achieved compared to all the previously recorded soft-decision decoding for RS codes.

所屬典藏

會議論文
顯示完整詮釋資料 統計資料

引用此條目

Lee, H.-C., Wu, J.-H., Wang, C.-H., & Ueng, Y.-L. (2017). An Iterative Soft-decision Decoding Algorithm for Reed-Solomon Codes. 2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2775–2779. https://ir.lib.nycu.edu.tw/handle/11536/147229

BibTeX RIS

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

分享

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