Iterative Decoding Algorithms for a Class of Non-Binary Two-Step Majority-Logic Decodable Cyclic Codes
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
1789 | en_US |
dc.citation.issue |
6 | en_US |
dc.citation.spage |
1779 | en_US |
dc.citation.volume |
62 | en_US |
dc.citation.woscount |
0 | |
dc.contributor.author |
Chang, Hsiu-Chi | en_US |
dc.contributor.author |
Chang, Hsie-Chia | 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:36:20Z | |
dc.date.available |
2014-12-08T15:36:20Z | |
dc.date.issued |
2014-06-01 | en_US |
dc.description.abstract |
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. | en_US |
dc.identifier.doi |
10.1109/TCOMM.2014.2320508 | en_US |
dc.identifier.issn |
0090-6778 | en_US |
dc.identifier.journal |
IEEE TRANSACTIONS ON COMMUNICATIONS | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1109/TCOMM.2014.2320508 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/24679 | |
dc.identifier.wosnumber |
WOS:000338029200003 | |
dc.language.iso |
en_US | en_US |
dc.subject |
Extended min-sum algorithm | en_US |
dc.subject |
majority-logic decoding | en_US |
dc.subject |
non-binary LDPC codes | en_US |
dc.subject |
cyclic codes | en_US |
dc.title |
Iterative Decoding Algorithms for a Class of Non-Binary Two-Step Majority-Logic Decodable Cyclic Codes | en_US |
dc.type |
Article | en_US |
檔案
- 000338029200003.pdf (812.4 KB, Adobe PDF)
所屬典藏: 期刊論文
引用此條目
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
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/24679