Adaptive application of the Chase algorithm on Reed-Solomon product codes
Ashraf M. Mahran · 2003
This paper introduces a new adaptive application of Chase (1972) -II algorithm on Reed-Solomon (RS) product codes. The decoding complexity is changeable from a decoded codeword to another by changing the number of the least reliable bits according to a reliability threshold. The adaptive Chase-II algorithm has been optimised to obtain almost the same performance as that using Chase-II algorithm with significant reduction in complexity. A performance comparison between the proposed adaptive application and the standard application of Chase-II algorithm is obtained on an additive white Gaussian noise (AWGN) channel using binary phase shift keying (BPSK).