Fast blind identification of a synchronous scrambler in a noisy environment

Scrambler is a technique to randomize the data at the bit layer. In non-cooperative conditions, it's essential for the receiver to analysis the parameters of scramblers. This paper proposes an algorithm for fast reconstructing the feedback polynomial of synchronous scramblers in a noisy environment. The algorithm consists of two steps. Firstly, leveraging the properties of m-sequences, it identifies the order of the feedback polynomial from the intercepted sequence. Secondly, within the narrowed set of primitive polynomials, the feedback polynomial will be identified through a binary hypothesis testing method. Simulation results validate the effectiveness of this algorithm.