Iterative multi-step decoding for a class of multi-step majority-logic decodable cyclic codes

Hsiu Chi Chang*, Hsie-Chia Chang

*Corresponding author for this work

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

Abstract

This paper presents an iterative multi-step decoding algorithm for a class of multi-step majority-logic (MS-MLG) decodable cyclic codes. The proposed algorithm is capable of efficient decoding the MS-MLG decodable cyclic codes with large number of short cycles of length 4. In addition, we decompose the parity-check matrices into several submatrices by utilizing the orthogonal structure of the codes. The decomposition scheme allows efficient decoding for MS-MLG decodable cyclic codes. Simulation results demonstrate that the MS-MLG decodable cyclic codes decoded with the proposed algorithm outperform BCH codes with similar lengths and rates decoded with the hard-decision algorithm.

Original languageEnglish
Title of host publicationInternational Symposium on Turbo Codes and Iterative Information Processing, ISTC
PublisherIEEE Computer Society
Pages32-36
Number of pages5
ISBN (Electronic)9781479959853
DOIs
StatePublished - 12 Nov 2014
Event2014 8th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2014 - Bremen, Germany
Duration: 18 Aug 201422 Aug 2014

Publication series

NameInternational Symposium on Turbo Codes and Iterative Information Processing, ISTC
ISSN (Print)2165-4700
ISSN (Electronic)2165-4719

Conference

Conference2014 8th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2014
Country/TerritoryGermany
CityBremen
Period18/08/1422/08/14

Fingerprint

Dive into the research topics of 'Iterative multi-step decoding for a class of multi-step majority-logic decodable cyclic codes'. Together they form a unique fingerprint.

Cite this