Generator polynomial estimation method and device of Gold sequence

Abstract

The invention provides a generator polynomial estimation method and device for a Gold sequence. The generator polynomial estimation method comprises the following steps: receiving a signal and extracting a pilot frequency position in the signal through constellation mapping; extracting each pilot symbol in the signal according to the pilot position so as to confirm a pilot sequence; if the pilot frequency sequence is a Gold sequence, calculating the order of a pilot frequency sequence polynomial according to the rank solving method matrix; generating a polynomial set of the m sequence optimal pair according to the order; generating a plurality of target Gold sequences based on the m sequence optimization pairs in the polynomial set; and determining a generator polynomial of the pilot frequency sequence according to the plurality of target Gold sequences and the pilot frequency sequence. The order of the matrix is calculated through the rank solving method, only the rank of the matrix needs to be calculated, compared with a minimum calculation length method, the method is more efficient, and complexity and redundancy in subsequent calculation are effectively reduced. In addition, the data size required by the method is small, a correlation method is adopted for processing, the method has good fault-tolerant performance for the Gold sequence containing error codes, and sequence parameters can be accurately estimated.

Description

Technical Field

[0001] The present invention relates to the technical field of communication and signal processing, and in particular to a method and device for estimating a generating polynomial of a Gold sequence. Background Art

[0002] In modern communication systems, the generation and identification of pilot sequences are crucial to the accuracy and reliability of signal processing. However, when the generation method of the pilot sequence is unknown, it is difficult to determine the identity of the signal. Therefore, it is particularly important to study the generation mechanism of the pilot sequence, which usually involves the application of pseudo-random sequences (Gold sequences), in which the determination of the generating polynomial and related parameters is the key.

[0003] There are two main estimation methods for the generator polynomial of a pseudo-random sequence: the estimation method based on matching search and the estimation method based on minimum calculation length. The estimation method based on matching search constructs a set of check equations related to the generator polynomial coefficients and uses the basic characteristics of the generator polynomial in the binary domain to narrow the search range, thereby performing a matching search. The advantage of this method is that it can systematically search all possible generator polynomials, but the amount of calculation is large, especially when dealing with high bit error rate sequences, the effect is poor.

[0004] In contrast, the estimation method based on the minimum calculation length uses statistical means to preprocess the high bit error rate sequence to reduce the bit error rate, thereby generating a more reliable new sequence. However, this method is less efficient in software implementation and has certain security risks.

[0005] Therefore, how to optimize the generating polynomial of pseudo-random sequence and its estimation method is still an important research topic in pilot sequence generation and identification. Summary of the invention

[0006] In view of this, an embodiment of the present invention provides a method and device for estimating a generating polynomial of a Gold sequence, so as to solve the problem that the estimation of the generating polynomial of the Gold sequence is difficult and inefficient.

[0007] To achieve the above objectives, the embodiments of the present invention provide the following technical solutions:

[0008] The first aspect of the present invention discloses a method for estimating a generating polynomial of a Gold sequence, the method comprising:

[0009] receiving a signal, and extracting a pilot position in the signal through constellation mapping;

[0010] Extracting each pilot symbol in the signal according to the pilot position, and confirming a pilot sequence according to the pilot symbol;

[0011] If the pilot sequence is a Gold sequence, the order of the pilot sequence polynomial is calculated according to a rank method matrix;

[0012] Generate a polynomial set of preferred pairs of maximum length sequences according to the order;

[0013] Generate multiple target Gold sequences based on the maximum length sequence in the polynomial set;

[0014] A generating polynomial of the pilot sequence is confirmed according to the plurality of target Gold sequences and the pilot sequence.

[0015] Preferably, the receiving signal and extracting the pilot position in the signal through constellation mapping includes:

[0016] receiving a signal, and performing bandpass filtering on the signal to obtain a narrowband signal;

[0017] Performing Fourier transform on the narrowband signal to obtain a frequency domain signal;

[0018] The pilot positions in the frequency domain signal are mapped through a constellation diagram.

[0019] Preferably, the calculating the order of the pilot sequence polynomial according to the rank method matrix includes:

[0020] Converting the pilot sequence into a matrix;

[0021] Converting the matrix into a row-reduced echelon matrix based on a matrix row transformation method;

[0022] The order of the pilot sequence polynomial is extracted from the row reduced echelon form matrix.

[0023] Preferably, the polynomial set for generating the preferred pair of maximum length sequences according to the order includes:

[0024] Constructing a polynomial according to the order of the pilot sequence polynomial, and generating a set of primitive polynomials according to the polynomial;

[0025] Setting different initial states of a linear feedback shift register, and determining a maximum length sequence set according to the primitive polynomial set; wherein the different initial states of the linear feedback shift register are non-all-0 initial states;

[0026] Calculating the peak value of the mutual correlation function of each maximum length sequence pair in the maximum length sequence set; wherein the maximum length sequence pair is a combination of any two maximum length sequences in the maximum length sequence set;

[0027] The maximum length sequence pair corresponding to the mutual correlation function with a peak value greater than a preset threshold is marked as a preferred pair, and a polynomial set of the preferred pair is obtained.

[0028] Preferably, the confirming a generating polynomial of the pilot sequence according to the plurality of target Gold sequences and the pilot sequence comprises:

[0029] Calculating the peak value of the cross-correlation function between each of the target Gold sequences and the pilot sequence;

[0030] Mark the target Gold sequence corresponding to the largest peak among all peaks as the optimal Gold sequence;

[0031] The maximum length sequence pair corresponding to the optimal Gold sequence is preferably confirmed as a generating polynomial of the pilot sequence.

[0032] A second aspect of the present invention discloses a device for estimating a generator polynomial of a Gold sequence, the device comprising:

[0033] A receiving unit, used for receiving a signal and extracting a pilot position in the signal through constellation mapping;

[0034] an extraction unit, configured to extract each pilot symbol in the signal according to the pilot position, and confirm a pilot sequence according to the pilot symbol;

[0035] a calculation unit, configured to calculate the order of the pilot sequence polynomial according to a rank-finding matrix if the pilot sequence is a Gold sequence;

[0036] A first generating unit, configured to generate a polynomial set of preferred pairs of maximum length sequences according to the order;

[0037] A second generating unit, configured to generate a plurality of target Gold sequences based on the maximum length sequence preferred pair in the polynomial set;

[0038] A confirmation unit is used to confirm a generating polynomial of the pilot sequence according to a plurality of the target Gold sequences and the pilot sequence.

[0039] Preferably, the receiving unit comprises:

[0040] A bandpass filtering module, used for receiving a signal and performing bandpass filtering on the signal to obtain a narrowband signal;

[0041] A Fourier transform module, used for performing Fourier transform on the narrowband signal to obtain a frequency domain signal;

[0042] A mapping module is used to map the pilot position in the frequency domain signal through a constellation diagram.

[0043] Preferably, the computing unit is specifically used for:

[0044] The pilot sequence is converted into a matrix; the matrix is ​​converted into a row-reduced echelon matrix based on a matrix row transformation method; and the order of the pilot sequence polynomial is extracted from the row-reduced echelon matrix.

[0045] Preferably, the first generating unit includes:

[0046] A construction module, configured to construct a polynomial according to the order of the pilot sequence polynomial, and generate a set of original polynomials according to the polynomial;

[0047] A determination module, used for setting different initial states of a linear feedback shift register, and determining a maximum length sequence set according to the primitive polynomial set; wherein the different initial states of the linear feedback shift register are non-all-0 initial states;

[0048] A first calculation module is used to calculate the peak value of the mutual correlation function of each maximum length sequence pair in the maximum length sequence set; wherein the maximum length sequence pair is a combination of any two maximum length sequences in the maximum length sequence set;

[0049] The first marking module is used to mark the maximum length sequence pair corresponding to the mutual correlation function with a peak value greater than a preset threshold as a preferred pair, so as to obtain a polynomial set of the preferred pairs.

[0050] Preferably, the confirmation unit comprises:

[0051] A second calculation module, used for calculating the peak value of the cross-correlation function between each of the target Gold sequences and the pilot sequence;

[0052] A first marking module is used to mark the target Gold sequence corresponding to the largest peak among all the peaks as the optimal Gold sequence;

[0053] The confirmation module is used to confirm the maximum length sequence preferred pair corresponding to the optimal Gold sequence as the generating polynomial of the pilot sequence.

[0054] Based on the above-mentioned embodiment of the present invention, a method and device for estimating the generating polynomial of a Gold sequence provided, a signal is received and the pilot position in the signal is extracted through constellation mapping; each pilot symbol in the signal is extracted according to the pilot position, thereby confirming the pilot sequence; if the pilot sequence is a Gold sequence, the order of the pilot sequence polynomial is calculated according to the rank method matrix; a polynomial set of m-sequence preferred pairs is generated according to the order; multiple target Gold sequences are generated based on the m-sequence preferred pairs in the polynomial set; based on multiple target Gold sequences and pilot sequences, the generating polynomial of the pilot sequence is confirmed. By calculating the order of the matrix through the rank method, only the rank of the matrix needs to be calculated, which is more efficient than the minimum calculation length method, and effectively reduces the complexity and redundancy in subsequent calculations. In addition, the method requires a small amount of data, and uses the correlation method for processing, has good fault tolerance for Gold sequences containing errors, and can accurately estimate sequence parameters. BRIEF DESCRIPTION OF THE DRAWINGS

[0055] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on the provided drawings without paying creative work.

[0056] Figure 1 A flowchart of a method for estimating a generating polynomial of a Gold sequence provided by an embodiment of the present invention;

[0057] Figure 2 A flowchart of extracting the pilot position in a signal provided by an embodiment of the present invention;

[0058] Figure 3 A flowchart of calculating the order of a pilot sequence polynomial according to a rank-finding matrix provided in an embodiment of the present invention;

[0059] Figure 4 A flowchart of a polynomial set for generating a preferred pair of maximum length sequences according to the order provided by an embodiment of the present invention;

[0060] Figure 5 A flow chart of a generator polynomial for confirming a pilot sequence provided by an embodiment of the present invention;

[0061] Figure 6 A structural block diagram of a Gold sequence generating polynomial estimation device provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0062] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0063] In this application, the terms "comprises", "comprising" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device comprising a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, an element defined by the sentence "comprising a ..." does not exclude the presence of other identical elements in the process, method, article or device comprising the element.

[0064] As can be seen from the background technology, the estimation method of the generator polynomial of the pseudo-random sequence based on matching search has a large amount of calculation, especially when processing high bit error rate sequences, the effect is poor. The estimation method of the generator polynomial of the pseudo-random sequence based on the minimum calculation length is less efficient in software implementation and has certain security risks.

[0065] Therefore, the embodiment of the present invention provides a method and device for estimating the generating polynomial of a Gold sequence, which receives a signal and extracts the pilot position in the signal through constellation mapping; extracts each pilot symbol in the signal according to the pilot position, thereby confirming the pilot sequence; if the pilot sequence is a Gold sequence, the order of the pilot sequence polynomial is calculated according to the rank method matrix; a polynomial set of m-sequence preferred pairs is generated according to the order; multiple target Gold sequences are generated based on the m-sequence preferred pairs in the polynomial set; and the generating polynomial of the pilot sequence is confirmed according to multiple target Gold sequences and pilot sequences. By calculating the order of the matrix through the rank method, only the rank of the matrix needs to be calculated, which is more efficient than the minimum calculation length method, and effectively reduces the complexity and redundancy in subsequent calculations. In addition, the method requires a small amount of data, and uses the correlation method for processing, has good fault tolerance for Gold sequences containing errors, and can accurately estimate sequence parameters.

[0066] See also Figure 1 , shows a flow chart of a method for estimating a generating polynomial of a Gold sequence provided in an embodiment of the present invention.

[0067] It should be noted that the Gold sequence pilot refers to the use of the Gold sequence as a pilot. The pilot in the signal, as a known signal, can help the receiving end estimate the transmission characteristics of the channel, such as the impulse response or frequency response of the channel, so as to perform channel equalization, compensate for the distortion caused by the channel, and improve the quality of the received signal. However, if the signal uses the same pilot sequence, pilot contamination will occur and the ID cannot be distinguished. Therefore, it is necessary to generate a special pilot based on the device ID using a pseudo-random sequence with good performance.

[0068] The Gold sequence is a pseudo-random sequence with good characteristics proposed on the basis of the m-sequence (Maximum Length Sequence). It is composed of two m-sequence pairs with equal code length and the same code clock rate, which are preferably added modulo 2. Different Gold sequences can be obtained by setting different initial states of the m-sequence generator. It is a pseudo-random sequence with good autocorrelation and cross-correlation characteristics, and is widely used in LTE, 5G, and drone broadband signal pilot generation.

[0069] It is understandable that, in order to solve the problem that the pilot sequence is unknown and the signal pilot sequence generation method cannot be confirmed, and then the ID cannot be determined, it is necessary to study how the pilot sequence is generated. And to study the generation of the pilot sequence, it is necessary to study what kind of pseudo-random sequence is used, and how to determine the pseudo-random sequence generating polynomial and related parameters. In other words, Gold sequence pilot parameter estimation is a necessary step for the receiving end to analyze the signal. The core of the present invention is to perform matrix fast operations on the Gold sequence pilot to solve the problem of difficult Gold sequence pilot parameter estimation. Therefore, the method includes:

[0070] Step S101: receiving a signal, and extracting a pilot position in the signal through constellation mapping.

[0071] In the specific implementation of step S101, in an actual communication system, a signal is first received from a channel, the signal is converted into a frequency domain, a valid position in the frequency domain signal is extracted, and a pilot position in the signal is extracted through constellation mapping.

[0072] The specific process of extracting the pilot position in the signal is detailed in the embodiment of the present invention. Figure 2 The content in Figure 2 include:

[0073] Step S201: Receive a signal and perform bandpass filtering on the signal to obtain a narrowband signal.

[0074] It should be noted that the signal received from the channel is usually a broadband signal. Therefore, after receiving the signal, it is necessary to perform bandpass filtering on the signal to obtain a narrowband signal.

[0075] Step S202: Perform Fourier transform on the narrowband signal to obtain a frequency domain signal.

[0076] It is understandable that by Fourier transform (such as fast Fourier transform, FFT), the narrowband signal is converted into the frequency domain to obtain a frequency domain signal. This is helpful for further signal processing, especially in a multipath propagation environment, where frequency domain processing can more clearly show the spectral characteristics of the signal.

[0077] Step S203: Map the pilot positions in the frequency domain signal through a constellation diagram.

[0078] It should be noted that when using the modulation method of Quadrature Amplitude Modulation (QAM), the constellation diagram is used to represent the amplitude and phase information of different symbols. Pilot symbols are special symbols used for channel estimation, synchronization and other system control functions. These symbols usually have a predetermined specific position in the constellation diagram.

[0079] In QAM modulation, each point in the constellation diagram represents a symbol, which usually consists of two parts: amplitude and phase.

[0080] In the specific implementation of step S203, the constellation point of the pilot symbol in the frequency domain signal is determined according to the pilot insertion rule and the QAM order, thereby determining the pilot position.

[0081] Step S102: extract each pilot symbol in the signal according to the pilot position, and confirm the pilot sequence according to the pilot symbol.

[0082] In the specific implementation of step S102, according to the frequency domain position of the pilot, the pilot symbols are sequentially extracted from the frequency domain signal, and then an inverse Fourier transform is performed to convert the frequency domain signal into the time domain to obtain the pilot signal. By performing correlation analysis on the pilot symbol and the preset pilot signal, it is possible to calculate whether the pilot signal in each symbol exists, and determine the number of pilots according to the correlation, thereby obtaining the number of pilot signals, and according to the number of pilot signals and the pilot position, combined with the modulation method in the system, the pilot sequence is restored.

[0083] It is understandable that the pilot symbol is usually preset at a specific position in the frequency domain according to certain rules, usually a frequency subcarrier position specified during system design. After the predetermined position of the pilot is known, the pilot signal can be extracted from the pilot symbol.

[0084] It should be noted that the correlation method is a signal processing method used to determine the similarity between signals. Specifically, by performing a sliding cross-correlation operation, all peak points of the pilot symbol and the preset pilot signal are found, and the number of pilot signals in each pilot symbol can be obtained.

[0085] In practical applications, after obtaining the pilot sequence, the pilot sequence is judged to be a Gold sequence based on the three-value autocorrelation characteristics of the Gold sequence (i.e., the values ​​of the autocorrelation function under different time delays are +1, 0, or -1). In other words, if the pilot sequence is a Gold sequence, it should have a three-value autocorrelation characteristic. That is, when two different Gold sequences are aligned, their autocorrelation should be +1; when there is a time delay between the two Gold sequences, the autocorrelation should be close to 0; when they are reversely overlapped, the autocorrelation should be -1. The autocorrelation function of the pilot sequence can be calculated to verify whether it meets this three-value autocorrelation characteristic.

[0086] Step S103: If the pilot sequence is a Gold sequence, the order of the pilot sequence polynomial is calculated according to the rank-finding matrix.

[0087] In the specific implementation of step S103, if the pilot sequence is determined to be a Gold sequence according to the three-value autocorrelation characteristic of the Gold sequence, the order of the pilot sequence polynomial is calculated according to the rank method matrix.

[0088] It can be understood that the specific process of calculating the order of the pilot sequence polynomial according to the rank method matrix is ​​detailed in the embodiment of the present invention. Figure 3 The content in Figure 3 include:

[0089] Step S301: Convert the pilot sequence into a matrix.

[0090] It can be understood that, since the Gold sequence is a linear feedback sequence, the pilot sequence can be converted into a matrix according to the linear relationship of the sequence.

[0091] Step S302: transforming the matrix into a row reduced echelon matrix based on a matrix row transformation method.

[0092] In the specific implementation of step S302, the matrix is ​​transformed into a row-reduced echelon matrix by using a matrix row transformation method.

[0093] Step S303: extracting the order of the pilot sequence polynomial from the row reduced echelon matrix.

[0094] It should be noted that the number of non-zero rows in the row reduced echelon form is the rank of the matrix, and the rank of the matrix is ​​extracted from the row reduced echelon form matrix as the order of the pilot sequence polynomial.

[0095] Step S104: Generate a polynomial set of preferred pairs of maximum length sequences according to the order.

[0096] In the specific implementation of step S104, a primitive polynomial set is generated according to the order of the pilot sequence polynomial, a maximum length sequence set (i.e., an m-sequence set) is generated by combining the primitive polynomial set with the linear feedback shift registers in different initial states, and a polynomial set of m-sequence preferred pairs is determined from the m-sequence set. In other words, the polynomial set of m-sequence preferred pairs contains multiple pairs of m-sequence preferred pairs.

[0097] It can be understood that the process of generating a polynomial set of the maximum length sequence preferred pair according to the order is detailed in the embodiment of the present invention. Figure 4 The content in Figure 4 include:

[0098] Step S401: construct a polynomial according to the order of the pilot sequence polynomial, and generate a set of primitive polynomials according to the polynomial.

[0099] In the specific implementation of step S401, a polynomial is constructed according to the order of the pilot sequence polynomial. For example, if the order of the pilot sequence polynomial is n, an n-order polynomial is constructed. For each n-order polynomial, it is verified whether the n-order polynomial is an irreducible polynomial, thereby obtaining a primitive polynomial set.

[0100] It is understandable that a primitive polynomial is an irreducible polynomial, so it is verified whether each n-order polynomial is an irreducible polynomial. If an n-order polynomial is an irreducible polynomial, then the n-order polynomial is a primitive polynomial.

[0101] Step S402: setting different initial states of the linear feedback shift register, and determining a maximum length sequence set according to the primitive polynomial set.

[0102] It should be noted that each maximum length sequence (ie, m-sequence) is generated by a linear feedback shift register (LFSR), and the initial value of the LFSR, ie, the initial bit pattern in the register, determines the generated m-sequence.

[0103] It is understood that when using a linear feedback shift register (LFSR) to generate an m-sequence, the initial state is the starting value of the shift register. Each LFSR has multiple register bits that are used to store binary values ​​(0 or 1). If the initial value of all registers is 0, that is, the all-0 state, the LFSR will not work properly because in this state, all outputs will always be 0. The core feature of the LFSR is to generate different values ​​through a feedback mechanism, and the all-0 state has no feedback mechanism, so it cannot produce a valid sequence. Based on this, the different initial states of the linear feedback shift register are non-all-0 initial states.

[0104] In the specific implementation of step S402, by setting different non-all-zero initial states of the linear feedback shift register, a maximum length sequence set is determined based on the primitive polynomial set and the m-sequence generation formula.

[0105] In some embodiments, after generating multiple maximum length sequences based on a primitive polynomial set and an m-sequence generation formula by setting different non-all-zero initial states of a linear feedback shift register, a final set of maximum length sequences that can be used to generate a Gold sequence is determined by evaluating properties such as balance, autocorrelation, and linear complexity of these maximum length sequences.

[0106] Step S403: Calculate the peak value of the cross-correlation function of each maximum length sequence pair in the maximum length sequence set.

[0107] It should be noted that the maximum length sequence pair is a combination of any two maximum length sequences in the maximum length sequence set.

[0108] In the specific process of implementing step S403, for each pair of maximum length sequences in the maximum length sequence set, the peak value of the cross-correlation function is calculated.

[0109] Step S404: Mark the maximum length sequence pairs corresponding to the cross-correlation functions with peak values ​​greater than a preset threshold as preferred pairs, and obtain a polynomial set of preferred pairs.

[0110] In the specific implementation of step S404, according to the principle of minimizing mutual correlation, the maximum length sequence pairs corresponding to the mutual correlation functions with peak values ​​greater than a preset threshold are selected from all peak values ​​and marked as preferred pairs, thereby obtaining a polynomial set of preferred pairs.

[0111] It can be understood that, according to the principle of minimizing mutual correlation, the maximum length sequence pairs with the smallest mutual correlation peak are preferentially selected because the similarity between them is the lowest, which can reduce mutual interference, thereby improving the performance and stability of the system.

[0112] Step S105: Generate multiple target Gold sequences based on the maximum length sequence preference pairs in the polynomial set.

[0113] It should be noted that the Gold sequence is obtained by performing an XOR operation on two maximum length sequences.

[0114] In the specific implementation of step S105, multiple target Gold sequences are generated by using the maximum length sequence optimization pairs in the polynomial set.

[0115] Step S106: confirming the generating polynomial of the pilot sequence according to the multiple target Gold sequences and the pilot sequences.

[0116] In the specific implementation of step S106, the cross-correlation function between each target Gold sequence and the pilot sequence in multiple target Gold sequences is calculated, and the maximum length sequence corresponding to the most correlated target Gold sequence is preferably confirmed as the generating polynomial of the pilot sequence.

[0117] It can be understood that the process of confirming the generating polynomial of the pilot sequence is detailed in the embodiment of the present invention. Figure 5 The content in Figure 5 include:

[0118] Step S501: Calculate the peak value of the cross-correlation function between each target Gold sequence and the pilot sequence.

[0119] In the specific process of implementing step S501, for each target Gold sequence, the peak value of the cross-correlation function between the target Gold sequence and the pilot sequence is calculated to obtain the peak value corresponding to each target Gold sequence.

[0120] Step S502: Mark the target Gold sequence corresponding to the largest peak among all the peaks as the optimal Gold sequence.

[0121] In the specific implementation of step S502, the largest peak value is selected from the peak values ​​corresponding to all target Gold sequences, and the target Gold sequence corresponding to the largest peak value is marked as the optimal Gold sequence.

[0122] Step S503: The maximum length sequence pair corresponding to the optimal Gold sequence is selected and confirmed as the generating polynomial of the pilot sequence.

[0123] In the specific implementation of step S503, the maximum length sequence pair corresponding to the optimal Gold sequence is selected and confirmed as the generating polynomial of the pilot sequence.

[0124] In some specific embodiments, after confirming the generating polynomial of the pilot sequence, the primitive polynomial and initial state of the optimal pair of maximum length sequences that produce the optimal Gold sequence are further estimated, providing strong support for the in-depth analysis and application of the Gold sequence.

[0125] In the embodiment of the present invention, various factors are comprehensively considered for the actual engineering scenario, and the rank method is combined to perform efficient search and matching, so as to accurately estimate the order of the pilot sequence polynomial. In the rank process, the overall amount of calculation is reduced by optimizing the calculation steps and reducing unnecessary calculations. At the same time, since only the rank of the matrix needs to be calculated, the problems caused by calculation errors are also reduced, thereby improving the accuracy of the algorithm. In addition, the method requires a small amount of data, and uses the correlation method for processing, has good fault tolerance for Gold sequences containing errors, and can accurately estimate the sequence parameters.

[0126] Corresponding to the method for estimating the generating polynomial of a Gold sequence provided in the above embodiment of the present invention, see Figure 6 , shows a structural block diagram of a Gold sequence generating polynomial estimation device provided by an embodiment of the present invention.

[0127] The estimation device includes: a receiving unit 601 , an extracting unit 602 , a calculating unit 603 , a first generating unit 604 , a second generating unit 605 and a confirming unit 606 .

[0128] The receiving unit 601 is used to receive a signal and extract a pilot position in the signal through constellation mapping.

[0129] The extraction unit 602 is used to extract each pilot symbol in the signal according to the pilot position, and confirm the pilot sequence according to the pilot symbol.

[0130] The calculation unit 603 is configured to calculate the order of the pilot sequence polynomial according to the rank-finding matrix if the pilot sequence is a Gold sequence.

[0131] The first generating unit 604 is used to generate a polynomial set of preferred pairs of maximum length sequences according to the order.

[0132] The second generating unit 605 is configured to generate a plurality of target Gold sequences based on the maximum length sequence preferred pair in the polynomial set.

[0133] The confirmation unit 606 is used to confirm the generating polynomial of the pilot sequence according to multiple target Gold sequences and pilot sequences.

[0134] In the embodiment of the present invention, various factors are comprehensively considered for the actual engineering scenario, and the rank method is combined to perform efficient search and matching, so as to accurately estimate the order of the pilot sequence polynomial. In the rank process, the overall amount of calculation is reduced by optimizing the calculation steps and reducing unnecessary calculations. At the same time, since only the rank of the matrix needs to be calculated, the problems caused by calculation errors are also reduced, thereby improving the accuracy of the algorithm. In addition, the method requires a small amount of data, and uses the correlation method for processing, has good fault tolerance for Gold sequences containing errors, and can accurately estimate the sequence parameters.

[0135] Combination Figure 6 The content shown, the receiving unit 601, includes: a bandpass filtering module, a Fourier transform module and a mapping module.

[0136] The bandpass filtering module is used to receive a signal and perform bandpass filtering on the signal to obtain a narrowband signal.

[0137] The Fourier transform module is used to perform Fourier transform on the narrowband signal to obtain a frequency domain signal.

[0138] The mapping module is used to map the pilot position in the frequency domain signal through the constellation diagram.

[0139] Combination Figure 6 The content shown, the calculation unit 603 is specifically used to: convert the pilot sequence into a matrix; convert the matrix into a row simplified echelon matrix based on the matrix row transformation method; extract the order of the pilot sequence polynomial from the row simplified echelon matrix.

[0140] Combination Figure 6 The content shown, the first generating unit 604, includes: a construction module, a determination module, a first calculation module and a first marking module.

[0141] The construction module is used to construct a polynomial according to the order of the pilot sequence polynomial and generate a set of original polynomials according to the polynomial.

[0142] The determination module is used to set different initial states of the linear feedback shift register and determine the maximum length sequence set according to the primitive polynomial set; wherein the different initial states of the linear feedback shift register are non-all-0 initial states.

[0143] The first calculation module is used to calculate the peak value of the mutual correlation function of each maximum length sequence pair in the maximum length sequence set; wherein the maximum length sequence pair is a combination of any two maximum length sequences in the maximum length sequence set.

[0144] The first marking module is used to mark the maximum length sequence pairs corresponding to the mutual correlation functions with peak values ​​greater than a preset threshold as preferred pairs, and obtain a polynomial set of preferred pairs.

[0145] Combination Figure 6 As shown in the content, the confirmation unit 606 includes: a second calculation module, a first marking module and a confirmation module.

[0146] The second calculation module is used to calculate the peak value of the cross-correlation function between each target Gold sequence and the pilot sequence.

[0147] The first marking module is used to mark the target Gold sequence corresponding to the largest peak among all the peaks as the optimal Gold sequence.

[0148] The confirmation module is used to confirm the maximum length sequence pair corresponding to the optimal Gold sequence as the generating polynomial of the pilot sequence.

[0149] Each embodiment in this specification is described in a progressive manner, and the same or similar parts between the embodiments can refer to each other, and each embodiment focuses on the differences from other embodiments. In particular, for the system or system embodiment, since it is basically similar to the method embodiment, the description is relatively simple, and the relevant parts can refer to the partial description of the method embodiment. The system and system embodiments described above are merely schematic, wherein the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place, or they may be distributed on multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the scheme of this embodiment. Ordinary technicians in this field can understand and implement it without creative work.

[0150] Professionals may further appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, computer software, or a combination of the two. In order to clearly illustrate the interchangeability of hardware and software, the composition and steps of each example have been generally described in the above description according to function. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professionals and technicians may use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of the present invention.

[0151] The above description of the disclosed embodiments enables those skilled in the art to implement or use the present invention. Various modifications to these embodiments will be apparent to those skilled in the art, and the general principles defined herein may be implemented in other embodiments without departing from the scope of the present invention. Therefore, the present invention will not be limited to the embodiments shown herein, but rather to the widest scope consistent with the principles and novel features disclosed herein.

Claims

1. A method for estimating a generating polynomial of a Gold sequence, characterized in that: The method comprises: receiving a signal, and extracting a pilot position in the signal through constellation mapping; Extracting each pilot symbol in the signal according to the pilot position, and confirming a pilot sequence according to the pilot symbol; If the pilot sequence is a Gold sequence, the order of the pilot sequence polynomial is calculated according to a rank method matrix; Generate a polynomial set of preferred pairs of maximum length sequences according to the order; Generate multiple target Gold sequences based on the maximum length sequence in the polynomial set; A generating polynomial of the pilot sequence is confirmed according to the plurality of target Gold sequences and the pilot sequence.

2. The method according to claim 1, characterized in that The receiving signal and extracting the pilot position in the signal through constellation mapping includes: receiving a signal, and performing bandpass filtering on the signal to obtain a narrowband signal; Performing Fourier transform on the narrowband signal to obtain a frequency domain signal; The pilot positions in the frequency domain signal are mapped through a constellation diagram.

3. The method according to claim 1, characterized in that The step of calculating the order of the pilot sequence polynomial according to the rank-finding matrix comprises: Converting the pilot sequence into a matrix; Converting the matrix into a row-reduced echelon matrix based on a matrix row transformation method; The order of the pilot sequence polynomial is extracted from the row reduced echelon form matrix.

4. The method according to claim 1, characterized in that: The polynomial set for generating the preferred pair of maximum length sequences according to the order includes: Constructing a polynomial according to the order of the pilot sequence polynomial, and generating a set of primitive polynomials according to the polynomial; Setting different initial states of a linear feedback shift register, and determining a maximum length sequence set according to the primitive polynomial set; wherein the different initial states of the linear feedback shift register are non-all-0 initial states; Calculating the peak value of the mutual correlation function of each maximum length sequence pair in the maximum length sequence set; wherein the maximum length sequence pair is a combination of any two maximum length sequences in the maximum length sequence set; The maximum length sequence pair corresponding to the mutual correlation function with a peak value greater than a preset threshold is marked as a preferred pair, and a polynomial set of the preferred pair is obtained.

5. The method according to claim 1, characterized in that The step of confirming a generating polynomial of the pilot sequence according to the plurality of target Gold sequences and the pilot sequence comprises: Calculating the peak value of the cross-correlation function between each of the target Gold sequences and the pilot sequence; Mark the target Gold sequence corresponding to the largest peak among all peaks as the optimal Gold sequence; The maximum length sequence pair corresponding to the optimal Gold sequence is preferably confirmed as a generating polynomial of the pilot sequence.

6. A device for estimating a generating polynomial of a Gold sequence, characterized in that: The device comprises: A receiving unit, used for receiving a signal and extracting a pilot position in the signal through constellation mapping; an extraction unit, configured to extract each pilot symbol in the signal according to the pilot position, and confirm a pilot sequence according to the pilot symbol; a calculation unit, configured to calculate the order of the pilot sequence polynomial according to a rank-finding matrix if the pilot sequence is a Gold sequence; A first generating unit, configured to generate a polynomial set of preferred pairs of maximum length sequences according to the order; A second generating unit, configured to generate a plurality of target Gold sequences based on the maximum length sequence preferred pair in the polynomial set; A confirmation unit is used to confirm a generating polynomial of the pilot sequence according to a plurality of the target Gold sequences and the pilot sequence.

7. The device according to claim 6, characterized in that The receiving unit comprises: A bandpass filtering module, used for receiving a signal and performing bandpass filtering on the signal to obtain a narrowband signal; A Fourier transform module, used for performing Fourier transform on the narrowband signal to obtain a frequency domain signal; A mapping module is used to map the pilot position in the frequency domain signal through a constellation diagram.

8. The device according to claim 6, characterized in that The computing unit is specifically used for: The pilot sequence is converted into a matrix; the matrix is ​​converted into a row-reduced echelon matrix based on a matrix row transformation method; and the order of the pilot sequence polynomial is extracted from the row-reduced echelon matrix.

9. The device according to claim 6, characterized in that The first generating unit comprises: A construction module, configured to construct a polynomial according to the order of the pilot sequence polynomial, and generate a set of original polynomials according to the polynomial; A determination module, used for setting different initial states of a linear feedback shift register, and determining a maximum length sequence set according to the primitive polynomial set; wherein the different initial states of the linear feedback shift register are non-all-0 initial states; A first calculation module is used to calculate the peak value of the mutual correlation function of each maximum length sequence pair in the maximum length sequence set; wherein the maximum length sequence pair is a combination of any two maximum length sequences in the maximum length sequence set; The first marking module is used to mark the maximum length sequence pair corresponding to the mutual correlation function with a peak value greater than a preset threshold as a preferred pair, so as to obtain a polynomial set of the preferred pairs.

10. The device according to claim 6, characterized in that The confirmation unit comprises: A second calculation module, used for calculating the peak value of the cross-correlation function between each of the target Gold sequences and the pilot sequence; A first marking module is used to mark the target Gold sequence corresponding to the largest peak among all the peaks as the optimal Gold sequence; The confirmation module is used to confirm the maximum length sequence preferred pair corresponding to the optimal Gold sequence as the generating polynomial of the pilot sequence.

Images