Sequence seed recovery method, computing device, storage medium, and product

Abstract

The present application provides a sequence seed recovery method, a computing device, a storage medium, and a product. The sequence seed recovery method comprises: acquiring cached data of a pseudo-random binary sequence; performing a target operation on each bit of data in the cached data of the pseudo-random binary sequence to obtain an operation result, and accumulating the operation results to obtain an accumulated result, wherein the target operation comprises a modulo operation and / or an exclusive OR operation; and performing decision on the basis of the accumulated result to obtain a pseudo-random binary sequence seed, wherein the accumulated result comprises a first number of accumulated values.

Description

Sequence seed recovery method, computing device, storage medium and product

[0001] Cross-reference to related applications

[0002] This application claims priority to Chinese Patent Application No. 202411373615.9, filed September 29, 2024, with the Chinese Patent Office, the contents of which are incorporated herein by reference in their entirety. TECHNICAL FIELD

[0003] The present application relates to, but is not limited to, the field of communication technology. BACKGROUND

[0004] Pseudo-random binary sequence (PRBS) is a test signal widely used in the field of digital communication and signal processing. Fast recovery of PRBS seed is an important problem in digital communication and signal processing, especially when the receiving end needs to quickly and accurately synchronize the PRBS sequence of the sending end.

[0005] Currently, fast recovery of PRBS seed is mainly based on PRBS synchronization technology based on correlation method. In the case of PRBS synchronization, the receiving end has a locally generated PRBS sequence, which is correlated with the received signal. If the received signal is aligned with the local PRBS sequence, the correlation function will reach a maximum value. However, this method is not conducive to improving detection capability due to the need to rely on locally generated PRBS sequence and low computational efficiency. SUMMARY

[0006] The embodiments of the present application provide a sequence seed recovery method, which comprises: obtaining cache data of a pseudo-random binary sequence; performing target operation on each bit data in the cache data of the pseudo-random binary sequence to obtain an operation result, and accumulating the operation result to obtain an accumulation result, wherein the target operation comprises modulo operation and / or XOR operation; and performing decision based on the accumulation result to obtain a pseudo-random binary sequence seed, wherein the accumulation result comprises a first number of accumulation values.

[0007] The embodiments of the present application also provide a computing device, which comprises a memory, a processor, and a computer program stored on the memory and executable on the processor, the computer program being configured to implement the steps of the sequence seed recovery method as described above.

[0008] The embodiments of the present application also provide a storage medium, which is a computer-readable storage medium, and the storage medium stores a computer program, and the computer program is executed by a processor to implement the steps of the sequence seed recovery method as described above. Attached Figure Description

[0009] Figure 1 is a schematic diagram of the structure of the network device in the hardware operating environment involved in the embodiment of this application;

[0010] Figure 2 is a schematic diagram of the working principle of the DSP in the embodiment of this application;

[0011] Figure 3 is a schematic diagram of the working principle of the PRBS bit error detection device in the embodiment of this application;

[0012] Figure 4 is a first exemplary flowchart of the sequence seed recovery method in an embodiment of this application;

[0013] Figure 5 is a schematic diagram of the functional modules in the embodiments of this application;

[0014] Figure 6 is a detailed flowchart of step S10 in Figure 4 of this application embodiment;

[0015] Figure 7 is a detailed flowchart of step S20 in Figure 4 of this application embodiment;

[0016] Figure 8 is a detailed flowchart of step S30 in Figure 4 of this application embodiment;

[0017] Figure 9 is a schematic diagram of the sequence seed recovery device provided in the embodiment of this application. Detailed Implementation

[0018] The realization of the objectives, functional features, and advantages of this application will be further explained in conjunction with the embodiments and with reference to the accompanying drawings. It should be understood that the specific embodiments described herein are merely illustrative of this application and are not intended to limit this application.

[0019] Pseudo-Random Binary Sequences (PRBS) are widely used test signals in digital communication and signal processing. Fast recovery of the PRBS seed is a crucial issue in digital communication and signal processing, especially when the receiver needs to quickly and accurately synchronize the PRBS sequence from the transmitter. Currently, fast PRBS seed recovery primarily relies on correlation-based PRBS synchronization techniques.

[0020] The PRBS synchronization technology based on the correlation method has the characteristics of simple implementation and large amount of calculation. When the bit error rate is high, the correlation peak is not obvious, the synchronization failure rate is high, the synchronization period is too long, and the industrial fast synchronization requirements cannot be met. If a local standard sequence is used for correlation operation, the correlation peak is often difficult to find because the sequence period is too long. In order to improve the detection capability, lengthening the local synchronization sequence length or shortening the PRBS period will lead to the increase of calculation amount or the problem of insufficient randomness of test. The existing bit error rate (BER, Bit Error Rate) detection technology cannot effectively detect the BER when the PRBS cannot be synchronized. Too long synchronization time will also lead to sequence waste, insufficient BER detection and other problems.

[0021] In view of the development status of the above various PRBS synchronization, bit error rate detection and other technologies, a new PRBS synchronization and bit error rate detection method and device are proposed in the embodiments of the present application. The method and device have simple structure, small amount of operation, and only rely on the received PRBS sequence with error. The decoding operation has strong logicality and high accuracy. The present scheme effectively utilizes the logical relationship between the PRBS sequences, restores the PRBS seed at a specific time by using the direct calculation method, and then completes the synchronization of the received PRBS sequence and the local sequence, thereby providing guarantee for subsequent bit error rate statistics and other operations.

[0022] Compared with the existing PRBS synchronization technology, the scheme in the embodiments of the present application can have the following two improvements:

[0023] (1) The PRBS seed recovery only needs to decode the received sequence, and the PRBS sequence synchronization does not need to rely on the local PRBS sequence, does not need to perform correlation operation, has low power consumption, fast speed and strong independence;

[0024] (2) The decoding method only needs to judge the result after the exclusive or or summation operation, and the calculation is simple and direct.

[0025] To solve the above technical problems, refer to FIG. 1, which is a network device structure schematic diagram of the hardware running environment involved in the scheme of the embodiments of the present application.

[0026] As shown in FIG. 1, the network device can include a processor 1001, for example, a central processing unit (CPU), a communication bus 1002, a user interface 1003, a network interface 1004, and a memory 1005. The communication bus 1002 is configured to realize the connection and communication among the components. The user interface 1003 can include a display, an input unit such as a keyboard, and can further include a standard wired interface, a wireless interface. The network interface 1004 can optionally include a standard wired interface, a wireless interface (such as a wireless fidelity (WIreless-FIdelity, WI-FI) interface). The memory 1005 can be a high-speed random access memory (RAM) memory, and can also be a stable non-volatile memory (Non-Volatile Memory, NVM), for example, a disk memory. The memory 1005 can also be a storage device independent of the aforementioned processor 1001.

[0027] Those skilled in the art can understand that the structure shown in FIG. 1 does not constitute a limitation on the network device, and can include more or fewer components than those shown, or combine certain components, or different component arrangements.

[0028] As shown in FIG. 1, the memory 1005 as a storage medium can include an operating system, a data storage module, a network communication module, a user interface module, and a computer program.

[0029] In the network device shown in FIG. 1, the network interface 1004 is mainly used for data communication with other devices; the user interface 1003 is mainly used for data interaction with the user; the processor 1001 and the memory 1005 in the network device of the present application can be arranged in the network device, and the network device can call the computer program stored in the memory 1005 through the processor 1001, and can execute the PRBS sequence seed recovery method according to the embodiments of the present application. As another embodiment, the network device includes a DSP (Digital Signal Processor), and the DSP is configured to execute the PRBS sequence seed recovery method according to the embodiments of the present application. In other embodiments, the DSP can not be located in the network device, and can be an independent computing device.

[0030] The computing device provided in the embodiments of the present application can include one or more processors, which can also be referred to as processing units, and can implement certain control or processing functions. The processor can be a general-purpose processor or a special-purpose processor, etc., and is used to control the computing device, execute a software program, and process data of the software program. The processor can also store instructions or data (for example, intermediate data). The instructions can be run by the processor, so that the computing device performs the PRBS sequence seed recovery method described in the embodiments of the present application.

[0031] The computing device provided in the embodiments of the present application can include one or more memories, which can store instructions that can be run on the processor, so that the computing device performs the PRBS sequence seed recovery method described in the embodiments of the present application. Alternatively, the memory can also store data. The processor and the memory can be separately arranged, or can be integrated together.

[0032] The computing device provided in the embodiments of the present application can be a stand-alone device, or can be part of a network device, or can be a chip or part of a chip, for example, can be a DSP device or a chip or part thereof.

[0033] Referring to FIG. 2, FIG. 2 is a schematic diagram of the working principle of the DSP in the embodiments of the present application. As shown in FIG. 2, the pseudo-random binary sequence source (i.e., the PRBS source) sends the PRBS to the digital signal processor through the channel. The PRBS synchronization and BER calculation module in the embodiments of the present application are both applied to the digital signal processor unit shown in FIG. 2. In addition to the PRBS processing related content, the digital signal processor unit generally also includes clock recovery, equalization, synchronization and other module units, which are used to recover the PRBS sequence. The PRBS processing related content is after the bit-level sequence recovery.

[0034] Referring to FIG. 3, FIG. 3 is a schematic diagram of a working principle of a PRBS error code detection device in an embodiment of the present application. As shown in FIG. 3, the PRBS error code detection device includes a PRBS synchronization module, a PRBS sequence generation module, and a BER statistical module. The PRBS synchronization module is configured to receive a PRBS sequence, perform PRBS synchronization, and generate a PRBS seed. The PRBS sequence generation module is configured to receive the PRBS seed generated by the PRBS synchronization module, and generate a PRBS sequence according to the PRBS seed. The BER statistical module is configured to receive the PRBS sequence generated by the PRBS sequence generation module, perform BER statistics on the PRBS sequence, and obtain an error code statistical result BER. In the embodiment of the present application, the accurate PRBS sequence seed is recovered by using a direct calculation method on the received signal, and the recovered seed is used to generate the subsequent PRBS sequence. The BER statistical module compares the received sequence and the recovered PRBS sequence, and statistically obtains the error code rate of the PRBS sequence. In order to avoid the error of the recovered PRBS seed, the PRBS synchronization module can be restarted and the PRBS seed can be recalculated when the BER statistical error code rate exceeds the expectation. According to the actual situation, the restart mechanism can also be omitted.

[0035] It should be noted that FIG. 3 is a whole flowchart of PRBS sequence error code detection. The PRBS sequence generation and the BER statistical module are extension functions of the PRBS synchronization module, and whether to use them can be determined independently. The only input of the PRBS synchronization module is the PRBS received sequence. According to the processing of PRBS received sequences of different lengths, the accurate PRBS seed of the corresponding position can be recovered according to the calculation probability.

[0036] Referring to FIG. 4, FIG. 4 is a first exemplary flowchart of a sequence seed recovery method in an embodiment of the present application. The method can include steps S10 to S30.

[0037] In step S10, the cache data of the pseudo-random binary sequence is obtained.

[0038] In the embodiment of the present application, the pseudo-random binary sequence is received from the pseudo-random binary sequence source, the generating polynomial of the pseudo-random binary sequence is determined, and then the data cache is performed according to the generating polynomial to obtain the cache data of the pseudo-random binary sequence. The sequence seed recovery method in the embodiment of the present application can be applied to various scenes requiring recovery of the PRBS sequence.

[0039] In step S20, target operation is performed on each bit of data in the cache data of the pseudo-random binary sequence to obtain an operation result, and the operation result is accumulated to obtain an accumulation result. The target operation includes a modulo operation and / or an exclusive OR operation.

[0040] Further, after obtaining the buffered data of the pseudo-random binary sequence, each bit data in the buffered data of the pseudo-random binary sequence is subjected to target operation to obtain operation results, and the operation results are accumulated to obtain accumulated results.

[0041] Exemplarily, the target operation in the embodiment of the application includes modulo operation and / or XOR operation, and does not include correlation operation. The buffered data is subjected to modulo operation and / or XOR operation between the intermediate n-bit data and the received bits at a specific distance from the intermediate n-bit data, and the specific bits are related to the generator polynomial. The modulo operation and / or XOR operation are performed only between the bits participating in decoding corresponding to a specific i value in the forward direction and the backward direction, and the accumulation operation is performed between each group of operation results (for example, XOR values).

[0042] In step S30, a decision is made based on the accumulated results to obtain a pseudo-random binary sequence seed, wherein the accumulated results include a first number of accumulated values.

[0043] Further, after each bit data in the buffered data of the pseudo-random binary sequence is subjected to target operation to obtain operation results, and the operation results are accumulated to obtain accumulated results, a decision is made based on the accumulated results to obtain a pseudo-random binary sequence seed, wherein the accumulated results include a first number of accumulated values.

[0044] Exemplarily, after the first number of accumulated values are obtained through operation and accumulation, the first number of accumulated values are compared with preset threshold values respectively to obtain a first number of decision values corresponding to the first number of accumulated values, and a sequence formed by the first number of decision values is taken as the pseudo-random binary sequence seed.

[0045] Referring to FIG. 5, FIG. 5 is a schematic diagram of functional modules in the embodiment of the application. As shown in FIG. 5, the PRBS synchronization module in the embodiment of the application includes three parts: a data buffering unit, an operation and accumulation unit, and a decision unit. The data buffering unit corresponds to step S10 described above, and is configured to obtain buffered data of a pseudo-random binary sequence; the operation and accumulation unit corresponds to step S20 described above, and is configured to subject each bit data in the buffered data of the pseudo-random binary sequence to target operation to obtain operation results, and accumulate the operation results to obtain accumulated results; and the decision unit corresponds to step S30 described above, and is configured to make a decision based on the accumulated results to obtain a pseudo-random binary sequence seed. The PRBS sequence generation and BER calculation can be generated by using a conventional method. In order to avoid errors in the recovered PRBS seed, when the BER statistical error rate exceeds the expectation, the PRBS synchronization module can be prompted to restart and recalculate the PRBS seed.

[0046] The embodiment obtains the cache data of the pseudo-random binary sequence, performs target operation on each bit of the cache data of the pseudo-random binary sequence to obtain an operation result, and accumulates the operation result to obtain an accumulation result, wherein the target operation includes modulo operation and / or XOR operation; and judges based on the accumulation result to obtain the pseudo-random binary sequence seed. The accumulation result includes a first number of accumulation values, and the method does not need to depend on a local pseudo-random binary sequence, has strong independence, and can directly obtain the pseudo-random binary sequence seed by performing operation accumulation and judgment on the obtained cache data of the pseudo-random binary sequence, without related operation and low power consumption, thereby improving the operation efficiency of the fast recovery process of the pseudo-random binary sequence seed and helping to improve the detection capability.

[0047] An example embodiment of step S10 is provided based on the foregoing embodiments of the application.

[0048] Referring to FIG. 6, which is a detailed flowchart of step S10 of FIG. 4 in the embodiments of the application, on the basis of the foregoing, referring to FIG. 6, step S10 includes:

[0049] Step S101: receiving the pseudo-random binary sequence sent by a pseudo-random binary sequence source;

[0050] Step S102: selecting or determining a generation polynomial of the pseudo-random binary sequence;

[0051] Step S103: performing data caching according to the generation polynomial to obtain cache data of the pseudo-random binary sequence.

[0052] For example, the step of performing data caching according to the generation polynomial to obtain cache data of the pseudo-random binary sequence includes:

[0053] determining the first number according to the number of terms of the generation polynomial, and selecting or determining a second number;

[0054] determining a total number of cache segments according to the second number, and determining a total length of cache data according to the first number and the second number;

[0055] performing data caching according to the total number of cache segments and the total length of cache data to obtain the cache data of the pseudo-random binary sequence.

[0056] For example, when the generation polynomial is p n x n +p n-1 x n-1 +....p1x+p0x 0 , the PRBS sequence is p n= 1, p1, p2,... p n-1 ∈ [0, 1], the value of the first number n can be determined according to the number of terms of the generating polynomial. According to the actual situation or empirical value, the second number m (m is greater than or equal to 0) can be selected or determined, for example, m = 4 in the embodiment of the application, the total number of segments can be buffered according to the second number, denoted as 2m+1, 2m+1 segments of the to-be-processed signal are buffered, and the total length of the buffered data is (2 m +1)·n, data buffering is performed according to the total number of buffered segments and the total length of the buffered data, and the buffered data of the PRBS sequence is obtained, denoted as

[0057] In the embodiment of the application, the 800G coherent receiver PRBS sequence error rate detection module is taken as an example, the system PRBS generating polynomial is x 31 +x 28 +1, the sequence length period is 2 31 -1 (about 214.8 million), and the conventional method usually needs to continuously try to recover a longer PRBS local sequence from the received partial PRBS sequence, and then correlate the recovered PRBS local sequence with the received sequence to find a correlation peak, and then the PRBS synchronization is successful.

[0058] In the embodiment, the pseudo-random binary sequence source sends a pseudo-random binary sequence, the generating polynomial of the pseudo-random binary sequence is selected or determined, and data buffering is performed according to the generating polynomial to obtain the buffered data of the pseudo-random binary sequence. Part of the received pseudo-random binary sequence can be selected for data buffering, which is used for subsequent detection process, avoids resource demand caused by excessive data buffering, and helps to improve detection capability.

[0059] An example embodiment of step S20 is provided based on the foregoing embodiment of the application:

[0060] Referring to FIG. 7, FIG. 7 is a specific refinement flowchart of step S20 of FIG. 4 in the embodiment of the application, and on the basis of the foregoing, referring to FIG. 7, step S20 includes:

[0061] Step S201: selecting the first number of bit data from the buffered data of the pseudo-random binary sequence, wherein the first number of bit data includes target bit data;

[0062] Step S202: selecting forward and backward bit data at a preset distance from the target bit data, and performing modulo operation and / or XOR operation on the forward and backward bit data to obtain the operation result;

[0063] Step S203: accumulating the operation result and the target bit data to obtain the first number of accumulated values.

[0064] Exemplarily, the preset distance includes a first preset distance and a second preset distance, and the step of selecting the forward and backward bit data with a preset distance from the target bit data further includes:

[0065] determining a third quantity t according to the quantity of terms in the generation polynomial satisfying the preset condition;

[0066] determining the first preset distance 2 i t according to the third quantity, and determining the second preset distance 2 i (n-t) according to the first quantity and the third quantity, wherein the value of i is related to the total quantity of buffered data segments of the pseudo-random binary sequence.

[0067] Exemplarily, the forward and backward bit data includes backward bit data and forward bit data, the step of selecting the forward and backward bit data with a preset distance from the target bit data, and performing modulo operation and / or exclusive or operation on the forward and backward bit data to obtain the operation result includes:

[0068] selecting or determining the bit with a distance of the first preset distance 2 i t from the target bit data along the time sequence as the backward bit data;

[0069] selecting or determining the bit with a distance of the second preset distance 2 i (n-t) from the target bit data along the time sequence as the forward bit data;

[0070] performing modulo operation on the backward bit data and the forward bit data respectively to obtain the modulo result, or performing exclusive or operation on the backward bit data and the forward bit data respectively to obtain the exclusive or result;

[0071] taking the modulo result or the exclusive or result as the operation result.

[0072] Exemplarily, the generation polynomial is p n x n +p n-1 x n-1 +....p1x+p0x 0 , wherein p0=p n =1, p1, p2,..., p n-1 ∈[0, 1]. 2m+1 segments of to-be-processed signals are buffered (m is greater than or equal to 0), and the total length of the buffered data is (2 m +1)·n. The buffered data is denoted as

[0073] For example, for the cached data, the intermediate n-bit data is XOR-summed with the received bits at a certain distance from it, and these certain XOR-summed bits are related to the generating polynomial. For example, in the intermediate n-bit data , the term to be XOR-summed with it in the time sequence backward is the bit at a distance of 2 i from it (t does not include 0), and the term to be XOR-summed with it in the time sequence forward is the bit at a distance of 2 i (n-t) from it (t does not include n), where t is the number of terms in the generating polynomial that satisfy a preset condition, and the preset condition is that p t is not 0, that is, t is the value of t for which p t is not 0 in the generating polynomial; i is a natural number between 0 and m-1, where m is the number of segments; Each bit after the first bit is decoded in sequence backward based on the above data position. The XOR operation is only performed between the bits selected for decoding in the forward and backward directions for a specific i value, and the accumulation operation is performed between the XOR values.

[0074] The specific expression is as follows:

[0075]

[0076] Another expression is as follows:

[0077] In the above formula, the modulo 2 accumulation of multiple bits is equivalent to the XOR operation between the bits.

[0078] Where c is a natural number, and the value is [0, n-1].

[0079] In the above scheme, the first number of bit data is selected from the cached data of the pseudo-random binary sequence, and the target bit data is included in the first number of bit data. The forward and backward bit data at a preset distance from the target bit data is selected, and the forward and backward bit data is subjected to a modulo operation and / or an XOR operation to obtain the operation result. The operation result is accumulated with the target bit data to obtain the first number of accumulated values. The method does not rely on the local pseudo-random binary sequence, has strong independence, and can directly obtain the pseudo-random binary sequence seed by using the cached data of the pseudo-random binary sequence for operation and accumulation and decision, without related operations, low power consumption, and improved operation efficiency of the fast recovery process of the pseudo-random binary sequence seed, thereby helping to improve the detection capability.

[0080] An example embodiment of step S30 based on the above embodiments of the present application is as follows:

[0081] Referring to FIG. 8, FIG. 8 is a specific refinement flowchart of step S30 of FIG. 4 in the embodiment of the present application. On the basis of the foregoing, referring to FIG. 8, step S30 includes:

[0082] Step S301: selecting or determining a preset threshold value;

[0083] Step S302: comparing the first number of accumulated values respectively with the preset threshold value to obtain a corresponding first number of decision values;

[0084] Step S303: taking the sequence of the first number of decision values as the PRBS seed.

[0085] Illustratively, the step of comparing the first number of accumulated values respectively with the preset threshold value to obtain a corresponding first number of decision values includes:

[0086] traversing the first number of accumulated values, comparing the accumulated value with the preset threshold value, if the accumulated value is greater than the preset threshold value, the corresponding decision value is 1, if the accumulated value is less than or equal to the preset threshold value, the corresponding decision value is 0, until the first number of decision values are obtained.

[0087] Illustratively, according to the operation method in the above embodiment, n y values, i.e. the first number of accumulated values, can be obtained, and further, the first number of accumulated values can be hard-decisioned according to the following formula:

[0088] wherein Th threshold is the preset threshold value, and its specific value can be determined according to actual conditions or experience value, and the recommended value in the embodiment of the present application is m.

[0089] That is, when y c is greater than m, a c takes 1; when y c is less than or equal to m, a c takes 0, wherein c is a natural number, and takes a value [0, n-1], thereby obtaining the PRBS seed at the corresponding moment.

[0090] Illustratively, taking the 800G coherent receiver PRBS sequence error rate detection module as an example, the system PRBS generation polynomial is x 31 +x 28 +x 0 , this polynomial corresponds to n equal to 31, m equal to 4 is taken, and the total length of the buffered data is (16+1)x31=527, and the intermediate data number is x 248 ,x 249 ,...x 278 .

[0091] The y sequence obtained by the above formula is judged as follows:

[0092] The sequence a obtained by the above formula is n corresponding to the received sequence x 248 , x 249 , ...x 278 the seed value in the register in the PRBS generator at the moment.

[0093] In the embodiment of the application, the 800G coherent receiver adopts the above PRBS synchronization scheme, and the probability of one-time synchronization success is 76.9% under the bit error rate of 10%, and the probability of one-time synchronization success is as high as 98.7% under the bit error rate of 5%, which greatly improves the synchronization efficiency.

[0094] In the embodiment, the above scheme is specifically used to select or determine a preset threshold value, compare the first number of accumulated values with the preset threshold value respectively, obtain a corresponding first number of decision values, and use the sequence formed by the first number of decision values as the seed of the pseudo-random binary sequence. A new PRBS detection device and method are proposed. The method and device have simple structure, small operation amount, low power consumption, and synchronization efficiency far exceeding that of the correlation method under high bit error rate conditions. The logical relationship between the PRBS sequences is fully utilized, no additional overhead is required, the number of segments can be configured, and the system delay is reduced.

[0095] Referring to FIG. 9, FIG. 9 is a structural schematic diagram of a sequence seed recovery device provided by an embodiment of the application. The sequence seed recovery device shown in FIG. 9 can be used to perform part or all of the functions in the method embodiments described in the above embodiments. As shown in FIG. 9, the sequence seed recovery device includes:

[0096] An acquisition module configured to acquire cache data of a pseudo-random binary sequence;

[0097] An operation module configured to perform target operation on each bit of data in the cache data of the pseudo-random binary sequence to obtain an operation result, and perform accumulation on the operation result to obtain an accumulated result, wherein the target operation includes a modulo operation and / or an exclusive OR operation;

[0098] A decision module configured to make a decision based on the accumulated result to obtain a pseudo-random binary sequence seed, wherein the accumulated result includes a first number of accumulated values.

[0099] For example, the step of acquiring cache data of a pseudo-random binary sequence includes:

[0100] Receiving a pseudo-random binary sequence sent by a pseudo-random binary sequence source;

[0101] selecting or determining a generation polynomial of the pseudo-random binary sequence;

[0102] performing data caching according to the generation polynomial to obtain cached data of the pseudo-random binary sequence.

[0103] According to the generation polynomial, the step of performing data caching according to the generation polynomial to obtain cached data of the pseudo-random binary sequence includes:

[0104] According to the number of terms of the generation polynomial, the first number is determined, and the total number of cached segments is selected or determined;

[0105] According to the total number of cached segments, a second number is determined, and the total length of cached data is calculated according to the first number and the second number;

[0106] According to the total length of cached data, data caching is performed to obtain cached data of the pseudo-random binary sequence.

[0107] According to the generation polynomial, the step of performing data caching according to the generation polynomial to obtain cached data of the pseudo-random binary sequence includes:

[0108] From the cached data of the pseudo-random binary sequence, the first number of bit data is selected, wherein the first number of bit data includes target bit data;

[0109] Selecting forward and backward bit data at a preset distance from the target bit data, and performing modulo operation and / or XOR operation on the forward and backward bit data to obtain the operation result;

[0110] The operation result and the target bit data are accumulated to obtain the first number of accumulated values.

[0111] According to the generation polynomial, the step of performing data caching according to the generation polynomial to obtain cached data of the pseudo-random binary sequence includes:

[0112] According to the number of terms in the generation polynomial that satisfy the preset condition, a third number t is determined;

[0113] According to the third number, the first preset distance 2 i t is determined, and according to the first number and the third number, the second preset distance 2 i (n-t) is determined, wherein the value of i is related to the total number of cached segments of the cached data of the pseudo-random binary sequence.

[0114] Exemplarily, the forward and backward bit data comprises backward bit data and forward bit data, the step of selecting the forward and backward bit data with a preset distance from the target bit data and performing a modulo operation and / or an exclusive OR operation on the forward and backward bit data to obtain the operation result comprises:

[0115] selecting or determining forward bit data with a distance of the first preset distance 2 i from the target bit data along the time sequence;

[0116] selecting or determining backward bit data with a distance of the second preset distance 2 i from the target bit data along the time sequence;

[0117] performing a modulo operation on the backward bit data and the forward bit data respectively to obtain a modulo result, or performing an exclusive OR operation on the backward bit data and the forward bit data to obtain an exclusive OR result;

[0118] taking the modulo result or the exclusive OR result as the operation result.

[0119] Exemplarily, the step of performing the decision based on the exclusive OR accumulation result to obtain a pseudo-random binary sequence seed comprises:

[0120] selecting or determining a preset threshold value;

[0121] comparing the first number of accumulation values with the preset threshold value respectively to obtain a corresponding first number of decision values;

[0122] taking a sequence formed by the first number of decision values as the pseudo-random binary sequence seed.

[0123] Exemplarily, the step of comparing the first number of accumulation values with the preset threshold value respectively to obtain a corresponding first number of decision values comprises:

[0124] traversing the first number of accumulation values, comparing the accumulation value with the preset threshold value, if the accumulation value is greater than the preset threshold value, the corresponding decision value is 1, if the accumulation value is less than or equal to the preset threshold value, the corresponding decision value is 0, until the first number of decision values are obtained.

[0125] The sequence seed recovery device provided by the embodiments of the present application has similar implementation principles and beneficial effects to the technical solutions shown by the corresponding method embodiments described above, and will not be described here in detail.

[0126] In addition, the embodiment of the present application further provides a computing device, comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the computer program being configured to implement the steps of the sequence seed recovery method.

[0127] In addition, the embodiment of the present application further provides a storage medium, which is a computer-readable storage medium, and the storage medium stores a computer program, and the computer program is executed by a processor to implement the steps of the sequence seed recovery method.

[0128] The embodiment of the present application provides a sequence seed recovery method, which comprises the following steps: obtaining cache data of a pseudo-random binary sequence; performing target operation on each bit of data in the cache data of the pseudo-random binary sequence to obtain an operation result, and performing accumulation on the operation result to obtain an accumulation result, wherein the target operation comprises modulo operation and / or exclusive OR operation; and performing decision based on the accumulation result to obtain a pseudo-random binary sequence seed, wherein the accumulation result comprises a first number of accumulation values, and the pseudo-random binary sequence seed can be directly obtained by performing operation and accumulation on the obtained cache data of the pseudo-random binary sequence and performing decision without dependence on a local pseudo-random binary sequence, without related operation and with low power consumption, so that the operation efficiency of the fast recovery process of the pseudo-random binary sequence seed is improved, and thus the detection capability is improved.

[0129] It should be noted that in this document, the terms "comprising", "containing", or any other variant thereof are intended to cover non-exclusive inclusion, so that a process, method, article or system that includes a list of elements not only includes those elements, but also includes other elements not explicitly listed, or inherent to such a process, method, article or system. Without more limitations, the element defined by the statement "comprising a" does not exclude the presence of additional identical elements in the process, method, article or system that includes the element.

[0130] From the above description of the embodiments, those skilled in the art can clearly understand that the above-mentioned embodiment method can be realized by means of software and necessary general hardware platform, of course, it can also be realized by hardware, but in many cases, the former is a better embodiment. Based on such understanding, the technical solutions of the present application can be embodied in the form of a software product, which is stored in a storage medium (such as ROM / RAM, magnetic disk, optical disk) and includes a plurality of instructions for making a terminal device (which can be a mobile phone, computer, server or computing device) execute the method described in each embodiment of the present application.

[0131] The above merely provides the preferred embodiments of the present application, and is not intended to limit the patent scope of the present application. Any equivalent structure or equivalent flowchart transformation based on the content of the present application specification and drawings, or direct or indirect application in other related technical fields, are also included in the patent protection scope of the present application.

Claims

1. A sequence seed recovery method, comprising: obtaining buffered data of a pseudo-random binary sequence; performing target operation on each bit data in the buffered data of the pseudo-random binary sequence to obtain an operation result, and accumulating the operation result to obtain an accumulated result, wherein the target operation comprises modulo operation and / or exclusive OR operation; judging based on the accumulated result to obtain a pseudo-random binary sequence seed, wherein the accumulated result comprises a first number of accumulated values.

2. The sequence seed recovery method of claim 1, wherein, The step of obtaining the buffered data of the pseudo-random binary sequence comprises: receiving a pseudo-random binary sequence sent by a pseudo-random binary sequence source; selecting or determining a generating polynomial of the pseudo-random binary sequence; performing data buffering according to the generating polynomial to obtain the buffered data of the pseudo-random binary sequence.

3. The sequence seed recovery method of claim 2, wherein, The step of performing data buffering according to the generating polynomial to obtain the buffered data of the pseudo-random binary sequence comprises: determining the first number according to the term number of the generating polynomial, and selecting or determining a second number; determining a total number of buffered segments according to the second number, and determining a total length of buffered data according to the first number and the second number; performing data buffering according to the total number of buffered segments and the total length of buffered data to obtain the buffered data of the pseudo-random binary sequence.

4. The sequence seed recovery method of claim 1, wherein, The step of performing target operation on each bit data in the buffered data of the pseudo-random binary sequence to obtain an operation result, and accumulating the operation result to obtain an accumulated result comprises: selecting the first number of bit data from the buffered data of the pseudo-random binary sequence, wherein the first number of bit data comprises target bit data; selecting forward and backward bit data at a preset distance from the target bit data, and performing modulo operation and / or exclusive OR operation on the forward and backward bit data to obtain the operation result; accumulating the operation result with the target bit data to obtain the first number of accumulated values.

5. The sequence seed recovery method of claim 4, wherein, The preset distance comprises a first preset distance and a second preset distance, and the step of selecting forward and backward bit data at a preset distance from the target bit data further comprises: determining a third number according to the term number of the generating polynomial that meets a preset condition. determining the first preset distance as 2 according to the third quantity i t, and determining the second preset distance as 2 according to the first quantity and the third quantity i (n-t), wherein the value of i is related to the total quantity of the buffered data of the pseudo-random binary sequence, n is the first quantity, and t is the third quantity.

6. The sequence seed recovery method of claim 5, wherein, The forward and backward bit data comprises backward bit data and forward bit data, and the step of selecting forward and backward bit data at a preset distance from the target bit data, and performing modulo operation and / or exclusive OR operation on the forward and backward bit data to obtain the operation result comprises: selecting or determining bit data at a distance of the first preset distance from the target bit data as backward bit data along the time sequence; selecting or determining bit data at a distance of the second preset distance from the target bit data as forward bit data along the time sequence; performing modulo 2 operation on the backward bit data and the forward bit data respectively to obtain modulo results; or, performing exclusive OR operation on the backward bit data and the forward bit data respectively to obtain exclusive OR results; taking the modulo results or the exclusive OR results as the operation result.

7. The sequence seed recovery method of claim 1, wherein, The step of determining based on the exclusive or accumulation result to obtain a pseudo-random binary sequence seed comprises: selecting or determining a preset threshold value; comparing the first number of accumulation values with the preset threshold value respectively to obtain a corresponding first number of decision values; a sequence formed by the first number of decision values is taken as the pseudo-random binary sequence seed.

8. The sequence seed recovery method of claim 7, wherein, The step of comparing the first number of accumulation values with the preset threshold value respectively to obtain a corresponding first number of decision values comprises: traversing the first number of accumulation values, comparing the accumulation values with the preset threshold value, if the accumulation value is greater than the preset threshold value, the corresponding decision value is 1, if the accumulation value is less than or equal to the preset threshold value, the corresponding decision value is 0, until the first number of decision values are obtained. 9.A sequence seed recovery apparatus, comprising: an acquisition module configured to acquire cache data of a pseudo-random binary sequence; an operation module configured to perform target operation on each bit of data in the cache data of the pseudo-random binary sequence to obtain an operation result, and accumulate the operation result to obtain an accumulation result, wherein the target operation comprises a modulo operation and / or an exclusive or operation; a determination module configured to determine based on the accumulation result to obtain a pseudo-random binary sequence seed, wherein the accumulation result comprises a first number of accumulation values.

10. A computing device comprising: a memory, a processor, and a computer program stored on the memory and executable on the processor, the computer program being configured to implement the steps of the sequence seed recovery method according to any one of claims 1 to 8.

11. A storage medium, wherein, The storage medium is a computer readable storage medium, and the storage medium stores a computer program, and the computer program is executed by a processor to implement the steps of the sequence seed recovery method according to any one of claims 1 to 8.

12. A computer program product, wherein, The computer program product comprises a computer program, and the computer program is executed by a processor to implement the steps of the sequence seed recovery method according to any one of claims 1 to 8. The computer program product comprises a computer program, and the computer program is executed by a processor to implement the steps of the sequence seed recovery method according to any one of claims 1 to 8.

Images