Adaptive application of the Chase algorithm on Reed-Solomon product codes

Author

Mahran, A. ; Benaissa, M.

Author_Institution

Dept. of Electron. & Electr. Eng., Univ. of Sheffield, UK

fYear

2003

Firstpage

343

Lastpage

347

Abstract

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).

Keywords

AWGN channels; Reed-Solomon codes; adaptive decoding; computational complexity; phase shift keying; product codes; turbo codes; AWGN channel; BPSK; Chase algorithm; Chase-H algorithm; RS product codes; Reed-Solomon product codes; adaptive Chase-II algorithm; adaptive application; adaptive decoding; additive white Gaussian noise channel; binary phase shift keying; complexity reduction; decoding complexity; least reliable bits; reliability threshold; simulation results; soft decision decoding; turbo decoding;

fLanguage

English

Publisher

iet

Conference_Titel

Personal Mobile Communications Conference, 2003. 5th European (Conf. Publ. No. 492)

ISSN

0537-9989

Print_ISBN

0-85296-753-5

Type

conf

DOI

10.1049/cp:20030274

Filename

1350212