Method for Estimating Symbol Period and Symbol Synchronization of Rectangular Pulse-Shaped Digital Communication Signals

Abstract

The present invention provides a method for estimating the symbol period and symbol synchronization of a rectangular pulse-shaped digital communication signal, belonging to the field of communication technology. A dynamic matrix is constructed to distinguish different symbol data; based on the dynamic matrix, the larger value of the average values obtained from two segmented matrices is taken as S[M], and the absolute value waveform of the difference of S[M] is obtained cyclically, and the initial estimate of the symbol period is obtained according to the maximum point; further, according to the initial estimate, the symbol period estimate value is obtained to achieve symbol synchronization on the basis of the symbol period estimate value. Without knowing the signal modulation system, the present invention does not add additional steps for identifying the modulation system, but directly provides a general method for estimating the symbol period of rectangular pulse-shaped digital communication signals of various different typical systems, and realizes symbol synchronization on the basis of estimating the symbol period, simplifying the entire estimation process and reducing the difficulty of hardware implementation compared with the prior art.

Description

Technical Field

[0001] The present invention relates to the field of communication technologies, and in particular, to a method for estimating the symbol period and symbol synchronization of a rectangular pulse-shaped digital communication signal. Background Art

[0002] For a digitally intercepted communication signal, the key to realizing information extraction under non-cooperative conditions lies in estimating its modulation parameters. One of the most critical modulation parameters is the symbol period of the signal. Mastering the symbol period also means clarifying the time width occupied by each information symbol of the signal, and at the same time provides conditions for blind symbol synchronization under non-cooperative conditions.

[0003] Since it is easy to form and transform, rectangular pulses are the most common in digital communication signal waveforms. Analyzing them through wavelet transform or cyclic spectrum is a common method for symbol period estimation. However, since digital communication signals have various different modulation systems, such as mQAM, mPSK, mFSK, mASK, etc., the estimation methods for various systems are different. For signals of different systems, corresponding estimation methods need to be used to obtain better estimation effects. Therefore, modulation recognition needs to be performed before estimation, which makes the entire estimation process complex and also increases the difficulty of hardware implementation. Summary of the Invention

[0004] The present invention provides a method for estimating the symbol period and symbol synchronization of a rectangular pulse-shaped digital communication signal to solve the defect in the prior art that corresponding estimation methods need to be used for signals of different systems, resulting in a relatively complex estimation process.

[0005] In a first aspect, the present invention provides a method for estimating the symbol period and symbol synchronization of a rectangular pulse-shaped digital communication signal, including:

[0006] Step 1: Set the value range for symbol period estimation as [N min , N max , the column value of the dynamic matrix as r, and the symbol period parameter as M; and, M = N min ;

[0007] Step 2: Enter a loop to execute Steps 21 to 26:

[0008] Step 21: Take the first M·r data from the discrete signal data x[n] to construct a dynamic matrix D of M rows and r columns M :

[0009]

[0010] Step 22: According to the symbol period parameter, divide the dynamic matrix evenly by rows into a first segmentation matrix and a second segmentation matrix; the number of rows of the first segmentation matrix is P1(M), the number of rows of the second segmentation matrix is P2(M), and P2(M) = M - P1(M);

[0011] Step 23: Perform normalization processing on the first segmentation matrix and the second segmentation matrix respectively to obtain the corresponding first normalized segmentation matrix and second normalized segmentation matrix;

[0012] Step 24: Perform P1(M)-point fast Fourier transform on each column of the first normalized segmentation matrix, obtain the amplitude values after the fast Fourier transform to form a first recombination matrix, perform P2(M)-point fast Fourier transform on each column of the second normalized segmentation matrix, obtain the amplitude values after the fast Fourier transform to form a second recombination matrix;

[0013] Step 25: Determine the average value of the maximum values of each column corresponding to the first recombination matrix according to the maximum values of each column of the first recombination matrix; determine the average value of the maximum values of each column corresponding to the second recombination matrix according to the maximum values of each column of the second recombination matrix; take the larger value of the average values corresponding to the first recombination matrix and the second recombination matrix as S[M];

[0014] Step 26: Let M = M + 1, if M > N max , continue to execute Step 3; otherwise, return to execute Step 2;

[0015] Step 3: In the range of M ∈ [N min +1, N max , calculate the absolute value of the difference signal of S[M], and find its corresponding maximum point to obtain the initial estimate of the symbol period Specifically:

[0016]

[0017] Among them, is the absolute value of the difference signal of S[M];

[0018] Step 4: Set k = 2, 0 < β < 1, and the number of loop times K;

[0019] Step 5: Enter the loop to execute Steps 51 to 53:

[0020] Step 51: If or continue to execute Step 52; otherwise, execute Step 53;

[0021] Step 52: If then Otherwise, let wherein denotes rounding down of and denotes rounding up of ;

[0022] Step 53: Let k = k + 1. If k ≤ K, then return to execute Step 5; otherwise, exit the loop and output the symbol period estimate N T , so as to achieve symbol synchronization based on the symbol period estimate; wherein

[0023] According to the symbol period estimation and symbol synchronization method for rectangular pulse-shaped digital communication signals provided by the present invention, symbol synchronization is achieved based on the output symbol period estimate, specifically including:

[0024] Step 6: Set the parameter q and set q = 1;

[0025] Step 7: Enter a loop and execute Steps 71 to 74:

[0026] Step 71: Construct a shifted shift matrix:

[0027]

[0028] wherein denotes the shift matrix, denotes the i-th column of the shift matrix; i = 1, 2..., r;

[0029] Step 72: Perform an N T -point fast Fourier transform on each column of the shifted shift matrix, and take the magnitude values after the fast Fourier transform to form a third recombination matrix;

[0030] Step 73: Determine the average value of the maximum values of each column according to the maximum values of each column of the third recombination matrix

[0031] Step 74: Let q = q + 1. If q > N T , execute Step 8; otherwise, return to execute Step 7;

[0032] Step 8: In the range of q ∈ [1, N T , find the maximum value point corresponding to to achieve symbol synchronization of the signal.

[0033] According to the symbol period estimation and symbol synchronization method for rectangular pulse-shaped digital communication signals provided by the present invention, the calculation formulas for the number of rows of the first segmentation matrix and the number of rows of the second segmentation matrix are as follows:

[0034]

[0035] P2(M) = M - P1(M);

[0036] where round represents the rounding operation.

[0037] According to the method for estimating the symbol period and symbol synchronization of a rectangular pulse-shaped digital communication signal provided by the present invention, the formula corresponding to step 23 is specifically:

[0038]

[0039]

[0040] where is the first segmentation matrix, is the second segmentation matrix, is the first normalized segmentation matrix, is the second normalized segmentation matrix, is the two-norm of the first segmentation matrix, is the two-norm of the second segmentation matrix.

[0041] According to the method for estimating the symbol period and symbol synchronization of a rectangular pulse-shaped digital communication signal provided by the present invention, the formula corresponding to step 24 is specifically:

[0042]

[0043]

[0044] where represents the first recombination matrix, represents the second recombination matrix, FFT represents the fast Fourier transform, represents the i-th column of the first recombination matrix, represents the i-th column of the second recombination matrix, represents the i-th column of the first normalized segmentation matrix, represents the i-th column of the second normalized segmentation matrix; i = 1, 2…, r.

[0045] According to the method for estimating the symbol period and symbol synchronization of a rectangular pulse-shaped digital communication signal provided by the present invention, the formula corresponding to step 72 is specifically:

[0046]

[0047] where represents the third recombination matrix, represents the i-th column of the third recombination matrix, FFT represents the fast Fourier transform.

[0048] According to the method for estimating the symbol period and symbol synchronization of a rectangular pulse-shaped digital communication signal provided by the present invention, the specific formula corresponding to step 73 is as follows:

[0049]

[0050] where represents the maximum value of the i-th column of the third recombination matrix, represents the average value of the maximum values of each column of the third recombination matrix.

[0051] In a second aspect, the present invention provides an electronic device, including a memory, a processor, and a computer program stored on the memory and executable on the processor. When the processor executes the program, the steps of the method for estimating the symbol period and symbol synchronization of a rectangular pulse-shaped digital communication signal as described in any one of the above are implemented.

[0052] In a third aspect, the present invention further provides a non-transitory computer-readable storage medium, on which a computer program is stored. When the computer program is executed by a processor, the steps of the method for estimating the symbol period and symbol synchronization of a rectangular pulse-shaped digital communication signal as described in any one of the above are implemented.

[0053] The method for estimating the symbol period and symbol synchronization of a rectangular pulse-shaped digital communication signal provided by the present invention, without knowing the signal modulation system, does not add additional steps for identifying the modulation system, but directly provides a general method for estimating the symbol period for rectangular pulse-shaped digital communication signals of multiple different typical systems, and realizes symbol synchronization based on the estimated symbol period. Compared with the prior art, the entire estimation process is simplified, and the difficulty of hardware implementation is reduced. BRIEF DESCRIPTION OF THE DRAWINGS

[0054] In order to more clearly illustrate the technical solutions in the present invention or the prior art, the following will briefly introduce the drawings required for the description of the embodiments or the prior art. Obviously, the following drawings are some embodiments of the present invention. For those of ordinary skill in the art, other drawings can be obtained based on these drawings without creative efforts.

[0055] Figure 1 is a schematic flow chart of the method for estimating the symbol period of a rectangular pulse-shaped digital communication signal provided by the present invention;

[0056] Figure 2 is a schematic flow chart of the method for symbol synchronization of a rectangular pulse-shaped digital communication signal provided by the present invention;

[0057] Figure 3 is a schematic diagram of the dynamic matrix structure during symbol synchronization provided by the present invention;

[0058] Figure 4 It is a schematic diagram of dynamic matrix segmentation when symbol asynchronous provided by the present invention;

[0059] Figure 5 It is a schematic diagram of the structure of the electronic device provided by the present invention. Specific embodiments

[0060] To make the objectives, technical solutions and advantages of the present invention clearer, the technical solutions in the present invention will be clearly and completely described below with reference to the accompanying drawings in the present invention. Obviously, the described embodiments are some, but not all, of the embodiments of the present invention. All other embodiments obtained by those of ordinary skill in the art based on the embodiments in the present invention without creative efforts shall fall within the protection scope of the present invention.

[0061] It should be noted that in the description of the embodiments of the present invention, the terms "include", "comprise" or any other variant thereof are intended to cover a non-exclusive inclusion, such that a process, method, article or device including a series of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such process, method, article or device. Without further limitation, an element defined by the phrase "including a..." does not exclude the presence of additional identical elements in the process, method, article or device including the element.

[0062] The terms "first", "second", etc. in the present application are used to distinguish similar objects and are not used to describe a specific order or sequence. It should be understood that the data used in this way can be interchanged under appropriate circumstances so that the embodiments of the present application can be implemented in an order other than those illustrated or described herein, and the objects distinguished by "first", "second", etc. are generally of the same type and do not limit the number of objects. For example, the first object can be one or multiple. In addition, "and / or" means at least one of the connected objects, and the character " / " generally means an "or" relationship between the associated objects before and after.

[0063] The following combines Figures 1 - 5 to describe the symbol period estimation and symbol synchronization method for rectangular pulse-shaped digital communication signals provided by the embodiments of the present invention.

[0064] Figure 1 It is a schematic flow diagram of the symbol period estimation method for rectangular pulse-shaped digital communication signals provided by the present invention. The following combines Figure 1 to describe the symbol period estimation method provided by the present invention.

[0065] Step 1: Initialization. For the discrete data x[n] of the received signal, the value range [N min , Nmax , and simultaneously set the column value r of the subsequent dynamic matrix, and let M = N min , where M is the symbol period parameter. It should be noted that the signal discrete data is a rectangular pulse-shaped digital communication signal.

[0066] Step 2: Enter the following loop:

[0067] Step 21: From the signal discrete data x[n], take the first M·r data points x[1:rM] to form the following dynamic matrix with M rows and r columns:

[0068]

[0069] Step 22: According to the symbol period parameter, evenly divide the dynamic matrix into a first partition matrix and a second partition matrix by rows; the number of rows of the first partition matrix is P1(M), the number of rows of the second partition matrix is P2(M), and P2(M) = M - P1(M).

[0070] Specifically, calculate according to the value of M and P2(M) = M - P1(M).

[0071] Figure 3 is the schematic diagram of the dynamic matrix structure during symbol synchronization provided by the present invention, Figure 4 is the schematic diagram of the dynamic matrix partition during symbol asynchronous provided by the present invention, as Figure 3 and Figure 4 shown, divide the dynamic matrix D M into two parts: the first partition matrix and the second partition matrix where is composed of the first P1(M) rows of the dynamic matrix D M , is composed of the last P2(M) rows of the dynamic matrix D M .

[0072] Step 23: Perform normalization processing on the first partition matrix and the second partition matrix respectively to obtain the corresponding first normalized partition matrix and second normalized partition matrix. Specifically:

[0073]

[0074]

[0075] Among them, that is is the i-th column of, j = 1 or 2; is the first partition matrix, is the second partition matrix, is the first normalized partitioning matrix, is the second normalized partitioning matrix, is the bi-norm of the first partition matrix, is the bi-norm of the second partition matrix.

[0076] Step 24: Perform a P1(M) point fast Fourier transform on each column of the first normalized partitioning matrix, obtain the amplitude value after the fast Fourier transform (FFT) to form a first reorganized matrix, and perform a P2(M) point fast Fourier transform on each column of the second normalized partitioning matrix, obtain the amplitude value after the fast Fourier transform to form a second reorganized matrix.

[0077] Specifically, and Perform FFT of points P1(M) and P2(M) on each column of , and take the amplitude values after FFT to reconstruct the matrix:

[0078]

[0079]

[0080] in, represents the first reorganized matrix, represents the second reorganization matrix, FFT represents fast Fourier transform, represents the i-th column of the first reorganized matrix, represents the i-th column of the second reorganized matrix, represents the i-th column of the first normalized partitioning matrix, Represents the i-th column of the second normalized partitioning matrix; i = 1, 2…, r.

[0081] Step 25: Determine the average value of the maximum values of each column of the first reorganized matrix based on the maximum values of each column of the first reorganized matrix; determine the average value of the maximum values of each column of the second reorganized matrix based on the maximum values of each column of the second reorganized matrix; specifically:

[0082]

[0083]

[0084] in, represents the maximum value of each column of the first reorganized matrix or the second reorganized matrix, Represents the average of the maximum values of each column corresponding to the first reorganized matrix or the second reorganized matrix.

[0085] Furthermore, the larger value of the average values corresponding to the first reorganized matrix and the second reorganized matrix is taken as S[M]; specifically:

[0086]

[0087] Among them, represents the average value of the maximum values of each column corresponding to the first recombination matrix, represents the average value of the maximum values of each column corresponding to the second recombination matrix.

[0088] Step 26: Let M = M + 1. If M > N max , go to Step 3; otherwise, return to Step 21 (Step 2);

[0089] Step 3: In the range of M ∈ [N min +1, N max , calculate the absolute value of the differential signal of S[M], and find its corresponding maximum point to obtain an initial estimate of the symbol period Specifically:

[0090]

[0091] Among them, is the absolute value of the differential signal of S[M], and

[0092] Step 4: For the initial estimate Let Set the number of loop times K, and let: k = 2, 0 < β < 1;

[0093] Step 5: Enter the following loop;

[0094] Step 51: If or , go to Step 52; otherwise, go to Step 53;

[0095] Step 52: If then and go to Step 53; otherwise and go to Step 53;

[0096] Step 53: Let k = k + 1. If k ≤ K, return to Step 51 (Step 5); otherwise, exit the loop and output the symbol period estimate value That is, for the received signal discrete data x[n], each symbol has N T data points.

[0097] Furthermore, the present invention can achieve symbol synchronization based on the output symbol period estimate value.

[0098] Figure 2 is a schematic flow chart of the symbol synchronization method for a rectangular pulse shaping digital communication signal provided by the present invention. As an optional embodiment, the following is referred to Figure 2Describe the symbol synchronization method.

[0099] Step 6: For the estimated symbol period N T , let q = 1.

[0100] Step 7: Enter the following loop:

[0101] Step 71: Construct the following shifted shift matrix:

[0102]

[0103] where represents the shift matrix, represents the i-th column of the shift matrix; i = 1, 2…, r.

[0104] Step 72: Perform an N T -point fast Fourier transform (FFT) on each column in the shifted matrix, and take the magnitude values after the fast Fourier transform to form a third recombined matrix; specifically:

[0105]

[0106] where represents the third recombined matrix, represents the i-th column of the third recombined matrix, and FFT represents the fast Fourier transform.

[0107] Step 73: Take the maximum value of each column of to obtain:

[0108]

[0109] Then calculate the average value of the maximum values of each column:

[0110]

[0111] where represents the maximum value of the i-th column of the third recombined matrix, represents the average value of the maximum values of each column of the third recombined matrix.

[0112] Step 74: Let q = q + 1. If q > N T , execute Step 8; otherwise, return to execute Step 7 (Step 71);

[0113] Step 8: In the range of q ∈ [1, N T , find the maximum point corresponding to to achieve symbol synchronization of the signal; specifically:

[0114]

[0115] That is, among the discrete data x[n] of the received signal, the first N τ -1 points belong to a previous incomplete symbol period. Starting from the N τ -th data point, every N T points form a symbol.

[0116] Based on the content of the above embodiments, the beneficial effects of the symbol period estimation and symbol synchronization method for rectangular pulse-shaped digital communication signals proposed by the present invention will be described one by one below.

[0117] (1) Constructing a dynamic matrix to distinguish different symbol data: In step 21, assuming that the discrete data x[n] of the received signal is symbol-synchronized, then when M = N T and a dynamic matrix D is constructed for x[n] M , the obtained dynamic matrix D M each column of which belongs to the same symbol. As shown in Figure 3 , it means that there are neither phase jump points, nor frequency jump points or envelope amplitude jump points in the data of each column. The FFT spectra of each column will have the best convergence characteristics, based on which different situations of M = N T and M ≠ N T can be distinguished; the symbol period estimation is realized by processing this dynamic matrix.

[0118] (2) Matrix segmentation to eliminate the influence of symbol non-synchronization: Since the discrete data x[n] of the received signal is basically impossible to be symbol-synchronized, that is, among the first N T data points of x[n], it is very likely to contain data of two incomplete symbol periods. At this time, even if the value of M = N T is taken, in the dynamic matrix constructed in step 21, each column of it is composed of data of 2 incomplete symbol periods, with phase jump points, frequency jump points or envelope amplitude jump points, which affects the estimation of the symbol period. Therefore, in step 22, the dynamic matrix is evenly divided into two parts by rows. At this time, among the two segmented matrices, at least one of them has data of each column coming from the same symbol. As shown in Figure 4 , that is, it does not affect the spectral convergence characteristics of performing FFT by column. Therefore, this matrix segmentation operation effectively eliminates the influence of symbol non-synchronization.

[0119] (3) Matrix normalization to eliminate the influence of non-constant modulus signal systems: For digital communication signals of typical systems, there are two types: constant modulus (such as mPSK and mFSK) and non-constant modulus (such as mQAM and mASK). For signals of non-constant modulus systems, even if M = N TAnd the symbol has achieved synchronization. There will be significant differences in the peak values of the FFT spectra of each column in the matrix it constructs, resulting in the mean value of the spectral peaks of each column showing a random variation trend with the value of M, and it is impossible to highlight the maximum value at M = N T At this point, in step 23, normalization is achieved by dividing the two matrices obtained by segmentation by their second norms, eliminating the random variation of the mean value of the spectral peaks of each column with the value of M, so that this method has the same effect on both the constant modulus modulation system and the non-constant modulus modulation system.

[0120] (4) After performing column-wise FFT on the matrix, take the maximum value of the modulus of each column and calculate the average: In steps 24 - 25, when the data of each column in the constructed matrix comes from the same symbol, since each symbol of the communication information is a single-frequency signal, there will be a peak with excellent convergence in the FFT spectrum of each column. Taking the average of the peaks of each column is still an obvious large value, which indicates that the value of M selected at this time corresponds to the symbol period; for other values of M except this, it cannot be guaranteed that the FFT of each column of the constructed matrix obtains the spectrum with the best convergence.

[0121] (5) Eliminate the estimation ambiguity for the differential waveform: In step 5, the differential absolute value waveform of S[M] is obtained. Although there will be a maximum value point at M = N T However, when M = LN T which is an integer multiple of the actual symbol period, there will also be a very obvious peak. Therefore, in the loop of step 5, by comparing the values at fractional multiples of the initial estimate of the symbol period obtained in step 3, the problem of final symbol period estimation ambiguity is avoided;

[0122] (6) Achieve symbol synchronization through shift matrix estimation: In the case of non-symbol synchronization, in the discrete data x[n] of the received signal, if the first N τ - 1 (1 ≤ N τ ≤ N T ) data points belong to an incomplete symbol period, then even if the dynamic matrix D T is constructed according to M = N M , each column of it is composed of partial data of two symbols. And in step 7, by constructing a shift matrix When q = N τ , each column of the matrix belongs to the same symbol period, and the spectrum obtained by performing FFT on each column has the best convergence characteristics, which helps to determine the value of N τ - 1, that is, achieve symbol synchronization.

[0123] In summary, the method for estimating the symbol period and symbol synchronization of a rectangular pulse-shaped digital communication signal provided by the present invention provides a general method for estimating the symbol period for rectangular pulse-shaped digital communication signals of multiple different typical systems without additional steps for identifying the modulation system when the signal modulation system is unknown, and realizes symbol synchronization based on the estimated symbol period. Compared with the prior art, the entire estimation process is simplified and the difficulty of hardware implementation is reduced.

[0124] Figure 5 FIG. is a schematic structural diagram of an electronic device provided by the present invention. As Figure 5 shown, the electronic device may include: a processor 510, a communication interface 520, a memory 530, and a communication bus 540. Among them, the processor 510, the communication interface 520, and the memory 530 complete communication with each other through the communication bus 540. The processor 510 can call the logical instructions in the memory 530 to execute the method for estimating the symbol period and symbol synchronization of the rectangular pulse-shaped digital communication signal.

[0125] In addition, when the logical instructions in the above-mentioned memory 530 are implemented in the form of software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on such an understanding, the technical solution of the present invention, in essence, or the part that contributes to the prior art, or a part of this technical solution, can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods described in various embodiments of the present invention. The foregoing storage medium includes: various media such as a USB flash drive, a mobile hard disk, a read-only memory (ROM, Read-Only Memory), a random access memory (RAM, Random Access Memory), a magnetic disk, or an optical disc that can store program codes.

[0126] On the other hand, the present invention also provides a computer program product. The computer program product includes a computer program stored on a non-transitory computer-readable storage medium. The computer program includes program instructions. When the program instructions are executed by a computer, the computer can execute the method for estimating the symbol period and symbol synchronization of the rectangular pulse-shaped digital communication signal provided in the above-mentioned various embodiments.

[0127] In another aspect, the present invention further provides a non-transitory computer-readable storage medium, on which a computer program is stored. When the computer program is executed by a processor, it is configured to execute the rectangular pulse shaping digital communication signal symbol period estimation and symbol synchronization methods provided in the above embodiments.

[0128] Through the description of the above embodiments, those skilled in the art can clearly understand that each embodiment can be implemented by means of software plus a necessary general hardware platform, and of course, it can also be implemented by hardware. Based on such an understanding, the essence of the above technical solution, or the part that contributes to the prior art, can be embodied in the form of a software product. The computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, magnetic disk, optical disk, etc., and includes several instructions for causing a computer device (which can be a personal computer, a server, or a network device, etc.) to execute the methods described in each embodiment or some parts of the embodiments.

[0129] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit them; although the present invention has been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art should understand that they can still modify the technical solutions described in the foregoing embodiments, or perform equivalent replacements for some of the technical features; and these modifications or replacements do not make the essence of the corresponding technical solutions deviate from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims

1. A method for estimating the symbol period and symbol synchronization of a rectangular pulse-shaped digital communication signal, characterized in that, Including: Step 1: Set the value range of symbol period estimation as [N min , N max , the column value of the dynamic matrix is r, and the symbol period parameter is M; And, M = N min ; Step 2: Enter a loop to execute Steps 21 to 26: Step 21: Take the first M·r data from the signal discrete data x[n] to construct a dynamic matrix D with M rows and r columns M : Step 22: According to the symbol period parameter, evenly divide the dynamic matrix into a first partition matrix and a second partition matrix by rows; the number of rows of the first partition matrix is P1(M), the number of rows of the second partition matrix is P2(M), and P2(M) = M - P1(M); Step 23: Perform normalization processing on the first partition matrix and the second partition matrix respectively to obtain the corresponding first normalized partition matrix and second normalized partition matrix; Step 24: Perform P1(M)-point fast Fourier transform on each column of the first normalized partition matrix, obtain the amplitude values after the fast Fourier transform to form a first recombination matrix, perform P2(M)-point fast Fourier transform on each column of the second normalized partition matrix, obtain the amplitude values after the fast Fourier transform to form a second recombination matrix; Step 25: Determine the average value of the maximum values of each column corresponding to the first recombination matrix according to the maximum values of each column of the first recombination matrix; Determine the average value of the maximum values of each column corresponding to the second recombination matrix according to the maximum values of each column of the second recombination matrix; take the larger value of the average values corresponding to the first recombination matrix and the second recombination matrix as S[M]; Step 26: Let M = M + 1. If M > N max , continue to execute Step 3; Otherwise, return to execute Step 2; Step 3: In the range of M ∈ [N min + 1, N max , calculate the absolute value of the differential signal of S[M], and find its corresponding maximum point to obtain an initial estimate of the symbol period Specifically: Among them, is the absolute value of the differential signal of S[M]; Step 4: Set k = 2, 0 < β < 1, and the number of loops K; Step 5: Enter a loop to execute Steps 51 to 53: Step 51: If or Continue to execute Step 52; otherwise, execute Step 53; Step 52: If Then Otherwise, let Wherein Denotes taking the floor of Rounding down, Denotes taking the ceiling of Rounding up; Step 53: Let k = k + 1. If k ≤ K, then return to execute Step 5; otherwise, exit the loop and output the symbol period estimation value N T , to achieve symbol synchronization based on the symbol period estimation value; where 2. The rectangular pulse shaping digital communication signal symbol period estimation and symbol synchronization method according to claim 1, characterized in that, Realize symbol synchronization based on the output symbol period estimation value, specifically including: Step 6: Set the parameter q and set q = 1; Step 7: Enter a loop to execute Steps 71 to 74: Step 71: Construct a shifted matrix: Among them, represents a shift matrix, represents the i-th column of the shift matrix; i = 1, 2, …, r; Step 72: Perform fast Fourier transform on each column of the shift matrix for N T points, and take the amplitude values after the fast Fourier transform to form a third recombination matrix; Step 73: Determine the average value of the maximum values of each column according to the maximum values of each column of the third recombination matrix Step 74: Let q = q + 1. If q > N T , execute Step 8; otherwise, return to execute Step 7; Step 8: Within the range of q ∈ [1, N T , find the corresponding maximum point to achieve symbol synchronization of the signal.

3. The rectangular pulse shaping digital communication signal symbol period estimation and symbol synchronization method according to claim 1, characterized in that The calculation formulas for the number of rows of the first partition matrix and the number of rows of the second partition matrix are as follows: P2(M) = M - P1(M); Where, round represents the rounding operation.

4. The method for estimating the symbol period and symbol synchronization of a rectangular pulse-shaped digital communication signal according to claim 1, characterized in that The formula corresponding to Step 23 is specifically: Among them, is the first segmentation matrix, is the second segmentation matrix, is the first normalized segmentation matrix, is the second normalized segmentation matrix, is the two-norm of the first segmentation matrix, is the two-norm of the second segmentation matrix.

5. The rectangular pulse shaping digital communication signal symbol period estimation and symbol synchronization method according to claim 1, characterized in that The formula corresponding to Step 24 is specifically: Among them, represents the first recombination matrix, represents the second recombination matrix, and FFT represents the fast Fourier transform. represents the i-th column of the first recombination matrix, represents the i-th column of the second recombination matrix, represents the i-th column of the first normalized segmentation matrix, represents the i-th column of the second normalized segmentation matrix; i = 1, 2,..., r.

6. The method for estimating the symbol period and symbol synchronization of a rectangular pulse-shaped digital communication signal according to claim 2, wherein The formula corresponding to Step 72 is specifically: Among them, represents the third recombination matrix, represents the i-th column of the third recombination matrix, and FFT represents the fast Fourier transform.

7. The method for estimating the symbol period and symbol synchronization of a rectangular pulse-shaped digital communication signal according to claim 2, wherein The specific formula corresponding to Step 73 is: Among them, represents the maximum value of the i-th column of the third recombined matrix, represents the average value of the maximum values of each column of the third recombined matrix.

8. An electronic device, comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, characterized in that, When the processor executes the computer program, it implements the steps of the method for symbol period estimation and symbol synchronization of a rectangular pulse-shaped digital communication signal as described in any one of Claims 1 to 7.

9. A non-transitory computer-readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by the processor, it implements the steps of the method for symbol period estimation and symbol synchronization of a rectangular pulse-shaped digital communication signal as described in any one of Claims 1 to 7.

Images