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

Zhou, Jing; Huang, Zhiping; Liu, Chunwu; Su, Shaojing; Zhang, Yimeng

doi:10.3390/e15051705

Cited by 21 publications

(19 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

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%

Design and Implementation of a Polar Codes Blind Detection Scheme

Condo

Hashemi

Ardakani

et al. 2019

IEEE Trans. Circuits Syst. II

View full text Add to dashboard Cite

In blind detection, a set of candidates has to be decoded within a strict time constraint, to identify which transmissions are directed at the user equipment. Blind detection is required by the 3GPP LTE/LTE-Advanced standard, and it will be required in the 5 th generation wireless communication standard (5G) as well. Polar codes have been selected for use in 5G: thus, the issue of blind detection of polar codes must be addressed. We propose a polar code blind detection scheme where the user ID is transmitted instead of some of the frozen bits. A first, coarse decoding phase helps selecting a subset of candidates that is decoded by a more powerful algorithm: an early stopping criterion is also introduced for the second decoding phase. Simulations results show good missed detection and false alarm rates, along with substantial latency gains thanks to early stopping. We then propose an architecture to implement the devised blind detection scheme, based on a tunable decoder that can be used for both phases. The architecture is synthesized and implementation results are reported for various system parameters. The reported area occupation and latency, obtained in 65 nm CMOS technology, are able to meet 5G requirements, and are guaranteed to meet them with even less resource usage in the latest technology nodes.

show abstract

Section: Introductionmentioning

confidence: 99%

Design and Implementation of a Polar Codes Blind Detection Scheme

Condo

Hashemi

Ardakani

et al. 2019

IEEE Trans. Circuits Syst. II

View full text Add to dashboard Cite

show abstract

“…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%

“…However, very limited analysis is available for the syndrome distribution and its properties. Due to lack of knowledge of the syndrome distribution, typically in the literature some assumptions are made to simplify the analysis [18], [19]. For example, in [18] it is assumed that when either of the assumed parameter is incorrect (case (b) mentioned above), every coefficient in the syndrome of the received polynomial is equally likely to be zero or one.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Properties of syndrome distribution for blind reconstruction of cyclic codes

Yardi

Vijayakumaran

2019

AAECC

View full text Add to dashboard Cite

In the problem of blind reconstruction of channel codes, the receiver does not have the knowledge of the channel code used at the transmitter and the aim is to identify this unknown channel code corresponding to the given received sequence. In this paper, we study this blind reconstruction problem for binary cyclic codes. In the literature, several researchers have proposed blind reconstruction algorithms that make use of the distribution of the syndromes (remainders) of the received polynomials with respect to a candidate polynomial for the generator polynomial of the cyclic code. However, very limited analysis is available for the syndrome distribution and its properties. In this paper, we study the syndrome structure of the received polynomials. Specifically, we prove that the syndrome distribution of the noise-free sequence can either be uniform or restricted uniform. We also provide the necessary and sufficient conditions for it to be of the either type. For the noise-affected received sequence we prove that, finding the syndrome distribution is in general computationally intractable. We also apply these results to analyze the performance of the existing methods and verify some of the assumptions made in the literature for blind reconstruction.

show abstract

“…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%

Blind detection of polar codes

Giard

Balatsoukas‐Stimming

Burg

2017

2017 IEEE International Workshop on Signal Processing Systems (SiPS)

View full text Add to dashboard Cite

Abstract-Polar codes were recently chosen to protect the control channel information in the next-generation mobile communication standard (5G) defined by the 3GPP. As a result, receivers will have to implement blind detection of polar coded frames in order to keep complexity, latency, and power consumption tractable. As a newly proposed class of block codes, the problem of polar-code blind detection has received very little attention. In this work, we propose a low-complexity blind-detection algorithm for polar-encoded frames. We base this algorithm on a novel detection metric with update rules that leverage the a priori knowledge of the frozen-bit locations, exploiting the inherent structures that these locations impose on a polar-encoded block of data. We show that the proposed detection metric allows to clearly distinguish polar-encoded frames from other types of data by considering the cumulative distribution functions of the detection metric, and the receiver operating characteristic. The presented results are tailored to the 5G standardization effort discussions, i.e., we consider a short low-rate polar code concatenated with a CRC.

show abstract

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

Cited by 21 publications

References 25 publications

Design and Implementation of a Polar Codes Blind Detection Scheme

Design and Implementation of a Polar Codes Blind Detection Scheme

Properties of syndrome distribution for blind reconstruction of cyclic codes

Blind detection of polar codes

Contact Info

Product

Resources

About