Blind frame synchronization of reed-solomon codes: Non-binary VS. binary approach

Mathematical Problems in Engineering

2016

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.

Section: Principlesmentioning

confidence: 99%

Blind Recognition of Binary BCH Codes for Cognitive Radios

Zhou¹,

Mathematical Problems in Engineering

2016

“…In [20,21], the authors introduce a MAP approach to achieve blind frame synchronization of error-correcting codes with a sparse parity-check matrix. It is also developed on Reed Solomon (RS) codes [22] and BCH product codes [23] and yields better performances than previous hard decision ones. In this paper, we propose an algorithm to achieve blind recognition of binary cyclic codes in soft-decision situations.…”

Section: Related Workmentioning

confidence: 99%

“…We improve and extend this work in order to handle soft-decision situations. To utilize the soft-decision outputs, we employ the idea of MAP-based processing method proposed in [20][21][22][23].…”

Section: Related Workmentioning

confidence: 99%

“…The main idea is adapting the parity-check matrix of the codes to the reliability of the received information bits at each iteration step of the iterative decoding procedure. This idea is also employed in [22] to achieve blind frame synchronization of RS codes. The adaptation procedure reduces the impact of most unreliable decision bits on the calculation of syndromes.…”

Section: )mentioning

confidence: 99%

See 1 more Smart Citation

Blind recognition of binary cyclic codes

Zhou

et al. 2013

J Wireless Com Network

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.

“…Many soft-decision-based decoding algorithms have been applied to the error-correcting codes [25][26][27][28][29][30] and yield better decoding performances than hard decision algorithms. Some blind frame synchronization techniques for error correcting codes also utilize the soft output of the channel to improve the synchronization performances [31][32][33][34]. Inspired by the soft decision decoding algorithms, we develop the RIDERS algorithm introduced by [22][23][24] in the soft decision situations in this paper.…”

Section: Introductionmentioning

confidence: 99%

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

Zhou

Liu

et al. 2013

Entropy

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.