A fast SF identification method for gateway

Through the fast Fourier transform and AGC gain compensation methods, the problems of slow SF recognition speed and complex threshold adjustment are solved, and fast SF recognition and automatic AGC support are realized, which improves the recognition efficiency and reduces complexity.

CN118801919BActive Publication Date: 2024-12-06四川思凌科微电子有限公司 +1
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202411288496.7
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-09-14
Publication Date
2024-12-06
Estimated Expiration
2044-09-14

AI Technical Summary

Technical Problem

In the prior art, the SF recognition speed is too slow and the threshold adjustment complexity is high, so it cannot be used in automatic AGC mode.

Method used

By grouping the received signals according to different SF configurations, calculating the intermediate variable values, and obtaining the SF recognition results through comparison, using fast Fourier transform and absolute value symbol correlation judgment, combined with AGC gain compensation, fast SF recognition is achieved.

Benefits of technology

It realizes the fast SF recognition function, reduces the complexity of threshold adjustment during recognition, and supports automatic AGC mode.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118801919B_ABST
    Figure CN118801919B_ABST
Patent Text Reader

Abstract

The invention discloses a fast SF identification method for a gateway, belongs to the technical field of wireless communication, and comprises the following steps: step one: firstly, receiving signals are grouped according to #imgabs0#, spreading factors are divided from 6 to 12, and then an intermediate variable value in the first search is calculated; step two: the intermediate variable value when the spreading factor is equal to 6 and the intermediate variable value when the spreading factor is equal to 12 are calculated; step three: the intermediate variable value in the first search is compared with the intermediate variable value when the spreading factor is equal to 6 and the intermediate variable value when the spreading factor is equal to 12, and the result is output; step four: the spreading factor is set to be equal to the second search, the intermediate variable value in the second search is compared with the intermediate variable value when the spreading factor is equal to 6 and the intermediate variable value when the spreading factor is equal to 12, and the result is output, and the process ends; the technical problems of too slow spreading factor identification and too high threshold adjustment complexity in spreading factor identification in the prior art are solved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The invention belongs to the technical field of wireless communications, and in particular relates to a fast SF identification method for a gateway. Background Art

[0002] In wireless communications, chirp waveforms are a spread spectrum technology that can achieve high sensitivity because the occupied bandwidth is much larger than the signal. In addition, the signal is widely used in various radar and communication scenarios because of its strong anti-multipath capability, low transmission energy and long transmission distance.

[0003] When chirp signals are used for communication, the larger the spreading factor (SF) and the smaller the bandwidth (BW), the higher the sensitivity can be, but the longer the time to transmit the same data. For example, when SF=6 and BW=500KHz, the time length of a symbol is 0.12ms (milliseconds), but when SF=12, under the same bandwidth conditions, the transmission time of a symbol is 8.2ms (milliseconds). And when SF is larger, the transmission data rate is lower, and when SF is smaller, the transmission data rate is higher.

[0004] During uplink communication, the terminal node will automatically select the most appropriate SF according to the RSSI, SNR and other information of the communication link, so as to not reduce the communication rate and improve the communication quality. However, this requires the gateway device to have an automatic SF identification function to automatically identify the SF parameters configured by the terminal.

[0005] In the prior art, multiple signals are transmitted in parallel for SF detection. The SF value can be effectively detected by averaging multiple symbols with sliding windows and using multiple thresholds. However, this method requires a multi-channel parallel architecture and consumes multiple sets of data processing units. In addition, multiple symbols are required for sliding window averaging, which requires more preamble code overhead.

[0006] The inventors have found in actual use that these prior arts have at least the following technical problems: SF recognition is too slow, the threshold adjustment complexity during SF recognition is too high, and they cannot be used in automatic AGC mode. Summary of the invention

[0007] In view of the problems in the prior art that the SF recognition speed is too slow and the SF recognition threshold adjustment complexity is too high, the present invention proposes a fast SF recognition method for a gateway, the purpose of which is to improve the SF recognition speed.

[0008] To achieve the above purpose, the technical solution adopted by the present invention is to provide a fast SF identification method for a gateway, comprising the following steps:

[0009] Step 1: First, receive the signal according to Group the SF configurations from SF=6 to SF=12, set SF=L1, and then calculate the intermediate variable value of L1; Step 2: calculate the intermediate variable value of SF=6 and the intermediate variable value of SF=12; Step 3: compare the intermediate variable value of L1 with the intermediate variable value of SF=6 and the intermediate variable value of SF=12 and output the result: Step 4: set SF=L2 again, then calculate the intermediate variable value of L2, compare the intermediate variable value of L2 with the intermediate variable value of SF=6 and the intermediate variable value of SF=12 and output the result, and the process ends; L1 represents the first search, L2 represents the second search, and LN represents the Nth search.

[0010] Preferably, the calculation process of the intermediate variable value of L1 is as follows: First, the received signal is calculated according to each The chips are grouped and then calculated:

[0011]

[0012] in represents a symbol after grouping every SF=L1 chips, represents the transmitted local signal conjugate of SF=L1, and Represents the absolute value symbol, It stands for Fast Fourier Transform.

[0013] When getting After the result, find its maximum value, recorded as , Represents the correlation between the received data and the transmitted signal. The correlation varies under different SF transmission conditions. The correlation is used to determine the SF mode of transmission.

[0014] Preferably, the calculation process of the intermediate variable value of SF=6 in step 2 is as follows:

[0015] in Represents a symbol after grouping according to SF=6 chips. represents the transmitted local signal conjugate with SF=6, and Represents the absolute value symbol; when obtaining After the result, find its maximum value, recorded as

[0016] , X6 represents the correlation result obtained by grouping with 2 to the power of 6 (64) code chips.

[0017] Preferably, the calculation process of the intermediate variable value of SF=12 in step 2 is as follows:

[0018] in Represents a symbol after grouping according to each SF=12 chips, represents the transmitted local signal conjugation with SF=12, and Represents the absolute value symbol; when obtaining After the result, find its maximum value, recorded as

[0019] .

[0020] Preferably, the comparison process of step three is as follows:

[0021] Result 1: If ≤ , then the value range of SF recognition result R is L1≤R≤12, and is a coefficient factor that compensates for the noise Value error, That is, the calculation result;

[0022] Result 2: If , then the SF recognition result is SF=6, and the search is exited;

[0023] Result 3: If > , then the SF recognition result is L1, and the search is exited.

[0024] Preferably, when result 1 is satisfied, let SF = L2, and calculate the intermediate variable value of L2, recorded as .

[0025] Better, yes , as well as For comparison, the process is as follows:

[0026] Result 1: ≤ , then the value range of SF recognition result R is L2≤R≤12;

[0027] Result 2: , then SF recognizes the result L1 and jumps out of the search;

[0028] Result 3: , then the SF recognition result is L2, and the search is exited;

[0029] in It is the coefficient factor.

[0030] Preferably, the comparison process is repeated until SF in LN (1≤N≤5, N represents the result of the Nth search) is equal to 11, then the final judgment is entered, and the search result of the final SF is obtained and the search is exited.

[0031] Preferably, when the AGC changes in real time over time, the intermediate variable value needs to be compensated for the analog AGC and digital AGC gain before the remaining steps are performed, so that the analog gain value is , the digital gain is ,

[0032] After removing AGC gain , where k represents the number of bits of the number, represents a logarithmic operation; then repeat steps 1 to 4 to obtain the corresponding SF recognition result.

[0033] Preferably, when the AGC changes in real time over time, the SNR value in the calculated signal is used to replace the SNR value mentioned in steps 1 to 4. Value, calculated: , then calculate , where i is the index of the data subscript in vector X, and T is the calculation cycle. The meaning is to convert the vector Sum all the data elements in , represents the noise power; calculate ,Will Bring it into step 1 to step 4 and replace The values ​​are calculated to obtain the final SF recognition result.

[0034] The abbreviations used in the present invention are as follows:

[0035] SF: Spread factor, BW: Band Width, PL: Pay Load, SNR: Signal to Noise Ratio, AGC: Automatic Gain control.

[0036] Compared with the prior art, the technical solution of the present invention has the following advantages / benefits:

[0037] 1. Realize fast SF recognition function.

[0038] 2. Reduce the complexity of threshold adjustment for each judgment during SF recognition. BRIEF DESCRIPTION OF THE DRAWINGS

[0039] In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required for use in the embodiments will be briefly introduced below. It should be understood that the following drawings only show certain embodiments of the present invention and therefore should not be regarded as limiting the scope. For ordinary technicians in this field, other related drawings can be obtained based on these drawings without paying creative work.

[0040] Figure 1 The present invention is a flowchart of a method for rapid SF identification of a gateway. DETAILED DESCRIPTION

[0041] In order to make the purpose, technical solutions and advantages of the present invention clearer, the technical solutions in the embodiments of the present invention are clearly and completely described below. Obviously, the described embodiments are part of the embodiments of the present invention, rather than all the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in the field without creative work are within the scope of protection of the present invention. Therefore, the detailed description of the embodiments of the present invention provided below is not intended to limit the scope of the claimed invention, but merely represents the selected embodiments of the present invention.

[0042] It should be noted that similar reference numerals and letters denote similar items in the following drawings, and thus, once an item is defined in one drawing, it may not be further defined or explained in the subsequent drawings.

[0043] Embodiment 1:

[0044] like Figure 1 As shown, a fast SF identification method for a gateway includes the following steps: Step 1: First, the received signal is Group the SF configurations from SF=6 to SF=12, set SF=L1, and then calculate the intermediate variable value of L1; Step 2: Calculate the intermediate variable value of SF=6 and the intermediate variable value of SF=12; Step 3: Compare the intermediate variable value of L1 with the intermediate variable value of SF=6 and the intermediate variable value of SF=12 and output the result: Step 4: Set SF=L2 again, then calculate the intermediate variable value of L2, compare the intermediate variable value of L2 with the intermediate variable value of SF=6 and the intermediate variable value of SF=12 and output the result, and the process ends.

[0045] The calculation process of the intermediate variable value of L1 is as follows: First, the received signal is calculated according to each The chips are grouped and then calculated:

[0046]

[0047] in represents a symbol after grouping every SF=L1 chips, represents the transmitted local signal conjugate of SF=L1, and Represents the absolute value symbol;

[0048] When getting After the result, find its maximum value, recorded as .

[0049] The calculation process of the intermediate variable value of SF=6 in step 2 is as follows:

[0050] in Represents a symbol after grouping according to SF=6 chips. represents the transmitted local signal conjugate with SF=6, and Represents the absolute value symbol; when obtaining After the result, find its maximum value, recorded as

[0051] .

[0052] The calculation process of the intermediate variable value of SF=12 in step 2 is as follows:

[0053] in Represents a symbol after grouping according to each SF=12 chips, represents the transmitted local signal conjugate with SF=12, and Represents the absolute value symbol; when obtaining After the result, find its maximum value, recorded as

[0054] .

[0055] The comparison process of step three is as follows:

[0056] Result 1: If ≤ , then the value range of SF recognition result R is L1≤R≤12, is a coefficient factor that compensates for the noise Value error;

[0057] Result 2: If , then the SF recognition result is SF=6, and the search is exited;

[0058] Result 3: If > , then the SF recognition result is L1, and the search is exited.

[0059] When result 1 is satisfied, let SF = L2, and calculate the intermediate variable value of L2, recorded as .

[0060] right , as well as For comparison, the process is as follows:

[0061] Result 1: ≤ , then the value range of SF recognition result R is L2≤R≤12;

[0062] Result 2: , then SF recognizes the result L1 and jumps out of the search;

[0063] Result 3: , then the SF recognition result is L2, and the search is exited; It is the coefficient factor.

[0064] The comparison process is repeated until SF (1≤N≤5) in LN is equal to 11, and then the final judgment is entered, and the search result of the final SF is obtained and the search is exited.

[0065] Example 2: In real life, there is a scenario of automatic AGC, that is, the AGC changes in real time over time. Therefore, directly using this method will cause the recognition result to be affected by the AGC adjustment. Therefore, in this case, the intermediate variable value cannot be used directly. Instead, the intermediate variable value needs to be compensated for the analog AGC and digital AGC gain before performing the recognition operation in this method.

[0066] Let the analog gain be , the digital gain is .

[0067] Then after removing the AGC gain , where k represents the number of bits in the number. Represents the logarithm operation.

[0068] Then calculate The corresponding SF recognition result can be obtained by repeating the operations in this method.

[0069] Example 3: In real life, there is a scenario of automatic AGC, that is, the AGC changes in real time over time. Therefore, directly using this method will cause the recognition result to be affected by the AGC adjustment. Therefore, in this case, it is not possible to directly use the intermediate variable value to calculate the SNR value of the signal to replace the SNR value mentioned in this solution. This is because whether it is digital AGC or analog AGC, it will not change the SNR value of the entire signal.

[0070] First, we calculate according to the method in this scheme

[0071] Then calculate , where i is the index of the data in vector X, and T is the calculation period. The meaning is to convert the vector Sum all the data elements in .

[0072] Then calculate Then Bring it into this solution and replace The values ​​are calculated and related calculations are performed to obtain the final SF recognition result.

[0073] The above are only preferred embodiments of the present invention. It should be noted that the above preferred embodiments should not be regarded as limiting the present invention, and the protection scope of the present invention should be based on the scope defined by the claims. For ordinary technicians in this technical field, several improvements and modifications can be made without departing from the spirit and scope of the present invention, and these improvements and modifications should also be regarded as the protection scope of the present invention.

Claims

1. A fast SF identification method for a gateway, characterized in that: The following steps are involved: Step 1: First, receive the signal according to 2 SF Perform grouping, divide the spreading factor configuration from spreading factor equal to 6 to spreading factor equal to 12, set the spreading factor equal to L1, and then calculate the intermediate variable value of L1; Step 2: Calculate the intermediate variable value when the spreading factor is equal to 6 and the intermediate variable value when the spreading factor is equal to 12; Step 3: compare the intermediate variable value when the spreading factor is equal to L1, the intermediate variable value when the spreading factor is equal to 6, and the intermediate variable value when the spreading factor is equal to 12, and output the comparison result; Step 4: Set the spreading factor to L2 again, then calculate the intermediate variable value when the spreading factor is L2, compare the intermediate variable value when the spreading factor is L2 with the intermediate variable value when the spreading factor is 6 and the intermediate variable value when the spreading factor is 12, and output the comparison result, and the process ends; where L1 represents the first search, L2 represents the second search; SF is the spreading factor; The calculation process of the intermediate variable value of L1 is as follows: First, the received signal is calculated according to every 2 L1 The chips are grouped and then calculated: where rx L1 Represents a symbol after grouping according to each spreading factor equal to L1 chips, represents the conjugate of the transmitted local signal with a spreading factor equal to L1, and || represents the absolute value sign, and fft means fast Fourier transform; When getting X L1 After the result, find its maximum value and record it as Value L1 =max(X L1 );X L1 Represents the correlation between received data and sent signals; The calculation process of the intermediate variable value with the spreading factor equal to 6 in step 2 is as follows: Where rx6 represents a symbol after grouping according to the chip situation where each spreading factor is equal to 6. represents the conjugate of the local signal sent when the spreading factor is equal to 6, and || represents the absolute value symbol; after obtaining the X6 result, find its maximum value, which is recorded as Value6=max(X6), where X6 represents the correlation result obtained by grouping 2 to the sixth power, i.e., 64 chips; The calculation process of the intermediate variable value when the spreading factor is equal to 12 in step 2 is as follows: where rx 12 Represents a symbol after grouping according to the code chips when the spreading factor is equal to 12. represents the local signal conjugate when the spreading factor is equal to 12, and || represents the absolute value sign; when obtaining X 12 After the result, find its maximum value and record it as Value 12 =max(X 12 ); The comparison process of step 3 is as follows: Result 1: If Value6×α6≤Value L1 ≤Value 12 ×α 12 , then the value range of SF recognition result R is L1≤R≤12, α6 and α 12 is a coefficient factor to compensate for the noise on Value6 and Value L1 、Value 12 The error caused by Result 2: If Value L1 <Value6 × α6, then the SF recognition result is SF = 6, and the search is terminated; Result 3: If Value L1 >Value 12 ×α 12 , then the SF recognition result is L1, and the search is exited; When result 1 is satisfied, set the spreading factor equal to L2, and calculate the intermediate variable value of L2, recorded as Value L2 ; for Value L2 、Value L1 and Value 12 For comparison, the process is as follows: Result 1: Value L1 ×α L1 ≤Value L2 ≤Value 12 ×α 12 , then the value range of SF recognition result R is L2≤R≤12; Result 2: Value L2 <Value L1 ×α L , then SF recognizes the result L1 and jumps out of the search; Result 3: Value L2 >Value 12 ×α 12 , then the SF recognition result is L2, and the search is exited; where α L is the coefficient factor; The comparison process is repeated until the spreading factor in LN is equal to 11, and then the final judgment is entered, and the search result of the final SF is obtained and the search is exited; LN represents the result of the Nth search, 1≤N≤5.

2. A fast SF identification method for a gateway according to claim 1, characterized in that: When the automatic gain control changes in real time over time, the intermediate variable value needs to be compensated for the analog automatic gain control and the digital automatic gain control gain before the remaining steps are performed, so that the analog gain value is AGC A , digital gain is AGC D , after removing the automatic gain control gain Wherein k represents the number of bits of the number, log represents the logarithmic operation, and value′ represents the numerical parameter before the automatic gain control is performed; then repeat steps 1 to 4 to obtain the corresponding SF recognition result.

3. A fast SF identification method for a gateway according to claim 1, characterized in that: When the automatic gain control changes in real time over time, the signal-to-noise ratio value in the calculated signal is used to replace the Value value mentioned in steps 3 to 4. Value represents the signal-to-noise ratio value, and the calculation results are: Value L1 =max(X L1 ), and then calculate Here i is the index of the data subscript in vector X, The meaning is to convert vector X L Sum all data elements in , T represents the calculation period, i is the index of the data subscript in the vector; calculate SNR L1 =Value L1 / Noise L1 , the SNR L1 Substitute the Value value in step 1 to step 4 and perform calculations to obtain the final SF recognition result; Noise L1 Represents the noise power, SNR L1 Represents the signal-to-noise ratio during the first search.