Information-dispersion-entropy-based blind recognition of binary bch codes in soft decision situations

21Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

A method of blind recognition of the coding parameters for binary Bose-Chaudhuri-Hocquenghem (BCH) codes is proposed in this paper. We consider an intelligent communication receiver which can blindly recognize the coding parameters of the received data stream. The only knowledge is that the stream is encoded using binary BCH codes, while the coding parameters are unknown. The problem can be addressed on the context of the non-cooperative communications or adaptive coding and modulations (ACM) for cognitive radio networks. The recognition processing includes two major procedures: code length estimation and generator polynomial reconstruction. A hard decision method has been proposed in a previous literature. In this paper we propose the recognition approach in soft decision situations with Binary-Phase-Shift-Key modulations and Additive-White-Gaussian-Noise (AWGN) channels.The code length is estimated by maximizing the root information dispersion entropy function. And then we search for the code roots to reconstruct the primitive and generator polynomials. By utilizing the soft output of the channel, the recognition performance is improved and the simulations show the efficiency of the proposed algorithm. © 2013 by the authors.

Cite

CITATION STYLE

APA

Zhou, J., Huang, Z., Liu, C., Su, S., & Zhang, Y. (2013). Information-dispersion-entropy-based blind recognition of binary bch codes in soft decision situations. Entropy, 15(5), 1705–1725. https://doi.org/10.3390/e15051705

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free