A Cascadable Pragmatic Block Decoding Algorithm Exploiting Channel Measurement Information

The complexity of algorithms to perform soft decision decoding on block codes has impeded their inclusion in practical systems. A well-known class of algorithms for decoding block codes utilizing channel measurement information along with the algebraic properties of the code are the Chase algorithms.1 In this paper a decoding method similar to Chase\u27s third algorithm is presented. However, in this method, a single test pattern or alternate codeword makes up one stage of the decoder. The method uses information from the previous decoding(s) to assist in generating a test pattern. This single stage ‘Second Chance Algorithm’ can then be extended to a ‘Third Chance Algorithm’ (and beyond) to enhance performance. The method does not invoke the hard decision decoder as often as the Chase algorithms

A Cascadable Pragmatic Block Decoding Algorithm Exploiting Channel Measurement Information

The complexity of algorithms to perform soft decision decoding on block codes has impeded their inclusion in practical systems. A well-known class of algorithms for decoding block codes utilizing channel measurement information along with the algebraic properties of the code are the Chase algorithms.1 In this paper a decoding method similar to Chase\u27s third algorithm is presented. However, in this method, a single test pattern or alternate codeword makes up one stage of the decoder. The method uses information from the previous decoding(s) to assist in generating a test pattern. This single stage ‘Second Chance Algorithm’ can then be extended to a ‘Third Chance Algorithm’ (and beyond) to enhance performance. The method does not invoke the hard decision decoder as often as the Chase algorithms