Low-complexity synchronous processing method for physical layer of communication system and storage medium

By dividing the receiving sequence into multiple window units and performing Fourier transform and complex multiplication operations, the problem of high complexity of time synchronization processing in the broadband ad hoc network communication system is solved, and the synchronization processing with low complexity is realized. Reduced hardware resource usage.

CN119094302APending Publication Date: 2024-12-06BEIJING HUANJIA TELECOMM CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202411215431.X
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-08-30
Publication Date
2024-12-06

AI Technical Summary

Technical Problem

In the prior art, the time synchronization processing method of broadband ad hoc network communication system has a high complexity, resulting in excessive hardware resource utilization and making it difficult to achieve low-complex synchronization processing.

Method used

Divide the receiving sequence into several receiving window units, and perform Fourier transform and complex multiplication operations on each window unit, merge the results to reduce the complexity of sliding-related calculations, and use window length segmentation processing and concurrent calculations to reduce hardware resources. need.

Benefits of technology

Through segmented processing and concurrent calculation, the computing complexity is significantly reduced, the hardware resource overhead is reduced, and the efficiency of synchronous processing is improved.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119094302A_ABST
    Figure CN119094302A_ABST
Patent Text Reader

Abstract

The invention discloses a low-complexity synchronous processing method of a communication system physical layer and a storage medium, and belongs to the technical field of communication signal processing. The method comprises the following steps: splitting a received receiving sequence into a current receiving unit and a plurality of units to be received, respectively calculating sub-operation result sets, merging the sub-operation result sets, and solving a modular square to obtain a correlation value sequence of the receiving sequence; according to the invention, the problems that the time slot length is relatively long, the operation complexity is relatively high and more hardware resources are occupied when the current sliding correlation operation is carried out are solved, and the overhead of the hardware resources caused by the high operation complexity is greatly reduced.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the technical field of communication signal processing, and in particular to a low-complexity synchronization processing method and storage medium for a physical layer of a communication system. Background Art

[0002] In the receiving end processing of the broadband ad hoc communication system, the arrival start time of the signal must be estimated first to obtain the accurate position of the useful signal, complete the extraction and demodulation and decoding of the useful signal, and realize the reliable transmission of information. MF-based time synchronization is a synchronization algorithm often used in the communication physical layer. Its principle block diagram is shown in the figure. Figure 2 As shown;

[0003] Among them, r u is the receiving sequence, x u is a pre-stored sequence of length N, and the cross-correlation function P(τ) between the two is calculated. When τ = τ max It reaches its maximum value when , so finding the maximum value of P(τ) also finds the optimal timing moment, and the related value is:

[0004]

[0005] The MF method uses a local pre-stored sequence and a received sequence for sliding correlation operations. In OFDM-based broadband communication systems, each time slot includes several OFDM time domain symbols. In order to ensure the broadband communication rate, the number of time domain symbols cannot be too small, and the time slot length is therefore longer. Direct correlation calculation complexity will occupy more hardware resources.

[0006] Therefore, there is an urgent need for a low-complexity synchronization processing method to perform sliding budgeting on the received sequence and the local sequence to reduce hardware resource usage. Summary of the invention

[0007] The present invention provides a low-complexity synchronization processing method and storage medium for the physical layer of a communication system, in order to solve the problem that the calculation method in the prior art is highly complex and occupies a large amount of hardware resources.

[0008] In order to solve the above technical problems, the present invention adopts the following technical solutions:

[0009] A low-complexity synchronization processing method for a physical layer of a communication system, comprising the following steps:

[0010] S100, the received receiving sequence r is divided into a number of receiving window units according to the window length win_len, and the first receiving window unit is used as the current receiving window unit, and the remaining receiving window units are used as the waiting receiving window units in sequence; the window length win_len = Nfft-L, where Nfft = rL, and Nfft is 2 N, N is a non-zero positive integer, which is set according to the needs of the operation, and L is the local sequence length;

[0011] S200, performing Fourier transform on the current receiving window unit, all window units to be received, and the local sequence respectively to obtain corresponding frequency domain sequences;

[0012] S300, performing complex multiplication operations on the frequency domain sequences of the current receiving window unit and all the window units to be received and the frequency domain sequence of the local sequence x1, respectively, to obtain corresponding sub-calculation result sets, and converting them into time domain sequences;

[0013] S400, merging the sub-calculation result sets of the current receiving window unit and all the window units to be received after being converted into a time domain sequence to obtain a sliding correlation calculation result Y;

[0014] S500 , performing a modulo operation on a sliding correlation calculation result set Y to obtain a correlation value sequence of a received sequence r.

[0015] On this basis, the present invention can also be improved as follows: in the step S200, before Fourier transform is performed on the current receiving window unit, all window units to be received and the local sequence respectively, 0 is also added to the current receiving window unit, all window units to be received and the local sequence respectively.

[0016] On this basis, the present invention can also be improved as follows: in the step S300, when performing complex multiplication operations, they are performed sequentially or concurrently.

[0017] On this basis, the present invention can also be improved as follows: in step S300, the sub-calculation result set includes several non-full correlation values, and the non-full correlation values ​​are the 1st to L-1th calculation results at the front and back ends of the sub-calculation result set.

[0018] On this basis, the present invention can also be improved as follows: In step S400, the method for performing the merging operation includes:

[0019] S410, removing the non-full correlation value at the front end of the sub-operation result set corresponding to the current receiving window unit and the non-full correlation value at the back end of the sub-operation result set corresponding to the last window unit to be received,

[0020] S420, superimposing the sub-operation result sets corresponding to the removed current receiving window unit and the window unit to be received in order,

[0021] S430, adding the non-full correlation value of the front end of the sub-operation result set except that corresponding to any receiving window unit to the non-full correlation value of the back end of the sub-operation result set corresponding to the previous receiving window unit to obtain the sliding correlation calculation result Y.

[0022] The present invention also provides a 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 described above are implemented.

[0023] The beneficial effects provided by the present invention are:

[0024] The receiving sequence is divided into a current receiving window unit and a number of window units to be received, and the operation results are calculated respectively and then merged, which greatly reduces the hardware resource overhead caused by the high operation complexity.

[0025] Advantages of additional aspects of the present invention will be given in part in the following description, and in part will become obvious from the following description, or will be learned through practice of the present invention. BRIEF DESCRIPTION OF THE DRAWINGS

[0026] Figure 1 A schematic diagram of a method flow chart provided by an embodiment of the present invention;

[0027] Figure 2 It is a schematic diagram of the MF time synchronization principle in the prior art;

[0028] Figure 3 It is a flow chart of data time slot interaction between the transmitting and receiving ends in the comparative example of the present invention. DETAILED DESCRIPTION

[0029] The following is a clear and complete description of the technical solutions in the embodiments of the present invention in conjunction with the accompanying drawings 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 belong to the protection scope of the present invention.

[0030] like Figure 1 As shown, the present invention provides a low-complexity synchronization processing method for the physical layer of a communication system, comprising the following steps:

[0031] S100, the received receiving sequence of length r is divided into a number of receiving window units according to the window length win_len, and the first receiving window unit is used as the current receiving window unit, and the remaining receiving window units are used as the waiting receiving window units in sequence, and the window length win_len = Nfft-L, where Nfft is 2 N , N is a non-zero positive integer, which is set according to the needs of the operation. When fast calculation results are required, a smaller N can be set to divide the received sequence into fewer receiving window units to improve the calculation speed; when the hardware is poor, a larger N can be set to divide the received sequence into more receiving window units to further reduce the calculation complexity. The L is the length of the local sequence x1;

[0032] Wherein, the number of receiving window units win_num=floor(r / win_len), where floor represents a rounding operation;

[0033] S200, performing Fourier transform on the current receiving window unit, all window units to be received, and the local sequence respectively to obtain corresponding frequency domain sequences;

[0034] S300, perform complex multiplication operations on the frequency domain sequences of the current receiving window unit and all the window units to be received and the frequency domain sequence of the local sequence x1, respectively, to obtain corresponding sub-calculation result sets, and convert them into time domain sequences, namely:

[0035] ifft_corr_now=ifft(fft(rx_win_now).*fft(conj(x1)));

[0036] ifft_corr_now=ifft(fft(rx_win_next).*fft(conj(x1)));

[0037] Among them, ifft_corr_now is the time domain sequence after the complex multiplication operation of the current receiving window, ifft_corr_next is the time domain sequence after the complex multiplication operation of the next receiving window, fft_win_now1 is the frequency domain sequence of the current receiving window, fft_win_next1 is the frequency domain sequence of the next receiving window, and conj represents complex multiplication;

[0038] S400, merging the sub-calculation result sets of the current receiving window unit and all the window units to be received after being converted into a time domain sequence to obtain a sliding correlation calculation result Y;

[0039] S600 , performing a modulo operation on a sliding correlation calculation result set Y to obtain a correlation value sequence of a received sequence.

[0040] The solution provided by the present invention has the following effects:

[0041] In order to solve the problem of high complexity of time domain sliding correlation operation, the present invention proposes a method and device for converting a received sequence into a frequency domain segment by time domain segmentation and then converting it into the time domain, divides the received sequence into a current receiving window unit and a plurality of window units to be received, calculates the operation results respectively, and then merges the operation results, which greatly reduces the hardware resource overhead caused by the high operation complexity.

[0042] Optionally, in some possible implementations, in the step S200, before Fourier transforming the current receiving window unit, all window units to be received and the local sequence, the step also includes padding the current receiving window unit, all window units to be received and the local sequence with 0s, so that the lengths of the receiving window unit, all window units to be received and the local sequence are consistent with the length of Nfft, so that the spectrum points are denser.

[0043] Optionally, in some possible implementations, in the step S300, when performing the complex multiplication operation, the current receiving window unit and the window unit to be received may be operated in sequence, or the current receiving window unit and the window unit to be received may be operated simultaneously. When the hardware resource configuration is low, in order to meet the configuration requirements, a sequential calculation method may be selected for calculation. When the hardware resources are sufficient, in order to save calculation time, the current receiving window unit and the window unit to be received may be operated simultaneously.

[0044] Optionally, in some possible implementations, in step S300, the sub-calculation result set includes a number of non-full correlation values, which are the calculation results of missing data when performing complex multiplication operations, and are located at the front end and the back end of the sub-calculation result set, including the 1st to L-1th calculation results at the front and back ends of the sub-calculation result set, and the front end of the sub-calculation result set is the end where the result is output first during calculation, for example Figure 3 The back end of the sub-operation result set is the end where the result is output later during calculation, for example Figure 3 One end of y7_2 in.

[0045] Optionally, in some possible implementations, in step S400, the method for performing the merging operation includes:

[0046] S410, removing the non-full correlation value at the front end of the sub-operation result set corresponding to the current receiving window unit and the non-full correlation value at the back end of the sub-operation result set corresponding to the last window unit to be received,

[0047] S420, superimposing the sub-operation result sets corresponding to the removed current receiving window unit and the window unit to be received in order,

[0048] S430, adding the non-full correlation value of the front end of the sub-operation result set except that corresponding to any receiving window unit to the non-full correlation value of the back end of the sub-operation result set corresponding to the previous receiving window unit to obtain the sliding correlation calculation result Y.

[0049] The present invention also provides a 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 described above are implemented.

[0050] To further explain the present invention, a specific embodiment of a low-complexity synchronization processing method for a physical layer of a communication system according to the present invention is exemplarily given:

[0051] Figure 3 FIG. 4 shows a flow chart of the data time slot interaction between the transmitting and receiving ends in this embodiment. Figure 3 As shown, the length of the received sequence r is 12, and the length of the local sequence x is 3;

[0052] The first step is to divide the receiving sequence r into several receiving window units according to the window length win_len. At this time, the length of each receiving window unit win_num=floo(r / win_len), the first segment is the current receiving window unit rx_win_now1, whose value is r1~r6, and the second segment is the waiting receiving window unit rx_win_next1, whose value is r7~r12;

[0053] The second step is to fill the current receiving window unit rx_win_now1, the window unit to be received rx_win_next1, and the local sequence x with 0 respectively, and then perform Fourier transform on the current receiving window unit rx_win_now1 and the window unit to be received rx_win_next1 after filling with zero, and obtain the corresponding frequency domain sequences fft(rx_win_now1) and fft(rx_win_next1), and then conjugate the two receiving window units with the local sequence x1 after filling with zero to obtain the corresponding complex multiplication results Y1 and Y2, and then convert the obtained complex multiplication results into the time domain, that is;

[0054] ifft_corr_now=ifft(fft(rx_win_now1).*fft(conj(x1)));

[0055] ifft_corr_next=ifft(fft(rx_win_next1).*fft(conj(x1)));

[0056] The third step is to merge the complex multiplication results converted to the time domain, and add the two non-full correlation values ​​y7_2 and y8_2 at the front end of the sub-operation result set corresponding to the window unit to be received and y7_1 and y8_1 at the back end of the sub-operation result set corresponding to the current receiving unit, and then remove the non-full correlation values ​​y1 and y2 at the front end and the non-full correlation values ​​y13 and y14 at the back end in the merged operation result set to obtain the sliding correlation calculation result Y;

[0057] The fourth step is to perform a modulo square operation on the sliding correlation calculation result Y to obtain the correlation value sequence of the received sequence r, and complete the output

[0058] Optionally, in some possible implementations, all or part of the above implementations may be included.

[0059] It should be understood that in the description of this specification, reference to the terms "one embodiment", "some embodiments", "example", "specific example" or "some examples" means that the specific features, structures, materials or characteristics described in conjunction with the embodiment or example are included in at least one embodiment or example of the present invention. In this description, the schematic representations of the above terms do not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials or characteristics described may be combined in any one or more embodiments or examples in a suitable manner. In addition, those skilled in the art may combine and combine different embodiments or examples described in this specification and some features of different embodiments or examples without contradiction.

[0060] Of course, without departing from the spirit and essence of the present invention, those skilled in the art may make various corresponding changes and modifications based on the present invention, but these changes and modifications should all fall within the scope of protection of the claims of the present invention.

Claims

1. A low-complexity synchronization processing method for a physical layer of a communication system, characterized in that: The following steps are involved: S100, the received receiving sequence r is divided into a number of receiving window units according to the window length win_len, and the first receiving window unit is used as the current receiving window unit, and the remaining receiving window units are used as the waiting receiving window units in sequence; the window length win_len = Nfft-L, where Nfft is 2 N , N is a non-zero positive integer, which is set according to the requirements of the operation, and L is the length of the local sequence x1; S200, performing Fourier transform on the current receiving window unit, all window units to be received, and the local sequence respectively to obtain corresponding frequency domain sequences; S300, performing complex multiplication operations on the frequency domain sequences of the current receiving window unit and all the window units to be received and the frequency domain sequence of the local sequence x1, respectively, to obtain corresponding sub-calculation result sets, and converting them into time domain sequences; S400, merging the sub-calculation result sets of the current receiving window unit and all the window units to be received after being converted into a time domain sequence to obtain a sliding correlation calculation result Y; S500 , performing a modulo operation on a sliding correlation calculation result set Y to obtain a correlation value sequence of a received sequence r.

2. The low-complexity synchronization processing method according to claim 1, characterized in that: In the step S200, before Fourier transform is performed on the current receiving window unit, all the window units to be received and the local sequence respectively, 0 is also added to the current receiving window unit, all the window units to be received and the local sequence respectively.

3. The low-complexity synchronization processing method according to claim 1, characterized in that: In step S300, when performing complex multiplication operations, they are performed sequentially or concurrently.

4. The low-complexity synchronization processing method according to claim 1, characterized in that: In the step S300, the sub-calculation result set includes a number of non-full correlation values, and the non-full correlation values ​​are the 1st to L-1th calculation results at the front and back ends of the sub-calculation result set.

5. The low-complexity synchronization processing method according to claim 4, characterized in that: In step S400, the method for performing the merging operation includes: S410, removing the non-full correlation value at the front end of the sub-operation result set corresponding to the current receiving window unit and the non-full correlation value at the back end of the sub-operation result set corresponding to the last window unit to be received, S420, superimposing the sub-operation result sets corresponding to the removed current receiving window unit and the window unit to be received in order, S430, adding the front-end non-full correlation value of the sub-operation result set corresponding to any receiving window unit to the back-end non-full correlation value of the sub-operation result set corresponding to the previous receiving window unit to obtain the sliding correlation calculation result Y.

6. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the method according to claims 1 to 5 are implemented.