Iterative Decoding Algorithms for a Class of Non-Binary Two-Step Majority-Logic Decodable Cyclic Codes

檔案

日期

2014-06-01

類型

期刊名稱

IEEE TRANSACTIONS ON COMMUNICATIONS

卷期與頁次

第 62 卷第 6 期,頁 1779–1789

ISSN

0090-6778

語言

英文

摘要

This paper presents two iterative decoding algorithms for a class of non-binary two-step majority-logic (NB-TS-MLG) decodable cyclic codes. A partial parallel decoding scheme is also introduced to provide a balanced trade-off between decoding speed and storage requirements. Unlike non-binary one-step MLG decodable cyclic codes, the Tanner graphs of which are 4-cycle-free, NB-TS-MLG decodable cyclic codes contain a large number of short cycles of length 4, which tend to degrade decoding performance. The proposed algorithms utilize the orthogonal structure of the parity-check matrices of the codes to resolve the degrading effects of the short cycles of length 4. Simulation results demonstrate that the NB-TS-MLG decodable cyclic codes decoded with the proposed algorithms offer coding gains as much as 2.5 dB over Reed-Solomon codes of the same lengths and rates decoded with either hard-decision or algebraic soft decision decoding.

所屬典藏

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

引用此條目

Chang, H.-C., & Chang, H.-C. (2014). Iterative Decoding Algorithms for a Class of Non-Binary Two-Step Majority-Logic Decodable Cyclic Codes. IEEE TRANSACTIONS ON COMMUNICATIONS, 62(6), 1779–1789. https://doi.org/10.1109/TCOMM.2014.2320508

BibTeX RIS

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

分享

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