Blind recognition of binary cyclic codes

26Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A solution to blind recognition of binary cyclic codes is proposed in this paper. This problem could be addressed on the context of non-cooperative communications or adaptive coding and modulations. We consider it as a reverse engineering problem of error-correcting coding. The proposed algorithm recovers the encoder parameters of a cyclic, coded communication system with the only knowledge of the noisy information streams. By taking advantages of soft-decision outputs of the channel and by employing statistical signal-processing methods, it achieves higher recognition performances than existing algorithms which are based on algebraic approaches in hard-decision situations. By comprehensive simulations, we show that the probability of false estimation of coding parameters of our proposed algorithm is much lower than the existing algorithms, and falls rapidly when signal-tonoise ratio increases. © 2013 Liao et al.; licensee Springer.

Cite

CITATION STYLE

APA

Jing, Z., Huang, Z., Su, S., & Yang, S. (2013). Blind recognition of binary cyclic codes. Eurasip Journal on Wireless Communications and Networking, 2013(1). https://doi.org/10.1186/1687-1499-2013-218

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