A New Step-by-Step Complete Decoding Algorithm for Binary Cyclic Codes

Yunghsiang S. Han, Shu Wei Fu, Po-Ning Chen

研究成果: Conference contribution同行評審

摘要

A complete decoder is one that guarantees to decode a received vector to its nearest codeword. For the design of an efficient complete decoding algorithm, storage demand and decoding complexity are two essential factors. Along this consideration, the Zero-Guards algorithm provides a significant improvement as the number of vectors required to be stored has been made much less than what is required by the conventional standard array decoding. When being applied to certain block codes, however, it may be inefficient when code length is short. At this background, a new step-by-step complete decoding algorithm for cyclic codes is proposed in this work. Based on a newly devised transfer function, our algorithm can achieve a better decoding efficiency than the Zero-Guards algorithm, while keeping a smaller number of vectors for most of the cyclic codes examined.

原文English
主出版物標題Proceedings - International Conference on Signals and Systems, ICSigSys 2017
發行者Institute of Electrical and Electronics Engineers Inc.
頁面123-127
頁數5
ISBN(電子)9781509067480
DOIs
出版狀態Published - 30 6月 2017
事件1st IEEE International Conference on Signals and Systems, ICSigSys 2017 - Bali, 印度尼西亞
持續時間: 16 5月 201718 5月 2017

出版系列

名字Proceedings - International Conference on Signals and Systems, ICSigSys 2017

Conference

Conference1st IEEE International Conference on Signals and Systems, ICSigSys 2017
國家/地區印度尼西亞
城市Bali
期間16/05/1718/05/17

指紋

深入研究「A New Step-by-Step Complete Decoding Algorithm for Binary Cyclic Codes」主題。共同形成了獨特的指紋。

引用此