Improving performance of Reed-Solomon decoder by error/erasure correction
Kyungsu Ko, Ilhyuk Oh, Dongkuk Ko, Byung Gi Jung
Abstract
Kyungsu Ko, Ilhyuk Oh, Dongkuk Ko, Byung Gi Jung
Abstract
In this paper, we introduce a new scheme to improve the performance of the Reed-Solomon codes, which exploits the properties of the Reed-Solomon (RS) decoder to correct more errors by predicting as many erasures as possible in each RS packet in advance before decoding in the RS decoder. The concept Depth of Prediction (DoP) used for predicting erasures is introduced and derived. Simulation results show that with optimal DoP values, the new scheme yields performance gain of around ldB at BER of 10-8resulting in the extended coverage area of the communication system.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper, we introduce a new scheme to improve the performance of the Reed-Solomon codes, which exploits the properties of the Reed-Solomon (RS) decoder to correct more errors by predicting as many erasures as possible in each RS packet in advance before decoding in the RS decoder. The concept Depth of Prediction (DoP) used for predicting erasures is introduced and derived. Simulation results show that with optimal DoP values, the new scheme yields performance gain of around ldB at BER of 10-8resulting in the extended coverage area of the communication system.
Key concepts: Erasure, Decoding methods, Reed–Solomon error correction, Computer science, Algorithm, Network packet, Error detection and correction, Bit error rate