Simplified correlation decoding by selecting possible codewords using erasure information (Corresp.)
Hideshige Tanaka, K. Kakigahara · IEEE Transactions on Information Theory · 1983
Correlation decoding is an optimal scheme of soft-decision decoding for error-correcting codes in the sense of minimum block-error probability. However, it is very difficult to apply the scheme when the number of information digits is large because of decoding complexity. A new algorithm for soft-decision decoding is presented, simplifying the correlation scheme by selecting certain codewords and decreasing decoding complexity by using erasure information. Any desired block-error probability between the error Probabilities of correlation and hard-decision decoding can be realized by setting up a suitable threshold value 0 for erasure decision. Computer simulation has been performed for Golay(23,12,7)code and BCH(15,7,5)code.