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

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationProceedings - International Conference on Signals and Systems, ICSigSys 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages123-127
Number of pages5
ISBN (Electronic)9781509067480
DOIs
StatePublished - 30 Jun 2017
Event1st IEEE International Conference on Signals and Systems, ICSigSys 2017 - Bali, Indonesia
Duration: 16 May 201718 May 2017

Publication series

NameProceedings - International Conference on Signals and Systems, ICSigSys 2017

Conference

Conference1st IEEE International Conference on Signals and Systems, ICSigSys 2017
CountryIndonesia
CityBali
Period16/05/1718/05/17

Keywords

  • Block codes
  • Complete decoder
  • Step-by-step decoding

Fingerprint Dive into the research topics of 'A New Step-by-Step Complete Decoding Algorithm for Binary Cyclic Codes'. Together they form a unique fingerprint.

Cite this