2013
DOI: 10.3390/e15051705
|View full text |Cite
|
Sign up to set email alerts
|

Information-Dispersion-Entropy-Based Blind Recognition of Binary BCH Codes in Soft Decision Situations

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 rad… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
19
0

Year Published

2014
2014
2024
2024

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 22 publications
(19 citation statements)
references
References 25 publications
0
19
0
Order By: Relevance
“…Blind detection must be performed very frequently, and given the high number of decoding attempts that must be performed in a limited time [1], it can lead to large implementation costs and high energy consumption. Blind detection solutions for codes adopted in previous generation standards can be found in [2]- [4].…”
Section: Introductionmentioning
confidence: 99%
“…Blind detection must be performed very frequently, and given the high number of decoding attempts that must be performed in a limited time [1], it can lead to large implementation costs and high energy consumption. Blind detection solutions for codes adopted in previous generation standards can be found in [2]- [4].…”
Section: Introductionmentioning
confidence: 99%
“…Chabot [15], Lee et al [14], and Yardi et al [16] have studied this blind reconstruction problem for cyclic codes when the length of the code is assumed to be known at the receiver. Zhou et al [18], [19] and Yardi et al [17] consider the situation when the length of the cyclic code is not known. In this paper, we focus on the unknown length scenario.…”
Section: Introductionmentioning
confidence: 99%
“…In this paper, we focus on the unknown length scenario. For the unknown length scenario, a key idea proposed in the existing methods is summarized next [17]- [19]. The unknown cyclic code C(n 0 , g 0 ) is identified by finding its length n 0 and the factors of its generator polynomial g 0 (X).…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Some blind-detection algorithms for other types of codes such as Bose-Chaudhuri-Hocquenghem (BCH) codes [5] or low-density parity-check (LDPC) codes [6] were also devised. However, in the next-generation mobile communication standard (5G) developed by the 3GPP, the control channel will be protected by polar codes [7].…”
Section: Introductionmentioning
confidence: 99%