Blind Recognition of Error-Correcting BCH Codes Using GFFT

In this chapter, a novel method Galois Field Fourier Transform is proposed for extracting the primitive BCH Code, which is intercepted with the noise. First, the intercepted bit stream is divided into sequences of same length and GFFT is performed on all the sequences, from which spectral components are recorded. Then based on the locations of common null spectral components, the code length and the roots of respective generator polynomial are found. Finally, the performance of the proposed technique is measured by computing the false alarm and miss detection probabilities for both roots and non-roots of the Generator Polynomial. The code recognition of the proposed method is plotted for different code lengths and also the proposed method is compared with previous techniques.