A novel approach for blind recognition of shortened RS codes

Meng Li; Zengmao Chen; Zhiguo Sun

doi:10.1117/12.2558026

3 January 2020 A novel approach for blind recognition of shortened RS codes

Meng Li, Zengmao Chen, Zhiguo Sun

Proceedings Volume 11373, Eleventh International Conference on Graphics and Image Processing (ICGIP 2019); 1137333 (2020) https://doi.org/10.1117/12.2558026
Event: Eleventh International Conference on Graphics and Image Processing, 2019, Hangzhou, China

Abstract

Most of existing methods to identify the Reed-solomon (RS) codes, commonly applied as channel codes, mainly focus on non-shortened RS codes. In this paper, a method to identify the shortened RS codes with short codeword length is proposed. Firstly, based on Gauss-Jordan elimination through pivoting (GJETP), the codeword length of shortened RS codes is identified. The shortened RS codewords are zeroized by estimating the order of finite field and the number of shortened symbols. Then, the Chinese remainder theorem(CRT) based algorithm is adopted to identify the primitive polynomial. Finally, the generator polynomial is obtained based on Galois field Fourier transform (GFFT). The simulation experiments are carried out showing that the probability of recognition of shortened RS codes is higher than 90% with bit error rate (BER) less than 5×10^-3 , which demonstrates the viability of the proposed recognition approach.

Citation Download Citation

Meng Li, Zengmao Chen, and Zhiguo Sun "A novel approach for blind recognition of shortened RS codes", Proc. SPIE 11373, Eleventh International Conference on Graphics and Image Processing (ICGIP 2019), 1137333 (3 January 2020); https://doi.org/10.1117/12.2558026

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available