An Iterative Hard and Soft Decision Decoding Algorithm for Cyclic Codes

Inhalt:
Cyclic codes have the advantage that only a generator polynomial is necessary for encoding. However, they are not used because for their competitors very good hard and soft iterative decoding is known. We present a novel decoding scheme for hard and soft decision decoding of cyclic codes. Proper cyclic shifts and componentwise counting of these shifts are exploited. This gives reliability information which can be the basis for various variants of decoding algorithms. Some decoding concepts and open problems will be sketched. The focus will be on a straight forward hard and a soft decision shift-sum-algorithm in order to show the potential of the novel concept. Simulation results, even for this simple variants, for hard and soft decision show superior results compared to methods from literature.