Scrambling code parameter identification method and device and storage medium

Abstract

The invention discloses a scrambling code parameter identification method and device and a storage medium, and belongs to the technical field of digital communication. The method comprises the following steps: S100, acquiring a binary code stream of a scrambling code and the maximum order of a primitive polynomial; s200, obtaining a generator polynomial set, and traversing to obtain a bit state matrix; s300, counting the number and probability of generator polynomials of each order; s400, comparing the unbalance degrees at the same tap position to obtain a maximum value of the unbalance degrees and a generator polynomial corresponding to the maximum value; s500, comparing the tap position of the generator polynomial corresponding to the maximum value of the unbalance degree with the tap position of the generator polynomial set, if the tap position is correct, completing the recognition of the scrambling code parameter and executing the step S600, and if the tap position is not correct, returning to the step S200 and circularly executing the subsequent steps; and S600, outputting a generator polynomial with a correct tap position, and completing identification. The method has the advantages of low operation complexity, easy engineering realization and high identification probability.

Description

Technical Field

[0001] The present invention relates to the field of digital communication technologies, and particularly to a scrambling parameter identification method, apparatus, and storage medium. Background Art

[0002] In a digital communication system, there are various interferences and noises in the channel, resulting in errors in the information during the transmission process. To ensure the reliability of the transmission process and reduce the impact of bit errors on the correct information, channel coding technologies are usually adopted. For non-cooperative communication, under the condition of no prior information or only a small amount of prior information, completing the identification of the coding type and the estimation of the coding parameters is an important means to obtain information of non-cooperative parties in fields such as intelligent communication, communication reconnaissance, and communication countermeasure.

[0003] In a digital communication system, the source coding sequence generally has 0, 1 imbalance, that is, the probabilities of bit 0 and bit 1 appearing in the information sequence are not each 1 / 2, while scrambling is a randomization process for the information sequence, so that the probabilities of bit 0 and bit 1 appearing in the scrambled sequence are both 1 / 2. The application of the scrambling technology not only ensures the accuracy of data synchronous transmission, but also expands the signal spectrum and improves its anti-interference ability. Scrambling is divided into synchronous scrambling and self-synchronous scrambling. The transceiver parties of self-synchronous scrambling do not need to be strictly synchronized, and its confidentiality is stronger than that of synchronous scrambling, which is a main form of scrambling.

[0004] Since self-synchronous scrambling can randomize the information sequence, it is a very strong confidentiality means and is widely used in fields such as radio communication and deep space communication. Correctly identifying the coding parameters of self-synchronous scrambling, especially the blind identification of the coding parameters of self-synchronous scrambling, has important significance in fields such as electronic reconnaissance and radio signal monitoring. Currently, the blind identification of self-synchronous scrambling is in the theoretical or research stage and is difficult to be applied in actual electronic reconnaissance equipment, radio measurement, and other fields. How to select a suitable blind identification method for scrambling parameters and apply the method to actual engineering equipment is a difficult point in electronic reconnaissance equipment. Summary of the Invention

[0005] The purpose of the present invention is to overcome the deficiencies of the prior art and provide a scrambling parameter identification method, apparatus, and storage medium.

[0006] The purpose of the present invention is achieved through the following technical solutions: In the first aspect of the present invention, there is provided a scrambling parameter identification method, including the following steps: S100: Obtain the binary code stream of the scrambling code and the maximum order of the primitive polynomial; S200: Obtain a set of generating polynomials according to the maximum value of the order of the primitive polynomial, and traverse to obtain a bit state matrix; S300: Count the number and probability of the generating polynomials of each order; S400: Calculate the Euclidean distance between the bit state probability distribution and the uniform distribution, compare the imbalance degrees at the same tap position, and obtain the maximum value of the imbalance degree and the generating polynomial corresponding to this value; S500: Compare the tap positions of the generating polynomial corresponding to the maximum imbalance degree with the tap positions of the generating polynomial set. If the tap positions are correct, execute step S600 for identifying the scrambling parameters. If incorrect, return to step S200 to loop and execute the subsequent steps; S600: Output the generating polynomial with correct tap positions to complete the identification.

[0007] Preferably, the said S200 further includes the following steps: According to the maximum value m1 of the order of the primitive polynomial, obtain the generating polynomial set, generate the initial bit state matrix, traverse the tap positions corresponding to the generating polynomials according to m1, and update the initial bit state matrix to obtain the bit state matrix.

[0008] Preferably, the said S300 further includes the following steps: According to the bit state matrix, count the number of 3 - order generating polynomials and 5 - order generating polynomials, and calculate the bit state probabilities of the 3 - order generating polynomials and 5 - order generating polynomials based on the total number of generating polynomials.

[0009] Preferably, the said S400 further includes the following steps: Generate an imbalance degree set according to the Euclidean distance, and find the maximum value in the imbalance degree set.

[0010] Preferably, the said S500 further includes the following steps: If the tap positions are incorrect, judge whether the value of m1 is less than 15. If less than 15, add 1 to the value of m1, and return to step S200 to loop and execute the subsequent steps. If the value of m1 is greater than or equal to 15, report an identification error.

[0011] The second aspect of the present invention provides: A scrambling parameter identification device, characterized in that it is used to implement any of the above scrambling parameter identification methods, including: A data acquisition module, used to acquire the binary code stream data of the scrambling code and the initialization parameters required for self - synchronous scrambling code identification; A state acquisition module, used to generate the required generating polynomial set according to the binary code stream data and the initialization parameters, count the number and probability of the generating polynomials of each order, and traverse all the orders in the generating polynomial set; An imbalance calculation module, which is used to calculate the Euclidean distance between the bit state probability distribution and the uniform distribution, compare the imbalances at the same tap position, and obtain the maximum value of the imbalance and the corresponding generating polynomial of this value; A scrambler parameter identification module, which is used to compare the tap position of the generating polynomial corresponding to the maximum value of the imbalance with the tap positions of the generating polynomial set, and output the identification result of the scrambler parameters.

[0012] The third aspect of the present invention provides: a computer-readable storage medium, in which computer-executable instructions are stored. When the computer-executable instructions are loaded and executed by a processor, any of the above scrambler parameter identification methods is implemented.

[0013] The beneficial effects of the present invention are: 1) Under the condition of unknown any parameters and source imbalance, for the blind identification problem of self-synchronizing scramblers, using the Euclidean distance between the bit state probability distribution and the uniform distribution as a measurement criterion, the generating polynomial of the self-synchronizing scrambler is identified. In non-cooperative communication, according to the identified scrambler parameters, the information can be descrambled and the original information can be restored.

[0014] 2) The scrambler parameter identification method proposed by the present invention has the advantages of low operation complexity, easy engineering implementation, and high identification probability, and can realize the blind identification of binary code streams for scramblers, which has important significance in the fields of electronic reconnaissance, radio signal detection, etc. Description of the Drawings

[0015] Figure 1 It is a flow chart of the scrambler parameter identification method; Figure 2 It is a schematic block diagram of the scrambler parameter identification device. Detailed Embodiments

[0016] Next, the technical solutions of the present invention will be clearly and completely described in conjunction with the embodiments. Obviously, the described embodiments are only a part of the embodiments of the present invention, rather than all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative efforts fall within the protection scope of the present invention.

[0017] Refer to Figure 1 - Figure 2 , the first aspect of the present invention provides: a scrambler parameter identification method, including the following steps: S100: Obtain the binary code stream of the scrambler and the maximum order of the primitive polynomial; S200: According to the maximum value of the order of the primitive polynomial, obtain the generating polynomial set and traverse it to obtain the bit state matrix; S300: Count the number and probability of generating polynomials of each order; S400: Calculate the Euclidean distance between the bit state probability distribution and the uniform distribution, compare the imbalance degrees at the same tap position, and obtain the maximum value of the imbalance degree and the generating polynomial corresponding to this value; S500: Compare the tap position of the generating polynomial corresponding to the maximum value of the imbalance degree with the tap positions of the generating polynomial set. If the tap position is correct, execute step S600 to complete the identification of the scrambling parameters. If it is incorrect, return to step S200 to loop and execute the subsequent steps; S600: Output the generating polynomial with the correct tap position to complete the identification.

[0018] In this embodiment, let (b1, b2, ⋯b n ) be the binary code stream data with error codes to be identified. Simulate the interference and noise in the transmission process. The binary code stream data is the binary code stream data after scrambling coding. In practical applications, the coefficients of the generating polynomial of the self-synchronizing scrambler used for scrambling are between 3 and 100. Since the error code diffusion rate of the self-synchronizing scrambler is proportional to the number of terms of the generating polynomial, generally a 3rd-order generating polynomial or a 5th-order generating polynomial is used. Therefore, the maximum value of the order of the generating polynomial is 16, including 12 3rd-order polynomials and 4 5th-order polynomials. It can be selected between (1 and 16) according to the process to be identified and the calculation amount.

[0019] In some embodiments, the S200 further includes the following steps: According to the maximum value m1 of the order of the primitive polynomial, obtain the generating polynomial set, generate the initial bit state matrix, traverse the tap positions corresponding to the generating polynomial according to m1, and update the initial bit state matrix to obtain the bit state matrix.

[0020] In some embodiments, the S300 further includes the following steps: According to the bit state matrix, count the number of 3rd-order generating polynomials and 5th-order generating polynomials, and calculate the bit state probabilities of the 3rd-order generating polynomial and the 5th-order generating polynomial according to the total number of generating polynomials.

[0021] In some embodiments, the S400 further includes the following steps: Generate an imbalance degree set according to the Euclidean distance, and find the maximum value in the imbalance degree set.

[0022] In some embodiments, the S500 further includes the following steps: If the tap position is incorrect, determine whether the value of m1 is less than 15. If it is less than 15, increment the value of m1 by 1 and return to step S200 to loop and execute the subsequent steps. If the value of m1 is greater than or equal to 15, report an identification error.

[0023] The second aspect of the present invention provides: A scrambler parameter identification device, characterized in that it is used to implement any of the above scrambler parameter identification methods, including: A data acquisition module, used to acquire the binary code stream data of the scrambler and the initialization parameters required for self-synchronous scrambler identification; A status acquisition module, used to generate the required set of generating polynomials according to the binary code stream data and the initialization parameters, count the number and probability of generating polynomials of each order, and traverse all orders in the set of generating polynomials; An imbalance calculation module, used to calculate the Euclidean distance between the bit state probability distribution and the uniform distribution, compare the imbalances at the same tap position, and obtain the maximum value of the imbalance and the generating polynomial corresponding to this value; A scrambler parameter identification module, used to compare the tap position of the generating polynomial corresponding to the maximum imbalance value with the tap positions of the set of generating polynomials, and output the identification result of the scrambler parameters.

[0024] The third aspect of the present invention provides: A computer-readable storage medium, in which computer-executable instructions are stored. When the computer-executable instructions are loaded and executed by a processor, any of the above scrambler parameter identification methods are implemented.

[0025] The above are only the preferred embodiments of the present invention. It should be understood that the present invention is not limited to the forms disclosed herein, should not be regarded as excluding other embodiments, but can be used in various other combinations, modifications and environments, and can be within the scope of the concept described herein, through the above teachings or the technology or knowledge in related fields. And the changes and modifications made by those skilled in the art that do not depart from the spirit and scope of the present invention should all be within the protection scope of the appended claims of the present invention.

Claims

1. A scrambling parameter identification method, characterized in that: It includes the following steps: S100: Obtain the binary code stream of the scrambling code and the maximum order of the primitive polynomial; S200: According to the maximum value of the order of the primitive polynomial, obtain the set of generating polynomials and traverse to obtain the bit state matrix; S3 S300: Count the number and probability of generating polynomials of each order; S400: Calculate the Euclidean distance between the bit state probability distribution and the uniform distribution, compare the imbalance degrees at the same tap position, and obtain the maximum value of the imbalance degree and the generating polynomial corresponding to this value; S500: Compare the tap position of the generating polynomial corresponding to the maximum imbalance degree with the tap positions of the set of generating polynomials. If the tap position is correct, complete the identification of the scrambling parameters and execute step S600. If it is incorrect, return to step S200 to loop and execute the subsequent steps; S600: Output the generating polynomial with the correct tap position to complete the identification.

2. The scrambling parameter identification method according to claim 1, wherein: The S200 further includes the following steps: According to the maximum value m1 of the order of the primitive polynomial, obtain the set of generating polynomials, generate the initial bit state matrix, traverse the tap positions corresponding to the generating polynomials according to m1, and update the initial bit state matrix to obtain the bit state matrix.

3. The scrambling parameter identification method according to claim 2, wherein: The S300 further includes the following steps: According to the bit state matrix, count the number of 3rd-order and 5th-order generating polynomials, and calculate the bit state probabilities of the 3rd-order and 5th-order generating polynomials according to the total number of generating polynomials.

4. The scrambling parameter identification method according to claim 3, characterized in that: The S400 further includes the following steps: Generate a set of imbalance degrees according to the Euclidean distance, and find the maximum value in the set of imbalance degrees.

5. The scrambling parameter identification method according to claim 4, wherein: The S500 further includes the following steps: If the tap position is incorrect, determine whether the value of m1 is less than 15. If it is less than 15, add 1 to the value of m1 and return to step S200 to loop and execute the subsequent steps. If the value of m1 is greater than or equal to 15, report an identification error.

6. A scrambling parameter identification device, characterized in that: Used to implement the scrambling parameter identification method described in any one of claims 1-5, including: A data acquisition module, used to acquire the binary code stream data of the scrambling code and the initialization parameters required for self-synchronous scrambling code identification; A state acquisition module, used to generate the required set of generating polynomials according to the binary code stream data and the initialization parameters, count the number and probability of generating polynomials of each order, and traverse all orders in the set of generating polynomials; An imbalance degree calculation module, used to calculate the Euclidean distance between the bit state probability distribution and the uniform distribution, compare the imbalance degrees at the same tap position, and obtain the maximum value of the imbalance degree and the generating polynomial corresponding to this value; A scrambling parameter identification module, used to compare the tap position of the generating polynomial corresponding to the maximum imbalance degree with the tap positions of the set of generating polynomials, and output the identification result of the scrambling parameters.

7. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer-executable instructions, and when the computer-executable instructions are loaded and executed by a processor, the scrambling parameter identification method described in any one of claims 1-5 is implemented.

Images