Fast Kaneko Algorithm for Linear Block Codes

This paper introduces a fast implementation of the Kaneko algorithm for decoding single error correcting linear block codes. The idea is based on re-ordering the test error pattern such that algebraic decoder may be repeatedly employed with reduced inherent computational complexity. This is of special importance as Kaneko algorithm requires many soft-value calculations. Compared to conventional Kaneko algorithm, the proposed algorithm can achieve an average of 25 % less complexity per decoded test pattern. Moreover, for bounded-distance decoding, the maximum likelihood (ML) sequence can be reached faster than the conventional implementation of that algorithm while maintaining the error performance.