Blind recognition of linear block code based on spectral cumulants

The problem that is described here is recovering a linear block code in non-cooperative signal processing. An algorithm based on the Galois field Fourier transform (GFFT) is proposed. Firstly, the received bits are divided into code words with different lengths. Then the GFFT is operated on each code, the spectral cumulants are computed. The correct code length and roots of the generator polynomial can be estimated from the distributions of the spectral cumulants. The polynomial can be recovered according to the roots. The validity of the algorithm is verified by the simulation results. Case studies are presented to illustrate the performances of the proposed blind reconstruction method.