A Blind Recognition Algorithm of Scrambler after Convolutional Encoder

In a wireless communication system, the data is usually scrambled after channel encoding. However, existing research on blind recognition often ignores the pseudo-random scrambling of channel encoding data, which is not in line with the actual situation. To solve this problem, this paper proposes an...

Full description

Saved in:
Bibliographic Details
Published in:Journal of physics. Conference series 2021-06, Vol.1944 (1), p.12010
Main Authors: Wang, Zhongfang, Zhai, Liuqun, Fu, Jingwen
Format: Article
Language:English
Subjects:
Algorithms
Bit error rate
Coders
Codes
Cognition
Parameters
Physics
Polynomials
Pseudorandom
Recognition
Wireless communication systems
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In a wireless communication system, the data is usually scrambled after channel encoding. However, existing research on blind recognition often ignores the pseudo-random scrambling of channel encoding data, which is not in line with the actual situation. To solve this problem, this paper proposes an algorithm to recognize the scrambler parameters with convolutional codes. First, we transform this problem into a cognition problem of cancelling scrambling sequence by using the properties of the polynomial of scrambler. Then, we put forward a fast judgment method after the cancellation of scrambling. The proposed method is based on the conditional entropy and can effectively identify the scrambler after the convolutional encoder. The method has a better performance of resisting error comparing to the traditional method and saves computing resources. Simulation results show that the parameters of the scrambler can still be determined effectively when the bit error rate is 6% in the case of sufficient data.
ISSN:1742-6588
1742-6596
DOI:10.1088/1742-6596/1944/1/012010