Multiple error correction with Analog Codes

Abstract

After pointing out the expected advantages of complex coding compared to usual RS- or BCH-codes over finite fields, it has been shown that ”Analog Codes” are able to correct multiple errors (bursts) also if additional background noise is superimposed. Simulations made obvious that the amplitude of the noise has to be of considerably lower amplitude than the ‘bursts’ to be corrected. Furthermore, it has been stated that intermediate solutions during execution of the recursive Berlekamp-Massey-Algorithm are not meaningless but represent a measure for the conditioning of the corresponding sub-Toeplitz system.