Blind Recognition of Binary BCH Codes for Cognitive Radios

Abstract EN

A novel algorithm of blind recognition of Bose-Chaudhuri-Hocquenghem (BCH) codes is proposed to solve the problem of Adaptive Coding and Modulation (ACM) in cognitive radio systems.

The recognition algorithm is based on soft decision situations.

The code length is firstly estimated by comparing the Log-Likelihood Ratios (LLRs) of the syndromes, which are obtained according to the minimum binary parity check matrixes of different primitive polynomials.

After that, by comparing the LLRs of different minimum polynomials, the code roots and generator polynomial are reconstructed.

When comparing with some previous approaches, our algorithm yields better performance even on very low Signal-Noise-Ratios (SNRs) with lower calculation complexity.

Simulation results show the efficiency of the proposed algorithm.