Blind recognition of binary BCH codes for cognitive radios
Summary: 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.
- Information-dispersion-entropy-based blind recognition of binary BCH codes in soft decision situations
- A blind recognition method for primitive BCH codes in soft decision situations
- Blind recognition of punctured convolutional codes
- scientific article; zbMATH DE number 6612135
- Blind recognition of linear block codes based on matrix analysis
- New algorithms for blind recognition of OFDM based systems
- scientific article; zbMATH DE number 6612135 (Why is no real title available?)
- A blind recognition method for primitive BCH codes in soft decision situations
- Information-dispersion-entropy-based blind recognition of binary BCH codes in soft decision situations
This page was built for publication: Blind recognition of binary BCH codes for cognitive radios
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1792924)