Share Email Print

Proceedings Paper • new

A novel approach for blind recognition of shortened RS codes
Author(s): Meng Li; Zengmao Chen; Zhiguo Sun
Format Member Price Non-Member Price
PDF $17.00 $21.00

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

Paper Details

Date Published: 3 January 2020
PDF: 9 pages
Proc. SPIE 11373, Eleventh International Conference on Graphics and Image Processing (ICGIP 2019), 1137333 (3 January 2020); doi: 10.1117/12.2558026
Show Author Affiliations
Meng Li, Harbin Engineering Univ. (China)
Zengmao Chen, Harbin Engineering Univ. (China)
Zhiguo Sun, Harbin Engineering Univ. (China)

Published in SPIE Proceedings Vol. 11373:
Eleventh International Conference on Graphics and Image Processing (ICGIP 2019)
Zhigeng Pan; Xun Wang, Editor(s)

© SPIE. Terms of Use
Back to Top