Adjacent channel interference elimination method, device, equipment, medium and product

Abstract

The invention discloses an adjacent channel interference elimination method and device, equipment, a medium and a product, and relates to the field of adjacent channel interferences, and the method comprises the steps: enabling i to be equal to 1 under the current iteration frequency; in the time slot corresponding to the current main end, the current main end searches the starting moment of transmitting the synchronization signal by the target main end by using the synchronization signal; if the starting time when the target master terminal transmits the synchronization signal exists, calculating a difference value between the starting time when the target master terminal transmits the synchronization signal and the starting time when the current master terminal transmits the synchronization signal; updating the time slot corresponding to each main end in the main end set according to the difference value; 1 is added to the value of i, circulation is carried out again until the value of i is equal to N + 1, the number of iterations is updated, and next iteration is carried out until the starting moments of the synchronization signals transmitted by the main ends in the main end set are the same. According to the method, adjacent channel interference can be reduced to a very low level, so that multiple unmanned aerial vehicles cannot interfere with one another when being used in a certain limited area at the same time; and multi-group coexistence of the wireless data transmission system of the unmanned aerial vehicle on adjacent channels is realized.

Description

Technical Field

[0001] The present application relates to the technical field of adjacent channel interference, and in particular to a method, device, equipment, medium and product for eliminating adjacent channel interference. Background Art

[0002] When drones are used today, it is often required to use multiple drones simultaneously in a limited area. This can usually only be achieved through a multi-band plus filter solution. It is difficult to use them directly within a narrower bandwidth. Because the Time Division Duplexing (TDD) system has signal transmission and reception on both the remote control and the aircraft end, when one system receives and another system transmits at the same time, the receiving channel will be interfered. Therefore, within a narrow bandwidth, adjacent channel interference cannot be reduced to a very low level, causing multiple drones to interfere with each other when used simultaneously in a limited area. Summary of the invention

[0003] The purpose of this application is to provide a method, device, equipment, medium and product for eliminating adjacent channel interference, which can reduce adjacent channel interference to a very low level, so that multiple drones can be used simultaneously in a certain limited area without interfering with each other, and realize the coexistence of multiple groups of drone wireless data transmission systems on adjacent channels.

[0004] To achieve the above objectives, this application provides the following solutions:

[0005] In a first aspect, the present application provides a method for eliminating adjacent channel interference, comprising:

[0006] At the current number of iterations, let i = 1;

[0007] In the time slot corresponding to the current master end, the current master end uses the synchronization signal to search for the start time of the target master end transmitting the synchronization signal; the current master end is the master end corresponding to the i-th drone in the set area; the target master end is any master end in the remaining master end set, and the remaining master end set includes other master ends in the master end set except the current master end; the master end set includes the master ends corresponding to each drone in the drone set; the drone set includes N drones working in the set area in the same time period;

[0008] If the starting time for the target master end to transmit the synchronization signal does not exist, then the value of i is increased by 1, and the step is returned to the time slot corresponding to the current master end. The current master end uses the synchronization signal to search for the starting time for the target master end to transmit the synchronization signal until the value of i is equal to N+1, and the number of iterations is updated, and the next iteration is entered until the starting time for each master end in the master end set to transmit the synchronization signal is the same;

[0009] If the starting time for the target master end to transmit the synchronization signal exists, then the difference between the starting time for the target master end to transmit the synchronization signal and the starting time for the current master end to transmit the synchronization signal is calculated;

[0010] Updating the time slot corresponding to each master end in the master end set according to the difference;

[0011] Let the value of i be increased by 1, and return to step 1. In the time slot corresponding to the current master end, the current master end uses the synchronization signal to search for the starting time when the target master end transmits the synchronization signal until the value of i is equal to N+1, and the number of iterations is updated to enter the next iteration until the starting time when each master end in the master end set transmits the synchronization signal is the same.

[0012] Optionally, updating the time slot corresponding to each master end in the master end set according to the difference specifically includes:

[0013] Calculate the ratio of the difference to P; P is the total number of time slots corresponding to all master ends in the master end set;

[0014] For any master end in the master end set, the time slot corresponding to the master end is updated by adding the ratio to the time slot corresponding to the master end.

[0015] In a second aspect, the present application provides an adjacent channel interference elimination device, comprising:

[0016] The initial module is used to set i=1 at the current iteration number;

[0017] The synchronization signal search module is used to search the starting time of the target master end transmitting the synchronization signal by using the synchronization signal in the time slot corresponding to the current master end; the current master end is the master end corresponding to the i-th drone in the set area; the target master end is any master end in the remaining master end set, and the remaining master end set includes other master ends in the master end set except the current master end; the master end set includes the master ends corresponding to each drone in the drone set; the drone set includes N drones working in the same time period in the set area;

[0018] The first updating module is used for, if the starting time for the target master end to transmit the synchronization signal does not exist, adding 1 to the value of i, returning to the step, in the time slot corresponding to the current master end, the current master end uses the synchronization signal to search for the starting time for the target master end to transmit the synchronization signal, until the value of i is equal to N+1, updating the number of iterations, and entering the next iteration, until the starting time for each master end in the master end set to transmit the synchronization signal is the same;

[0019] A difference calculation module, used for calculating the difference between the start time of the target master end transmitting the synchronization signal and the start time of the current master end transmitting the synchronization signal if the start time of the target master end transmitting the synchronization signal exists;

[0020] A time slot updating module, used for updating the time slot corresponding to each master end in the master end set according to the difference;

[0021] The second update module is used to increase the value of i by 1, return to the step in which the current master end uses the synchronization signal to search for the starting time of the target master end transmitting the synchronization signal in the time slot corresponding to the current master end, until the value of i is equal to N+1, update the number of iterations, and enter the next iteration until the starting time of each master end in the master end set transmitting the synchronization signal is the same.

[0022] Optionally, the time slot updating module specifically includes:

[0023] A ratio calculation unit, used to calculate the ratio of the difference to P; P is the total number of time slots corresponding to all master ends in the master end set;

[0024] The time slot updating unit is used to update the time slot corresponding to any master end in the master end set by adding the ratio to the time slot corresponding to the master end.

[0025] In a third aspect, the present application provides a computer device, including: a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to implement any of the adjacent channel interference elimination methods described above.

[0026] In a fourth aspect, the present application provides a computer-readable storage medium having a computer program stored thereon, and when the computer program is executed by a processor, the adjacent channel interference elimination method described in any one of the above is implemented.

[0027] In a fifth aspect, the present application provides a computer program product, including a computer program, which, when executed by a processor, implements any one of the adjacent channel interference elimination methods described above.

[0028] According to the specific embodiments provided in this application, this application has the following technical effects:

[0029] The present application provides a method, device, equipment, medium and product for eliminating adjacent channel interference. Under the current number of iterations, let i=1; in the time slot corresponding to the current master end, the current master end uses the synchronization signal to search for the starting time of the target master end transmitting the synchronization signal; if the starting time of the target master end transmitting the synchronization signal exists, the difference between the starting time of the target master end transmitting the synchronization signal and the starting time of the current master end transmitting the synchronization signal is calculated; the time slots corresponding to each master end in the master end set are updated according to the difference; let the value of i be added by 1, and return to the step. In the time slot corresponding to the current master end, the current master end uses the synchronization signal to search for the starting time of the target master end transmitting the synchronization signal until the value of i is equal to N+1, and the number of iterations is updated to enter the next iteration until the starting time of the transmission of the synchronization signal by each master end in the master end set is the same, and the time slots of these devices are aligned for transmission and reception, so that transmission is paired with transmission and reception is paired with reception, and the adjacent channel interference is reduced to a very low level, so that multiple drones can be used simultaneously in a certain limited area without interfering with each other, and multiple groups of drone wireless data transmission systems can coexist on adjacent channels. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0031] Figure 1 It is the system structure diagram;

[0032] Figure 2 A flowchart of a method for eliminating adjacent channel interference provided in one embodiment of the present application;

[0033] Figure 3 This is the time slot relationship diagram between each pair of devices after power-on;

[0034] Figure 4 To use the adjacent channel interference elimination method provided by an embodiment of the present application Figure 3 The result diagram after processing;

[0035] Figure 5 A schematic diagram of a method for eliminating adjacent channel interference provided in an embodiment of the present application;

[0036] Figure 6 A schematic diagram of the structure of a computer device provided in one embodiment of the present application. DETAILED DESCRIPTION

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

[0038] In order to make the above-mentioned objects, features and advantages of the present application more obvious and easy to understand, the present application is further described in detail below with reference to the accompanying drawings and specific implementation methods.

[0039] like Figure 1 As shown, the system has multiple master ends (remote controllers) and multiple slave ends (drones), and TDD communication is performed between the master and the slaves. The channel frequencies are f1 to fN, and the channels where the frequencies f1 to fN are located are adjacent channels (the bandwidth of each channel is BW). After all devices are powered on, the master end periodically sends a synchronization signal, and the slave end synchronizes with the master end, sends its own signal following the signal of the master end, and communicates according to the agreed TDD time slot allocation. The time of one transmission by the master end + one transmission by the slave end is called a time slot. The length of the time slot is fixed to M seconds. The sending time of the master end and the sending time of the slave end are also fixedly allocated. The start of the master end's sending signal is a synchronization sequence, and the position of the signal can be accurately calculated. After power-on, there is no relationship between the time slots between each pair of devices, such as Figure 3 If there is no synchronization mechanism, the transmission and reception of these devices will interfere with each other at the same time. Even if they are aligned at the beginning, they will gradually shift over time because the crystal clocks of each device are not completely consistent. The goal of this application is to align the time slots of these devices to ensure that the transmission and reception do not interfere with each other. Figure 2 and Figure 5 As shown, the adjacent channel interference elimination method provided by the present application includes the following steps, wherein:

[0040] Step 201: At the current iteration number, let i=1.

[0041] Step 202: In the time slot corresponding to the current master end, the current master end uses the synchronization signal to search for the start time of the target master end transmitting the synchronization signal; the current master end is the master end corresponding to the i-th UAV in the set area; the target master end is any master end in the remaining master end set, and the remaining master end set includes other master ends in the master end set except the current master end; the master end set includes the master ends corresponding to each UAV in the UAV set; the UAV set includes N UAVs working in the set area in the same time period.

[0042] Step 203: If the starting time for the target master end to transmit the synchronization signal does not exist, add 1 to the value of i and return to step 204. In the time slot corresponding to the current master end, the current master end uses the synchronization signal to search for the starting time for the target master end to transmit the synchronization signal until the value of i is equal to N+1, and the number of iterations is updated to enter the next iteration until the starting time for each master end in the master end set to transmit the synchronization signal is the same.

[0043] Step 204: If the start time of the target master end transmitting the synchronization signal exists, then calculate the difference between the start time of the target master end transmitting the synchronization signal and the start time of the current master end transmitting the synchronization signal.

[0044] Step 205: Update the time slot corresponding to each master end in the master end set according to the difference.

[0045] Step 206: Add 1 to the value of i, and return to step 206. In the time slot corresponding to the current master end, the current master end uses the synchronization signal to search for the starting time of the target master end transmitting the synchronization signal until the value of i is equal to N+1, and updates the number of iterations to enter the next iteration until the starting time of the synchronization signal transmitted by each master end in the master end set is the same.

[0046] By implementing the above steps 201 to 206, adjacent channel interference can be reduced to a very low level, so that multiple drones can be used simultaneously in a limited area without interfering with each other, and multiple groups of drone wireless data transmission systems can coexist on adjacent channels.

[0047] It is also possible to operate on non-adjacent channels, which are the limiting frequency allocation for this method.

[0048] It can use its own synchronization signal to detect the host of other channels in real time, track and maintain this state in real time without other additional synchronization conditions (such as GPS, 1pps, etc.).

[0049] There is no additional computing requirement, and the synchronization module for normal communication can be reused.

[0050] When one or more of them are turned off, it has no effect on the devices that are still working.

[0051] In another exemplary embodiment of the present application, updating the time slot corresponding to each master end in the master end set according to the difference specifically includes:

[0052] The ratio of the difference to P is calculated; P is the total number of time slots corresponding to all the master ends in the master end set.

[0053] For any master end in the master end set, the time slot corresponding to the master end is updated by adding the ratio to the time slot corresponding to the master end.

[0054] This application also provides an embodiment to introduce the above method in detail:

[0055] Step 1: Each master randomly selects one time slot from P time slots, does not send any signal, randomly selects a channel from the remaining channels, and uses the synchronization signal to search for the synchronization position (the starting time when the master corresponding to the selected channel transmits the synchronization signal). The slave remains silent in this time slot.

[0056] Step 2: If the synchronization position is found, the difference K between the synchronization position and the starting position of the current master end (the starting time of transmitting the synchronization signal) is calculated.

[0057] Step 3: Evenly distribute K to P time slots to adjust the starting position. The adjustment amount each time is Smaller than the receiver synchronization range.

[0058] Step 4: If the synchronization position is not found, no adjustment is made and the signal is sent normally in the next time slot.

[0059] Step 5: Replace the current master end and execute steps 1 to 4 in a loop. After P×N time slots, all the master ends of the system will search all non-self channels, obtain the starting positions of the remaining master ends, and adjust to that position.

[0060] Step 6: After a certain period of time, the entire system will gradually converge to the same starting position, and we get Figure 4 In this case. Figure 4 After that, the transmissions of all the masters and slaves are aligned, and the interference between transmission and reception is minimized, which can greatly improve the accuracy of data transmission when multiple groups of devices are used at the same time.

[0061] Based on the same inventive concept, the embodiment of the present application also provides an adjacent channel interference elimination device for implementing the adjacent channel interference elimination method involved above. The implementation scheme for solving the problem provided by the device is similar to the implementation scheme recorded in the above method, so the specific limitations in the embodiments of one or more adjacent channel interference elimination devices provided below can refer to the limitations of the adjacent channel interference elimination method above, and will not be repeated here.

[0062] In an exemplary embodiment, an adjacent channel interference elimination device is provided, comprising:

[0063] The initial module is used to set i=1 at the current iteration number.

[0064] The synchronization signal search module is used to use the synchronization signal to search for the start time of the target master end transmitting the synchronization signal in the time slot corresponding to the current master end; the current master end is the master end corresponding to the i-th drone in the set area; the target master end is any master end in the remaining master end set, and the remaining master end set includes other master ends in the master end set except the current master end; the master end set includes the master ends corresponding to each drone in the drone set; the drone set includes N drones working in the set area in the same time period.

[0065] The first update module is used to increase the value of i by 1 if the starting time for the target master end to transmit the synchronization signal does not exist, and return to the step in which the current master end searches for the starting time for the target master end to transmit the synchronization signal using the synchronization signal in the time slot corresponding to the current master end until the value of i is equal to N+1, and updates the number of iterations to enter the next iteration until the starting time for each master end in the master end set to transmit the synchronization signal is the same.

[0066] The difference calculation module is used to calculate the difference between the start time of the target master end transmitting the synchronization signal and the start time of the current master end transmitting the synchronization signal if the start time of the target master end transmitting the synchronization signal exists.

[0067] The time slot updating module is used to update the time slot corresponding to each master end in the master end set according to the difference.

[0068] The second update module is used to increase the value of i by 1, return to the step in which the current master end uses the synchronization signal to search for the starting time of the target master end transmitting the synchronization signal in the time slot corresponding to the current master end, until the value of i is equal to N+1, update the number of iterations, and enter the next iteration until the starting time of each master end in the master end set transmitting the synchronization signal is the same.

[0069] As an optional implementation manner, the time slot updating module specifically includes:

[0070] The ratio calculation unit is used to calculate the ratio of the difference and P; P is the total number of time slots corresponding to all master ends in the master end set.

[0071] The time slot updating unit is used to update the time slot corresponding to any master end in the master end set by adding the ratio to the time slot corresponding to the master end.

[0072] In an exemplary embodiment, a computer device is provided. The computer device may be a server or a terminal. The internal structure diagram thereof may be as follows: Figure 6As shown. The computer device includes a processor, a memory, an input / output interface (Input / Output, referred to as I / O) and a communication interface. The processor, the memory and the input / output interface are connected through a system bus, and the communication interface is connected to the system bus through the input / output interface. The processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program and a database. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The database of the computer device is used to store adjacent channel interference elimination data. The input / output interface of the computer device is used to exchange information between the processor and an external device. The communication interface of the computer device is used to communicate with an external terminal through a network connection. When the computer program is executed by the processor, a method for eliminating adjacent channel interference is implemented.

[0073] Those skilled in the art will understand that Figure 6 The structure shown in the figure is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation on the computer device to which the solution of the present application is applied. The specific computer device may include more or fewer components than those shown in the figure, or combine certain components, or have a different arrangement of components. In an exemplary embodiment, a computer device is provided, including a memory and a processor, wherein a computer program is stored in the memory, and the processor implements the above-mentioned method embodiments when executing the computer program.

[0074] In an exemplary embodiment, a computer-readable storage medium is provided, storing a computer program, and when the computer program is executed by a processor, the above-mentioned method embodiments are implemented.

[0075] In an exemplary embodiment, a computer program product is provided, including a computer program, and when the computer program is executed by a processor, the above-mentioned method embodiments are implemented.

[0076] It should be noted that the user information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data used for analysis, stored data, displayed data, etc.) involved in this application are all information and data authorized by the user or fully authorized by all parties, and the collection, use and processing of relevant data must comply with relevant regulations.

[0077] Those of ordinary skill in the art can understand that all or part of the processes in the above-mentioned embodiment methods can be completed by instructing the relevant hardware through a computer program, and the computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to the memory, database or other medium used in the embodiments provided in the present application can include at least one of non-volatile and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical memory, high-density embedded non-volatile memory, resistive random access memory (ReRAM), magnetic random access memory (MRAM), ferroelectric random access memory (FRAM), phase change memory (PCM), graphene memory, etc. Volatile memory can include random access memory (RAM) or external cache memory, etc. By way of illustration and not limitation, RAM may be in various forms, such as static random access memory (SRAM) or dynamic random access memory (DRAM).

[0078] The database involved in each embodiment provided in this application may include at least one of a relational database and a non-relational database. The non-relational database may include a distributed database based on blockchain, etc., but is not limited thereto. The processor involved in each embodiment provided in this application may be a general-purpose processor, a central processing unit, a graphics processor, a digital signal processor, a programmable logic device, a data processing logic device based on quantum computing, etc., but is not limited thereto.

[0079] The technical features of the above embodiments may be arbitrarily combined. To make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0080] This article uses specific examples to illustrate the principles and implementation methods of this application. The description of the above embodiments is only used to help understand the method and core ideas of this application. At the same time, for those skilled in the art, according to the ideas of this application, there will be changes in the specific implementation methods and application scope. In summary, the content of this specification should not be understood as limiting this application.

Claims

1. A method for eliminating adjacent channel interference, characterized in that: The adjacent channel interference elimination method comprises: At the current number of iterations, let i = 1; In the time slot corresponding to the current master end, the current master end uses the synchronization signal to search for the start time of the target master end transmitting the synchronization signal; the current master end is the master end corresponding to the i-th drone in the set area; the target master end is any master end in the remaining master end set, and the remaining master end set includes other master ends in the master end set except the current master end; the master end set includes the master ends corresponding to each drone in the drone set; the drone set includes N drones working in the set area in the same time period; If the starting time for the target master end to transmit the synchronization signal does not exist, then the value of i is increased by 1, and the step is returned to the time slot corresponding to the current master end. The current master end uses the synchronization signal to search for the starting time for the target master end to transmit the synchronization signal until the value of i is equal to N+1, and the number of iterations is updated, and the next iteration is entered until the starting time for each master end in the master end set to transmit the synchronization signal is the same; If the starting time for the target master end to transmit the synchronization signal exists, then the difference between the starting time for the target master end to transmit the synchronization signal and the starting time for the current master end to transmit the synchronization signal is calculated; Updating the time slot corresponding to each master end in the master end set according to the difference; Let the value of i be increased by 1, and return to step 1. In the time slot corresponding to the current master end, the current master end uses the synchronization signal to search for the starting time when the target master end transmits the synchronization signal until the value of i is equal to N+1, and the number of iterations is updated to enter the next iteration until the starting time when each master end in the master end set transmits the synchronization signal is the same.

2. The adjacent channel interference elimination method according to claim 1, characterized in that: The updating of the time slot corresponding to each master end in the master end set according to the difference specifically includes: Calculate the ratio of the difference to P; P is the total number of time slots corresponding to all master ends in the master end set; For any master end in the master end set, the time slot corresponding to the master end is updated by adding the ratio to the time slot corresponding to the master end.

3. An adjacent channel interference elimination device, characterized in that: The adjacent channel interference elimination device comprises: The initial module is used to set i=1 at the current number of iterations; The synchronization signal search module is used to search the starting time of the target master end transmitting the synchronization signal by using the synchronization signal in the time slot corresponding to the current master end; the current master end is the master end corresponding to the i-th drone in the set area; the target master end is any master end in the remaining master end set, and the remaining master end set includes other master ends in the master end set except the current master end; the master end set includes the master ends corresponding to each drone in the drone set; the drone set includes N drones working in the same time period in the set area; The first updating module is used for, if the starting time for the target master end to transmit the synchronization signal does not exist, adding 1 to the value of i, returning to the step, in the time slot corresponding to the current master end, the current master end uses the synchronization signal to search for the starting time for the target master end to transmit the synchronization signal, until the value of i is equal to N+1, updating the number of iterations, and entering the next iteration, until the starting time for each master end in the master end set to transmit the synchronization signal is the same; A difference calculation module, used for calculating the difference between the start time of the target master end transmitting the synchronization signal and the start time of the current master end transmitting the synchronization signal if the start time of the target master end transmitting the synchronization signal exists; A time slot updating module, used for updating the time slot corresponding to each master end in the master end set according to the difference; The second update module is used to increase the value of i by 1, return to the step in which the current master end uses the synchronization signal to search for the starting time of the target master end transmitting the synchronization signal in the time slot corresponding to the current master end, until the value of i is equal to N+1, update the number of iterations, and enter the next iteration until the starting time of each master end in the master end set transmitting the synchronization signal is the same.

4. The adjacent channel interference elimination device according to claim 3, characterized in that: The time slot updating module specifically comprises: A ratio calculation unit, used to calculate the ratio of the difference to P; P is the total number of time slots corresponding to all master ends in the master end set; The time slot updating unit is used to update the time slot corresponding to any master end in the master end set by adding the ratio to the time slot corresponding to the master end.

5. A computer device comprising: A memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to implement the adjacent channel interference elimination method according to any one of claims 1 to 2.

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 adjacent channel interference elimination method according to any one of claims 1 to 2 is implemented.

7. A computer program product, comprising a computer program, characterized in that When the computer program is executed by a processor, the adjacent channel interference elimination method according to any one of claims 1 to 2 is implemented.

Images