A secondary radar S mode time slot rearrangement adaptive scheduling method based on detection efficiency improvement

Abstract

The application discloses a secondary radar S mode time slot rearrangement adaptive scheduling method based on detection efficiency improvement, which comprises the following steps: a PPC carries out comprehensive time slot planning for S mode target captured in each cycle to make S mode roll call inquiry, establishes an S mode inquiry demand chain table in units of sectors, and sends the S mode inquiry demand chain table to an FPGA in units of sectors at the starting moment of each cycle, so that the FPGA establishes an initial cache area to store the S mode inquiry demand chain table; S mode inquiry demand information in the S mode inquiry demand chain table comprises S mode inquiry data, an S mode address, a BDS code number and a target predicted distance; at the starting moment of each sector or the starting moment of inquiry chain table cyclic scheduling in the sector, the data of the sector in the initial cache area is subjected to deduplication processing, and the FPGA is used to remove the matched inquiry time slot and rearrange the time sequence of the inquiry chain table of the current sector in real time. The application improves inquiry time slot use and target detection efficiency, and reduces spatial domain same frequency band radiation interference.

Description

Technical Field

[0001] This invention relates to the field of secondary radar technology, and in particular to an adaptive scheduling method for S-mode time slot rearrangement of secondary radar based on improved detection efficiency. Background Technology

[0002] Secondary radar can accurately detect the azimuth, altitude, and speed of aircraft, and is widely used in air traffic control fields such as en-route flight surveillance and routine and training flight support. Mode S is a data communication application based on a secondary radar architecture, including uplink interrogation and downlink response bidirectional data channels. Interrogation is further divided into two forms: all-call and name-based. All-call refers to a single interrogator simultaneously interrogating all transponders in the airspace, while name-based interrogation refers to a single interrogator interrogating a specific transponder in the airspace at a specific time. Since both interrogation and response require electromagnetic wave transmission time, in situations with high aircraft density, an adaptive name-based interrogation strategy needs to be designed to avoid signal interleaving during reception and subsequent decoding interference, ensuring the efficiency of the interrogator's name-based interrogation of all aircraft in the airspace.

[0003] The existing secondary radar S-mode scheduling method involves the PPC performing integrated time slot planning for S-mode name-and-click interrogation of targets acquired in each loop. An S-mode name-and-click interrogation request list is established on a sector-by-sector basis. At the start of each loop, the S-mode name-and-click interrogation request information for that loop is sent to the FPGA on a sector-by-sector basis. The FPGA directly uses the S-mode name-and-click interrogation request information sent by the PPC to schedule S-mode name-and-click interrogations on a sector-by-sector basis. However, because the S-mode name-and-click interrogation request information sent by the PPC cannot match the real-time nature of sector scanning, in this case, there is no real-time time slot elimination and timing rearrangement for S-mode name-and-click interrogations that have already completed response matching in adjacent sectors or the current sector. This results in some interrogation time slots being idle, leading to a decrease in interrogation time slot utilization and target detection efficiency. Summary of the Invention

[0004] In view of this, the present invention provides an adaptive scheduling method for secondary radar S-mode time slot rearrangement based on improved detection efficiency.

[0005] This invention discloses an adaptive scheduling method for secondary radar S-mode time slot rearrangement based on improved detection efficiency, comprising:

[0006] Step 1: The PPC performs integrated time slot planning for S-mode target name-calling for each round of captured S-mode targets, establishes an S-mode query request list in sector units, and sends the S-mode query request list to the FPGA in sector units at the beginning of each round. The FPGA establishes an initial buffer to store the S-mode query request list. The S-mode query request information in the S-mode query request list includes S-mode query data, S-mode address, BDS code number, and target prediction distance.

[0007] Step 2: At the start of each sector or at the start of the circular scheduling of the query list within a sector, deduplication is performed on the data of the sectors in the initial buffer. The FPGA is used to remove the time slots of matched queries and rearrange the timing sequence of the query list of the current sector in real time.

[0008] Further, step 2 includes:

[0009] Step 21: The FPGA allocates a first buffer and a second buffer. Based on whether the current sector query matches the target and whether the second buffer stores the S-mode address and BDS code of the query, it determines whether to write the S-mode address and BDS code of the query into the second buffer. At the same time, the data corresponding to the query contained in the current sector in the initial buffer is cleared.

[0010] Step 22: At the beginning of each query sector, all query data contained in that sector in the initial buffer are sequentially matched with the first buffer; during the scheduling of each sector, the query list of that sector in the initial buffer is cyclically called for encoding, and target matching is determined for each query during this process, and the data corresponding to queries with matched targets contained in that sector in the initial buffer is cleared; after the query list of that sector in the initial buffer has completed one call encoding, the remaining query data of that sector in the initial buffer is sent out for the next step of dynamic sorting of query data;

[0011] Step 23: The FPGA sorts the query data in each sector according to the predicted distance of the target, and caches the sorted data;

[0012] Step 24: When there are J name queries for the same target in a single sector, sort the J name queries corresponding to the same target in a distributed manner, and sort the name queries of all targets in a single sector in turn.

[0013] Step 25: Sequentially arrange the N point-name queries, reserving the required time before and after each query and predicted response position to ensure that there is no overlap between query codes / response signals and different response signals; use a preset time slot length for arrangement.

[0014] Further, step 21 includes:

[0015] If a query in the current sector newly matches a target, or if a query in the current sector has already matched a target in the previous sector, and the S-mode address and BDS code of the query are not yet stored in the second buffer, then the S-mode address and BDS code of the query are written to the second buffer, and the data corresponding to the query in the current sector contained in the initial buffer are cleared; the first buffer is used to store the S-mode address and BDS code of queries that have already matched a target response in the previous sector, and the second buffer is used to store the S-mode address and BDS code of queries that have already matched a target response in the current sector;

[0016] When querying sector switching, the value of the second buffer is assigned to the first buffer, and then the second buffer is cleared.

[0017] Further, step 22 includes:

[0018] At the beginning of each query sector, all query data contained in the sector in the initial buffer are matched sequentially with the first buffer. If the X1th query matches the S-mode address and BDS code stored in the first buffer, the data corresponding to the X1st query in the sector in the initial buffer is cleared. This process continues until all query data in the sector is compared with the first buffer. Then, the remaining query data in the sector in the initial buffer is sent to the next step for dynamic sorting of the query data.

[0019] During each sector scheduling process, the query list of that sector in the initial buffer is cyclically called for encoding. During the cyclical encoding process, if the X2nd query matches the target, the data corresponding to the X2nd query in that sector in the initial buffer is cleared. When the query list of that sector in the initial buffer completes one encoding call, the remaining query data in that sector in the initial buffer is sent to the next step for dynamic sorting of query data.

[0020] Furthermore, the sequential arrangement of the N name-list queries includes:

[0021] The first query is programmed: starting from time 0, the first query is programmed, time 0 is recorded as the front boundary of the first protection zone, the corresponding query end time is recorded as the back boundary of the first protection zone, the corresponding predicted response start time is recorded as the front boundary of the second protection zone, and the corresponding predicted response end time is recorded as the back boundary of the second protection zone.

[0022] Arrange the 2nd to Nth queries so that neither the query nor the predicted response falls into the first protection zone and the second protection zone corresponding to the previous query and response, respectively.

[0023] Furthermore, the arrangement of the 2nd to Nth queries includes:

[0024] Based on the positional relationship between the second query and the second response and the first and second protection areas respectively, the end time of the second query and the predicted position of the second response are updated, that is, the rear boundary of the first protection area, the front boundary of the second protection area and the rear boundary of the second protection area are updated accordingly, while the front boundary of the first protection area remains unchanged; the predicted position corresponds to the time occupied by the response.

[0025] Further, based on the positional relationship between the second query and the second response and the first and second protection areas respectively, the end time of the second query and the predicted position of the second response are updated, that is, the rear boundary of the first protection area, the front boundary of the second protection area, and the rear boundary of the second protection area are updated accordingly, while the front boundary of the first protection area remains unchanged; the time occupied by the predicted position and the response includes:

[0026] If both the second query and the second response can be placed between the first and second protection areas, then the predicted position of the second response is placed before the second protection area corresponding to the previous query / response. The front boundary of the second protection area corresponding to the previous query / response is used as the end time of the predicted position of the second response. The end time of the second query is updated to the back boundary of the first protection area, and the start time of the predicted position of the second response is updated to the front boundary of the second protection area. The front boundary of the first protection area and the back boundary of the second protection area remain unchanged.

[0027] If only the second query can be placed between the first and second protection zones, and the predicted distance of the second response is smaller than the interval between the first and second protection zones, then the predicted position of the second response is placed after the second protection zone corresponding to the previous query / response. The rear boundary of the second protection zone corresponding to the previous query / response is used as the start time of the predicted position of the second response. The end time of the second query is updated to the rear boundary of the first protection zone, and the end time of the predicted position of the second response is updated to the rear boundary of the second protection zone. The front boundary of the first protection zone and the front boundary of the second protection zone remain unchanged.

[0028] If only the second query can be placed between the first and second protection zones, and the predicted distance of the second response is larger than the interval between the first and second protection zones, then the predicted position of the second response is placed after the second protection zone corresponding to the previous query / response. The rear boundary of the first protection zone corresponding to the previous query / response is used as the start time of the second query, the end time of the second query is updated to the rear boundary of the first protection zone, the end time of the predicted position of the second response is updated to the rear boundary of the second protection zone, and the front boundary of the first and second protection zones remains unchanged.

[0029] If neither the second query nor the second response can be placed between the first and second protection zones corresponding to the previous query and response, respectively, then the position of the second query is placed after the second protection zone corresponding to the previous query / response. The rear boundary of the second protection zone corresponding to the previous query / response is used as the start time of the second query, the end time of the second query is updated to the rear boundary of the first protection zone, the start time of the predicted position of the second response is updated to the front boundary of the second protection zone, the end time of the predicted position of the second response is updated to the rear boundary of the second protection zone, and the front boundary of the first protection zone remains unchanged.

[0030] Following the arrangement logic of the second query and the second response, the arrangement of the third to the Nth queries is completed in sequence.

[0031] Furthermore, the arrangement using a preset time slot length includes:

[0032] All are arranged using a fixed time slot length. If a name query within a sector cannot be arranged in the same time slot, it is arranged in multiple name query time slots.

[0033] Furthermore, if the name queries within a sector cannot be scheduled within the same time slot, they are arranged in multiple name query time slots, including:

[0034] The first query is used as the starting query for the second name-calling query time slot. If the end time of the predicted position of the response to the Xth query is less than T, and the end time of the predicted position of the response to the (X+1)th query is greater than T, then the first to Xth queries are assigned to the first name-calling query time slot; X is less than N; T is the query period.

[0035] The (X+1)th query is used as the starting query of the second naming query time slot. If the difference between the end time of the predicted position of the response to the (Y)th query and the start time of the (X+1)th query is less than T, and if the difference between the end time of the predicted position of the response to the (Y+1)th query and the start time of the (X+1)th query is greater than T, then the (X+1)th to (Y)th queries are assigned to the second naming query time slot; Y is greater than X and less than N.

[0036] Similarly, all queries from 1 to N are divided into slots for 1 to M name-based queries.

[0037] Furthermore, the timing for arranging the multiple point-based query time slots falls into the following two categories:

[0038] The first scenario: At the beginning of each sector, a dynamic scheduling of the name-calling time slots is required, and N queries are scheduled within M name-calling time slots for query encoding and transmission.

[0039] The second scenario: After a query encoding transmission of 1 to M name query time slots is completed within a sector, a new name query time slot dynamic arrangement is performed, and this cycle continues until the azimuth jumps to the next sector.

[0040] Because of the adoption of the above technical solution, the present invention has the following advantages:

[0041] 1. Based on the PPC establishing a linked list of S-mode name query requests and sending it to the FPGA, this invention avoids idle query slots. For S-mode name queries that have already been matched in adjacent sectors or in the current sector, at the beginning of each sector or at the start of the circular scheduling of the query linked list within the sector, the FPGA will perform real-time elimination of matched query slots and timing rearrangement of the S-mode name query information in the current sector. This achieves adaptive real-time optimization of S-mode name query slots, improving query slot utilization and target detection efficiency.

[0042] 2. The S-mode query strategy of this invention is completed collaboratively by FPGA and PPC. To address the shortcoming that the S-mode name query request information issued by PPC cannot match the real-time performance of sector scanning, based on the PPC establishing an S-mode name query request chain list in cycles and issuing it to FPGA, at the beginning of each sector or at the start of the cyclic scheduling of the query chain list within a sector, the FPGA will perform real-time elimination of time slots with matched queries and timing rearrangement of the query chain list of the current sector, thereby achieving adaptive real-time optimization of the S-mode name query time slots.

[0043] 3. This invention uses FPGA to associate queries / responses. For S-mode name-marked queries that have already been matched in adjacent sectors or in the current sector, at the beginning of each sector or at the start of the circular scheduling of the query list within a sector, the FPGA will perform real-time removal of time slots of matched queries and timing rearrangement of the S-mode name-marked query list of the current sector. This avoids idle query time slots, improves the utilization of query time slots and target detection efficiency, and reduces co-frequency radiation interference in the airspace. Attached Figure Description

[0044] To more clearly illustrate the technical solutions in the embodiments of the present invention, the accompanying drawings used in the description of the embodiments will be briefly introduced below. Obviously, the accompanying drawings described below are only some embodiments recorded in the embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings.

[0045] Figure 1 This is a schematic diagram illustrating the timing of the S-mode name-call query time slot arrangement in an embodiment of the present invention.

[0046] Figure 2 This is a schematic diagram of the S-mode name-call query BDS scatter sorting according to an embodiment of the present invention;

[0047] Figure 3 This is a schematic diagram of query / response timing protection in the S-mode point-of-slot scheduling according to an embodiment of the present invention;

[0048] Figure 4 This is a schematic diagram of the timing arrangement of the first query in the S-mode name-calling query slot arrangement of an embodiment of the present invention;

[0049] Figure 5 This is a schematic diagram of the timing arrangement of the second to Nth queries in the S-mode name-calling time slot arrangement according to an embodiment of the present invention;

[0050] Figure 6 This is a schematic diagram of the arrangement of multiple time slots (1 to M time slots) for the S-mode point-of-sight query in an embodiment of the present invention. Detailed Implementation

[0051] The present invention will be further described in conjunction with the accompanying drawings and embodiments. The described embodiments are only a part of the embodiments of the present invention, and not all of them. All other embodiments obtained by those skilled in the art should fall within the protection scope of the present invention.

[0052] This invention provides an embodiment of an adaptive scheduling method for secondary radar S-mode time slot rearrangement based on improved detection efficiency, which includes the following steps: obtaining demand information for name query, deduplication of name query, sorting name query by distance, sorting name query BDS code by distribution, and arranging name query time slots.

[0053] S1. Obtaining required information by calling out names:

[0054] The PPC (Performance Optimization With Enhanced RISC – Performance Computing) performs integrated time slot planning for S-mode target name-calling for each round of capture. It establishes a cached linked list of S-mode query requests in sectors and sends the S-mode query request information to the FPGA in advance in sectors at the beginning of each round. The FPGA establishes an initial cache area to store the information, including S-mode query data, S-mode address, BDS code number, target prediction distance (converted to clock cycles according to 1us*40MHz_clk=3.75m, plus 128us*40MHz response delay), etc.

[0055] S2, Deduplication by calling out names:

[0056] S21. Match target cache:

[0057] The FPGA allocates a first buffer and a second buffer. The first buffer is used to store the S-mode address + BDS code of the query that has matched the target response in the previous sector, and the second buffer is used to store the S-mode address + BDS code of the query that has matched the target response in the current sector.

[0058] If a query in the current sector newly matches a target, or if a query in the current sector is found to have already matched a target in the previous sector (if it is a selective call from a sidelobe within the current sector or the previous sector, it is not cached), and the S-mode address + BDS code of the query has not yet been stored in the second buffer, then the S-mode address + BDS code of the query is written to the second buffer, and the data corresponding to the query in the current sector contained in the initial buffer is cleared.

[0059] When querying sector switching, the value of the second buffer is assigned to the first buffer, and then the second buffer is cleared.

[0060] S22, Query for deduplication filtering:

[0061] At the beginning of each query sector, all query data contained in that sector in the initial buffer are retrieved and matched sequentially with the first buffer. If the X1th query matches the S-mode address + BDS code stored in the first buffer, the data corresponding to the X1st query in that sector in the initial buffer is cleared. After the above comparison process is completed, the remaining query data in that sector in the initial buffer is sent out for the next step of dynamic sorting of query data.

[0062] During each sector scheduling process, the query list of that sector in the initial buffer is cyclically called and encoded. If the X2nd query matches the target, the data corresponding to the X2nd query in that sector in the initial buffer is cleared. Whenever the query list of that sector in the initial buffer completes one call encoding, the remaining query data in that sector in the initial buffer is sent out to the next step for dynamic sorting of query data.

[0063] S3, Name-based query distance sorting: The FPGA sorts the query data in each sector according to the predicted distance of the target from farthest to nearest, and caches the sorted data;

[0064] S4. Calling out names and querying BDS codes in a scattered sorting manner:

[0065] For the case where there are multiple query queries for the same target within a single sector (with different BDS codes, BDS codes 1 to J), the following two points are considered:

[0066] (1) If the queries for a single target are too densely arranged, it may trigger the target's response rate limit, causing some queries to go unanswered and thus reducing query efficiency.

[0067] (2) If the interrogation of a single target is too dense, all responses may be concentrated at the edge of the beam, resulting in a decrease in angle measurement performance.

[0068] Therefore, multiple point name queries for a single target (with different BDS codes, BDS codes 1 to J) need to be distributed in a distributed manner, such as... Figure 2 As shown, after completing the previous step of arranging the query data by distance (from far to near), first arrange the BDS codes 1 of all targets in this sector, then arrange the targets with BDS codes 2, and then arrange all the BDS codes 1 to BDS codes J of all targets in sequence.

[0069] S5. Arrangement of Inquiry Slots: Based on the above sorting, the inquiries are arranged in sequence as follows:

[0070] like Figure 3 As shown, in order to avoid overlap between interrogation codes / response signals and different response signals, a protection time of 15us (based on the prediction deviation requirement of the target distance in the next lap, 15us * 0.15km = 2.25km) is reserved before and after each interrogation and predicted response position;

[0071] Arrangement of the first query (Query 1):

[0072] like Figure 4As shown, the first query is arranged starting from time 0. Time 0 is recorded as the front boundary of the first protection zone, the corresponding query end time is recorded as the back boundary of the first protection zone, the corresponding prediction response start time is recorded as the front boundary of the second protection zone, and the corresponding prediction response end time is recorded as the back boundary of the second protection zone.

[0073] Arrange the queries from the 2nd to the Nth:

[0074] The requirement is that neither the inquiry nor the predicted response should fall into the first or second protection zone described in the previous clause;

[0075] like Figure 5 As shown, for case 1, if both the second query (query 2) and the second response (response 2) can be placed between the first protection area and the second protection area, then the predicted position of the second response is placed before the second protection area in the previous step, the front boundary of the second protection area in the previous step is used as the end time of the predicted position of the second response, the end time of the second query is updated to the back boundary of the first protection area, the end time of the predicted position of the second response is updated to the back boundary of the second protection area, and the front boundary of the first protection area and the back boundary of the second protection area remain unchanged.

[0076] like Figure 5 As shown, for case 2, if only the second query can be placed between the first and second protection areas, and the predicted distance of the second response is smaller than the interval between the first and second protection areas, then the predicted position of the second response is placed after the second protection area in the previous step, the rear boundary of the second protection area corresponding to the previous step is used as the start time of the predicted position of the second response, the end time of the second query is updated to the rear boundary of the first protection area, the end time of the predicted position of the second response is updated to the rear boundary of the second protection area, and the front boundary of the first and second protection areas remains unchanged.

[0077] like Figure 5 As shown, for case 3, if only the second query can be placed between the first and second protection areas, and the predicted distance of the second response is larger than the interval between the first and second protection areas, then the predicted position of the second response is placed after the second protection area in the previous step, the rear boundary of the first protection area corresponding to the previous step is used as the start time of the second query, the end time of the second query is updated to the rear boundary of the first protection area, the end time of the predicted position of the second response is updated to the rear boundary of the second protection area, and the front boundary of the first and second protection areas remains unchanged.

[0078] like Figure 5As shown, for case 4, if neither the second query nor the second response can be placed between the first and second protection areas of the previous step, then the position of the second query is placed after the second protection area of ​​the previous step. The rear boundary of the corresponding second protection area of ​​the previous step is used as the start time of the second query, the end time of the second query is updated to the rear boundary of the first protection area, the start time of the predicted position of the second response is updated to the front boundary of the second protection area, the end time of the predicted position of the second response is updated to the rear boundary of the second protection area, and the front boundary of the first protection area remains unchanged.

[0079] Following the arrangement logic of the second query, the arrangement of queries from the third to the Nth query is completed in sequence.

[0080] S6. Time-slot orchestration processing:

[0081] To comprehensively consider the query efficiency of both all-call and roll call, a fixed time slot length is used for scheduling. If a roll call query within a sector cannot be accommodated in a single time slot, it needs to be scheduled across multiple roll call query time slots. The specific scheduling rules are as follows:

[0082] a. such as Figure 6 As shown in the upper half, the first query is used as the starting query of the second name-calling query time slot. If the end time of the predicted position of the response to the Xth query is less than T, and the end time of the predicted position of the response to the (X+1)th query is greater than T, then the first to Xth queries are assigned to the first name-calling query time slot; T is the query period.

[0083] b. Figure 6 As shown in the lower half, the (X+1)th query is taken as the starting query of the second point-of-slot query time slot. If the difference between the end time of the predicted position of the response to the Yth query and the start time of the (X+1)th query is less than T, and if the difference between the end time of the predicted position of the response to the Y+1th query and the start time of the (X+1)th query is greater than T, then the (X+1)th to (Y)th queries are assigned to the second point-of-slot query time slot.

[0084] c. Similarly, all queries from 1 to N can be divided into 1 to M slots for point-based queries.

[0085] Explanation of technical terms:

[0086] S-mode address: A pre-assigned 24-bit address code for each target aircraft, with no repetition;

[0087] BDS code: An 8-bit type code used to distinguish different types of queries targeting the same aircraft.

[0088] S-mode all-call interrogation: Interrogation is performed simultaneously on all target aircraft. When a target aircraft receives the interrogation, it will respond accordingly without needing to match the S-mode address.

[0089] S-mode named inquiry: An inquiry conducted individually for each target aircraft. The target aircraft will only respond after receiving the inquiry and matching the S-mode address in the inquiry.

[0090] In this embodiment, the timing of S-mode querying of time slot scheduling falls into the following two categories: Figure 1 As shown:

[0091] At the beginning of each sector, a dynamic scheduling of the name-calling time slots is required (N queries are scheduled within M name-calling time slots for query encoding and transmission);

[0092] After a query encoding transmission of 1 to M name query slots is completed within a sector (the start time of the circular scheduling of the query list within the sector), a dynamic scheduling of name query slots needs to be performed again. This cycle continues until the position jumps to the next sector.

[0093] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention and not to limit it. Although the present invention has been described in detail with reference to the above embodiments, those skilled in the art should understand that modifications or equivalent substitutions can still be made to the specific implementation of the present invention. Any modifications or equivalent substitutions that do not depart from the spirit and scope of the present invention should be covered within the protection scope of the claims of the present invention.

Claims

1. An adaptive scheduling method for secondary radar S-mode time slot rearrangement based on improved detection efficiency, characterized in that, include: Step 1: The PPC performs integrated time slot planning for S-mode target name-calling for each round of captured S-mode targets, establishes an S-mode query request list in sector units, and sends the S-mode query request list to the FPGA in sector units at the beginning of each round. The FPGA establishes an initial buffer to store the S-mode query request list. The S-mode query request information in the S-mode query request list includes S-mode query data, S-mode address, BDS code number, and target prediction distance. Step 2: At the start of each sector or at the start of the circular scheduling of the query list within a sector, deduplication is performed on the data of the sectors in the initial buffer. The FPGA is used to remove the time slots of matched queries and rearrange the timing sequence of the query list of the current sector in real time. Step 2 includes: Step 21: The FPGA allocates a first buffer and a second buffer. Based on whether the current sector query matches the target and whether the second buffer stores the S-mode address and BDS code of the query, it determines whether to write the S-mode address and BDS code of the query into the second buffer. At the same time, the data corresponding to the query contained in the current sector in the initial buffer is cleared. Step 22: At the beginning of each query sector, all query data contained in that sector in the initial buffer are sequentially matched with the first buffer; during the scheduling of each sector, the query list of that sector in the initial buffer is cyclically called for encoding, and target matching is determined for each query during this process, and the data corresponding to queries with matched targets contained in that sector in the initial buffer is cleared; after the query list of that sector in the initial buffer has completed one call encoding, the remaining query data of that sector in the initial buffer is sent out for the next step of dynamic sorting of query data; Step 23: The FPGA sorts the query data in each sector according to the predicted distance of the target, and caches the sorted data; Step 24: When there are J name queries for the same target in a single sector, sort the J name queries corresponding to the same target in a distributed manner, and sort the name queries of all targets in a single sector in turn. Step 25: Sequentially arrange the N point-name queries, reserving the required time before and after each query and predicted response position to ensure that there is no overlap between query codes / response signals and different response signals; use a preset time slot length for arrangement.

2. The method according to claim 1, characterized in that, Step 21 includes: If a query in the current sector newly matches a target, or if a query in the current sector has already matched a target in the previous sector, and the S-mode address and BDS code of the query are not yet stored in the second buffer, then the S-mode address and BDS code of the query are written to the second buffer, and the data corresponding to the query in the current sector contained in the initial buffer are cleared; the first buffer is used to store the S-mode address and BDS code of queries that have already matched a target response in the previous sector, and the second buffer is used to store the S-mode address and BDS code of queries that have already matched a target response in the current sector; When querying sector switching, the value of the second buffer is assigned to the first buffer, and then the second buffer is cleared.

3. The method according to claim 1, characterized in that, Step 22 includes: At the beginning of each query sector, all query data contained in the query sector in the initial buffer are matched sequentially with the first buffer. If the X1th query matches the S-mode address and BDS code stored in the first buffer, the data corresponding to the X1th query in the sector in the initial buffer is cleared. This process continues until all query data in the sector is compared with the first buffer. Then, the remaining query data in the sector in the initial buffer is sent to the next step for dynamic sorting of the query data. During each sector scheduling process, the query list of that sector in the initial buffer is cyclically called for encoding. During the cyclical encoding process, if the X2nd query matches the target, the data corresponding to the X2nd query in that sector in the initial buffer is cleared. When the query list of that sector in the initial buffer completes one encoding call, the remaining query data in that sector in the initial buffer is sent to the next step for dynamic sorting of query data.

4. The method according to claim 1, characterized in that, The sequential arrangement of N name-calling queries includes: The first query is programmed: The first query is programmed starting from time 0. Time 0 is recorded as the front boundary of the first protection zone, the corresponding query end time is recorded as the back boundary of the first protection zone, the corresponding predicted response start time is recorded as the front boundary of the second protection zone, and the corresponding predicted response end time is recorded as the back boundary of the second protection zone. Arrange the 2nd to Nth queries: ensure that the position of the query and the predicted response corresponding to each named query does not fall into the first protection zone and the second protection zone.

5. The method according to claim 4, characterized in that, The arrangement of the 2nd to Nth queries includes: Based on the positional relationship between the second query and the second response and the first and second protection areas respectively, the end time of the second query and the predicted position of the second response are updated, that is, the rear boundary of the first protection area, the front boundary of the second protection area and the rear boundary of the second protection area are updated accordingly, while the front boundary of the first protection area remains unchanged; the predicted position corresponds to the time occupied by the response.

6. The method according to claim 5, characterized in that, The end time of the second query and the predicted position of the second response are updated according to the positional relationship between the second query and the second response and the first and second protection areas, respectively. That is, the rear boundary of the first protection area, the front boundary of the second protection area and the rear boundary of the second protection area are updated accordingly, while the front boundary of the first protection area remains unchanged. The predicted response time for the location includes: If both the second query and the second response can be placed between the first and second protection areas, then the predicted position of the second response is placed before the second protection area corresponding to the previous query / response. The front boundary of the second protection area corresponding to the previous query / response is used as the end time of the predicted position of the second response. The end time of the second query is updated to the back boundary of the first protection area, and the start time of the predicted position of the second response is updated to the front boundary of the second protection area. The front boundary of the first protection area and the back boundary of the second protection area remain unchanged. If only the second query can be placed between the first and second protection zones, and the predicted distance of the second response is smaller than the interval between the first and second protection zones, then the predicted position of the second response is placed after the second protection zone corresponding to the previous query / response. The rear boundary of the second protection zone corresponding to the previous query / response is used as the start time of the predicted position of the second response. The end time of the second query is updated to the rear boundary of the first protection zone, and the end time of the predicted position of the second response is updated to the rear boundary of the second protection zone. The front boundary of the first protection zone and the front boundary of the second protection zone remain unchanged. If only the second query can be placed between the first and second protection zones, and the predicted distance of the second response is larger than the interval between the first and second protection zones, then the predicted position of the second response is placed after the second protection zone corresponding to the previous query / response. The rear boundary of the first protection zone corresponding to the previous query / response is used as the start time of the second query, the end time of the second query is updated to the rear boundary of the first protection zone, the end time of the predicted position of the second response is updated to the rear boundary of the second protection zone, and the front boundary of the first and second protection zones remains unchanged. If neither the second query nor the second response can be placed between the first and second protection zones corresponding to the previous query and response, respectively, then the position of the second query is placed after the second protection zone corresponding to the previous query / response. The rear boundary of the second protection zone corresponding to the previous query / response is used as the start time of the second query, the end time of the second query is updated to the rear boundary of the first protection zone, the start time of the predicted position of the second response is updated to the front boundary of the second protection zone, the end time of the predicted position of the second response is updated to the rear boundary of the second protection zone, and the front boundary of the first protection zone remains unchanged. Following the arrangement logic of the second query and the second response, the arrangement of the third to the Nth queries is completed in sequence.

7. The method according to claim 1, characterized in that, The arrangement using a preset time slot length includes: All are arranged using a fixed time slot length. If a name query within a sector cannot be arranged in the same time slot, it is arranged in multiple name query time slots.

8. The method according to claim 7, characterized in that, If the name queries within a sector cannot be scheduled in the same time slot, they will be arranged in multiple name query time slots, including: The first query is used as the starting query for the second name-calling query time slot. If the end time of the predicted position of the response to the Xth query is less than T, and the end time of the predicted position of the response to the (X+1)th query is greater than T, then the first to Xth queries are assigned to the first name-calling query time slot; X is less than N; T is the query period. The (X+1)th query is used as the starting query of the second naming query time slot. If the difference between the end time of the predicted position of the response to the (Y)th query and the start time of the (X+1)th query is less than T, and if the difference between the end time of the predicted position of the response to the (Y+1)th query and the start time of the (X+1)th query is greater than T, then the (X+1)th to (Y)th queries are assigned to the second naming query time slot; Y is greater than X and less than N. Similarly, all queries from 1 to N are divided into slots for 1 to M name-based queries.

9. The method according to claim 7 or 8, characterized in that, The timing for arranging multiple point-based query slots can be divided into the following two cases: The first scenario: At the beginning of each sector, a dynamic scheduling of the name-calling time slots is required, and N queries are scheduled within M name-calling time slots for query encoding and transmission. The second scenario: After a query encoding transmission of 1 to M name query time slots is completed within a sector, a new name query time slot dynamic arrangement is performed, and this cycle continues until the azimuth jumps to the next sector.

Images