Radio frequency gate identification method and system based on FSCT algorithm

Abstract

The invention relates to the technical field of radio frequency gate identification, in particular to a radio frequency gate identification method and system based on an FSCT algorithm, and the method comprises the steps that a reader sends a Query (L) command to a tag to obtain the number of time slots randomly selected by the tag; the reader distinguishes different time slot categories according to the number of label responses in the time slot i; when the time slot i is greater than L-1, the reader identifies the remaining tags and sends a new command; the label judges whether to respond or not according to the time slot number of the label and decides whether to send the ID value of the label; judging whether the tag IDs are collided or not through the reader; and all the labels are completely identified by repeatedly executing the identification step. The method and the device have the beneficial effects that through the FSCT algorithm combining the ALOHA algorithm and the collision tree algorithm, the technical breakthrough of the radio frequency door identification method and the device in the aspects of improving the identification efficiency, enhancing the anti-interference capability, ensuring the data accuracy and simplifying the data management is realized, so that the rapid, accurate and stable RFID tag identification is realized in an intelligent warehousing system.

Description

Technical Field

[0001] The present invention relates to the technical field of radio frequency door identification, and in particular to a radio frequency door identification method and system based on FSCT algorithm. Background Art

[0002] In recent years, with the development of 5G communications, enterprises have been undergoing a series of digital transformations, the most important of which is asset management. A series of equipment for asset management has also appeared on the market. Among them, radio frequency channel doors use RFID technology to achieve warehouse entry and exit management, which plays a vital role.

[0003] The core of radio frequency door products is RFID identification technology. The reader manages the entry and exit of goods by reading and entering the goods tags. The most important thing is the coordination between software and hardware. A good hardware environment will greatly reduce the fault tolerance of the software, and the excellent filtering algorithm of the software will reduce the simplicity of operation and improve the accuracy of information.

[0004] In the intelligent warehousing system, there are a large number of objects waiting to be stored every day, which may be single-phase electricity meters, three-phase electricity meters, smart terminals or some electricity meter modules. In order to achieve the purpose of intelligent warehousing, these objects can obtain the designated storage location object information at any time. After entering the warehouse, their locations need to be stored in the system. Therefore, it is necessary to bind the box table in the RF gate special machine, and establish the connection between the box and the objects to be stored in the database. The RF gate needs to identify the RFID tags carried by the objects to be stored to obtain their information, so as to establish a relationship with the turnover box. Summary of the invention

[0005] In view of the above problems or problems existing in the prior art, the present invention is proposed.

[0006] Therefore, the object of the present invention is to provide a radio frequency gate identification method based on the FSCT algorithm, which can improve the identification efficiency and accuracy and enhance the stability and reliability of the system.

[0007] To solve the above technical problems, the present invention provides the following technical solutions: a radio frequency gate identification method based on the FSCT algorithm, which includes a reader sending a Query (L) command to a tag to obtain the number of time slots randomly selected by the tag;

[0008] The reader distinguishes different time slot categories based on the number of tag responses in time slot i;

[0009] When time slot i is greater than L-1, the reader identifies the remaining tags and sends a new command;

[0010] The tag determines whether to respond based on its own time slot number and decides whether to send its own ID value;

[0011] Use the reader to determine whether the tag IDs collide;

[0012] By repeating the recognition steps, all tags are fully recognized.

[0013] As a preferred solution of the radio frequency gate identification method based on the FSCT algorithm of the present invention, wherein: Query (L) command, L is the number of time slots in a frame, after receiving the command, the tag randomly selects a time slot number from 0 to L-1 as its own time slot number.

[0014] As a preferred solution of the radio frequency gate identification method based on the FSCT algorithm of the present invention, different time slot categories include successful time slots, idle time slots, and collision time slots.

[0015] As a preferred solution of the radio frequency gate identification method based on the FSCT algorithm of the present invention, the new command is a Query (prefix, i) command, i is the number of time slots in the collision time slot stack, and prefix is ​​the collision prefix.

[0016] As a preferred solution of the radio frequency door identification method based on the FSCT algorithm of the present invention, wherein: ID collision means that after the reader receives the ID value of the tag, multiple tags send the same ID value;

[0017] If there is no ID collision, the tag is successfully identified; if there is an ID collision, the reader records the data before the collision bit and generates a new collision prefix for the next round of identification attempts.

[0018] In order to solve the above technical problems, the present invention also provides the following technical solutions: a radio frequency door recognition system based on the FSCT algorithm, which includes a recognition unit, including a structural support component, a recognition component arranged inside the support component, a visual auxiliary component arranged inside the support component, and a door control operation component;

[0019] The auxiliary control unit includes a transmission component and a data processing component.

[0020] As a preferred solution of the radio frequency door identification system based on the FSCT algorithm of the present invention, wherein: the structural support component includes an equipment profile frame, and an inner box shell arranged on the inner side of the equipment profile frame; the identification component includes an antenna bracket arranged on the top of the inner side of the inner box shell, and an ultra-high frequency antenna fixedly connected to the antenna bracket; the visual auxiliary component includes a camera bracket arranged on the inner side of the inner box shell, and a camera fixedly connected to the camera bracket.

[0021] As a preferred solution of the radio frequency door identification system based on the FSCT algorithm of the present invention, the door control operation component includes a cylinder support arranged on the inner side of the inner box shell, a lifting cylinder fixedly connected to the cylinder support, sliding guide rails arranged on both sides of the inner side of the inner box shell, rollers arranged on the inner side of the sliding guide rails, a lifting door hinged to the rollers, and inspection doors arranged on both sides of the inner box shell.

[0022] As a preferred solution of the data leakage prevention system of the present invention, the transmission component includes a roller conveyor line arranged on the lower side of the inner box shell, a photoelectric bracket fixedly connected to one side of the roller conveyor line, and a diffuse reflection photoelectric fixedly connected to the photoelectric bracket.

[0023] As a preferred solution of the data leakage prevention system of the present invention, the data processing component includes an RFID reader / writer used in conjunction with an overfrequency antenna, and an industrial computer arranged outside the equipment profile frame.

[0024] Beneficial effects of the present invention: In terms of improving recognition efficiency, the present invention can quickly process a large amount of RFID tag data and significantly reduce recognition delay; in terms of enhancing anti-interference ability, it effectively reduces the impact of environmental factors such as light, sound, temperature, etc. on the recognition process; in terms of ensuring data accuracy, through accurate tag recognition and binding, the risk of misidentification or missed recognition is reduced; in terms of simplifying data management, centralized management and real-time monitoring of data are achieved, and the efficiency and accuracy of data management are improved. The implementation of these technical solutions makes the application of radio frequency door recognition system in intelligent warehousing system more efficient and stable, while improving user experience. BRIEF DESCRIPTION OF THE DRAWINGS

[0025] In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the following briefly introduces the drawings required for describing the embodiments. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work. Among them:

[0026] Figure 1 The figure is a flow chart of the FSCT algorithm of the radio frequency gate identification method based on the FSCT algorithm.

[0027] Figure 2 This is the overall schematic diagram of the floor-standing RF door structure of the RF door recognition system based on the FSCT algorithm.

[0028] Figure 3 This is a schematic diagram of the structure of the floor-standing RF door inner box of the RF door recognition system based on the FSCT algorithm.

[0029] Figure 4This is a schematic diagram of the internal structure of the floor-standing RF door inner box of the RF door recognition system based on the FSCT algorithm.

[0030] Figure 5 This is a partial structural diagram of the gate control operation components of the radio frequency gate recognition system based on the FSCT algorithm.

[0031] Figure 6 A schematic diagram showing the throughput comparison of the RF gate identification method based on the FSCT algorithm. DETAILED DESCRIPTION

[0032] In order to make the above-mentioned objects, features and advantages of the present invention more obvious and easy to understand, the specific implementation methods of the present invention are described in detail below in conjunction with the accompanying drawings.

[0033] In the following description, many specific details are set forth to facilitate a full understanding of the present invention, but the present invention may also be implemented in other ways different from those described herein, and those skilled in the art may make similar generalizations without violating the connotation of the present invention. Therefore, the present invention is not limited to the specific embodiments disclosed below.

[0034] Secondly, the term "one embodiment" or "embodiment" as used herein refers to a specific feature, structure, or characteristic that may be included in at least one implementation of the present invention. The term "in one embodiment" that appears in different places in this specification does not necessarily refer to the same embodiment, nor does it refer to a separate or selective embodiment that is mutually exclusive with other embodiments.

[0035] Example 1

[0036] Reference Figure 1 , which is the first embodiment of the present invention, provides a radio frequency gate identification method based on the FSCT algorithm, which can improve the identification efficiency and accuracy and enhance the stability and reliability of the system.

[0037] Specifically, the reader obtains the number of time slots randomly selected by the tag by sending a Query (L) command to the tag;

[0038] The reader distinguishes different time slot categories based on the number of tag responses in time slot i;

[0039] When time slot i is greater than L-1, the reader identifies the remaining tags and sends a new command;

[0040] The tag determines whether to respond based on its own time slot number and decides whether to send its own ID value;

[0041] Use the reader to determine whether the tag IDs collide;

[0042] By repeating the recognition steps, all tags are fully recognized.

[0043] It should be noted that each tag determines whether to send an ID value in the time slot according to the time slot number selected by itself. If the time slot matches the time slot selected by the tag, the tag sends its ID value; if it does not match, the tag remains silent.

[0044] Furthermore, a Query (L) command, L is the number of time slots in a frame. After receiving the command, the tag randomly selects a time slot number from 0 to L-1 as its own time slot number.

[0045] It should be noted that Query(L) refers to the frame length L.

[0046] Furthermore, different time slot categories include successful time slots, idle time slots, and collision time slots.

[0047] It should be noted that the reader monitors the tag response in each time slot i. If only one tag responds in a time slot, the time slot is a successful time slot; if no tag responds in a time slot, the time slot is an idle time slot; if multiple tags respond simultaneously in a time slot, the time slot is a collision time slot;

[0048] If the current time slot is a successful time slot, the tag is successfully identified, the tag is silent, and enters the next time slot identification; if the current time slot is an idle time slot, enter the next time slot identification; if the current time slot is a collision time slot, the reader records the time slot i and the collision prefix prefix to form a (key, value) key-value pair and pushes it into the collision time slot stack.

[0049] Furthermore, the new command is the Query (prefix, i) command, i is the number of time slots read in the collision time slot stack, and prefix is ​​the collision prefix. Specifically, the reader identifies the remaining tags when the time slot i is greater than L-1, and sends a new Query command by reading the information in the collision time slot stack. After all the preset time slots have passed, if there are still unidentified tags (that is, in the collision time slot), the reader will take out the recorded time slot number i and the collision prefix prefix from the collision time slot stack, and send a new Query (prefix, i) command to continue the identification process.

[0050] Furthermore, ID collision means that after the reader receives the tag's ID value, multiple tags send the same ID value;

[0051] If there is no ID collision, the tag is successfully identified; if there is an ID collision, the reader records the data before the collision bit and generates a new collision prefix for the next round of identification attempts.

[0052] Specifically, the reader sends a Query (L) command containing a frame length L to the RFID tag. After receiving the command, the tag randomly selects a time slot number from 0 to L-1 as its response time slot to prepare for the subsequent identification process. Further, the reader monitors the response of the tag in each time slot i, distinguishing between successful time slots, idle time slots and collision time slots. If only one tag responds in a time slot, the time slot is a successful time slot; if no tag responds in a time slot, the time slot is an idle time slot; if multiple tags respond simultaneously in a time slot, the time slot is a collision time slot. After all the preset time slots have passed, if there are still unidentified tags (i.e. in the collision time slot), the reader will take out the recorded time slot number i and collision prefix prefix from the collision time slot stack, and send a new Query (prefix, i) command to continue the identification process. Each tag determines whether to send an ID value in the time slot based on the time slot number selected by itself. If the time slot matches the time slot selected by the tag, the tag sends its ID value; if it does not match, the tag remains silent. After the reader receives the ID value of the tag, it determines whether multiple tags have sent the same ID value (i.e., a collision occurs). If there is no collision, the tag is successfully identified; if there is a collision, the reader records the data before the collision bit and generates a new collision prefix for the next round of identification attempts. The overall identification process requires multiple rounds of iterations until there are no more time slots and prefixes to be processed in the collision time slot stack. At this point, it can be considered that all tags have been successfully identified, ensuring the integrity and accuracy of the identification process.

[0053] In summary, the present invention can quickly process a large amount of RFID tag data and significantly reduce the recognition delay in terms of improving recognition efficiency; effectively reduce the impact of environmental factors such as light, sound, temperature, etc. on the recognition process in terms of enhancing anti-interference ability; reduce the risk of misidentification or missed recognition through accurate tag recognition and binding in terms of ensuring data accuracy; and realize centralized management and real-time monitoring of data in terms of simplifying data management, thereby improving the efficiency and accuracy of data management. The implementation of these technical solutions makes the application of radio frequency door recognition system in intelligent warehousing system more efficient and stable, while improving the user experience.

[0054] Example 2

[0055] Reference Figure 2 to Figure 5 , which is the second embodiment of the present invention, provides a radio frequency door recognition system based on the FSCT algorithm, which can improve recognition efficiency and accuracy and enhance the stability and reliability of the system.

[0056] Specifically, the identification unit 100 includes a structural support component 101, an identification component 102 disposed inside the support component, a visual aid component 103 disposed inside the support component, and a door control operation component 104;

[0057] The auxiliary control unit 200 includes a transmission component 201 and a data processing component 202 .

[0058] Furthermore, the structural support component 101 includes an equipment profile frame 101a, and an inner box shell 101b arranged on the inner side of the equipment profile frame 101a; the identification component 102 includes an antenna bracket 102a arranged on the top of the inner side of the inner box shell 101b, and an ultra-high frequency antenna 102b fixedly connected to the antenna bracket 102a; the visual auxiliary component 103 includes a camera 103b bracket 103a arranged on the inner side of the inner box shell 101b, and a camera 103b fixedly connected to the camera 103b bracket 103a.

[0059] It should be noted that the equipment profile frame 101a serves as the basic structure of the entire device, is located on the periphery of the device, and provides support and installation platform for all internal components; the UHF antenna 102b is fixed on the top of the inner box shell 101b through the antenna bracket 102a, and is used to cover the entire inner box area for sending and receiving RFID signals; the camera 103b is used to assist in image recognition and quantity verification.

[0060] Furthermore, the door control operation component 104 includes a cylinder support 104a arranged on the inner side of the inner box shell 101b, a lifting cylinder 104b fixedly connected to the cylinder support 104a, a sliding guide rail 104c arranged on both sides of the inner side of the inner box shell 101b, a roller 104d arranged on the inner side of the sliding guide rail 104c, a lifting door 104e hinged to the roller 104d, and an inspection door 104f arranged on both sides of the inner box shell 101b.

[0061] It should be noted that the lifting cylinder 104b is connected to the lifting door 104e through the cylinder connecting plate, and is used to control the lifting door 104e to move up and down along the sliding guide rail 104c;

[0062] Furthermore, the transmission component 201 includes a roller conveyor line 201a arranged on the lower side of the inner box shell 101b, a photoelectric bracket 201b fixedly connected to one side of the roller conveyor line 201a, and a diffuse reflection photoelectric 201c fixedly connected to the photoelectric bracket 201b.

[0063] Furthermore, the data processing component 202 includes an RFID reader 202a used in conjunction with an over-frequency antenna, and an industrial computer 202b disposed outside the equipment profile frame 101a.

[0064] It should be noted that the roller conveyor line 201a is used to convey turnover boxes with RFID tags into the identification area; the industrial computer 202b is usually installed on the outside of the equipment profile frame 101a, and is connected to components such as the RFID reader 202a and camera 103b of the inner box unit through cables for data processing and control.

[0065] The operating principle of this system is as follows: when the turnover box with the energy meter is transported on the roller conveyor line 201a, the lifting cylinder 104b drives the lifting door 104e to rise, and the lifting door 104e slides open along the sliding guide rail 104c through the roller 104d, so that the turnover box with the energy meter enters the box; when the turnover box with the energy meter enters the box, the diffuse reflection photoelectric 201c scans the turnover box, and the roller conveyor line 201a stops rotating at this time, and the lifting cylinder 104b also drives the lifting door 104e to open. The lifting door 104e falls to form a certain enclosed space. Further, the RFID reader 202a and the UHF antenna 102b identify and read the model and information of the turnover box, identify the read electricity meter information, and further upload the information of the two to the control terminal through the reader. When the data is completely uploaded, the control terminal issues a release command, the lifting cylinder 104b lifts the lifting door 104e, and the roller line transports the turnover box, waiting for the arrival of the next turnover box.

[0066] It should be noted that when the turnover box reaches the identification area of ​​the RFID reader 202a, the tags are in a static environment, that is, the number no longer changes during the identification process. At this time, the main working process of the reader is as follows, where the frame length L needs to be manually set according to the number of tags in the turnover box. The frame length affects the efficiency of algorithm recognition. The length of L is a power of 2, as close as possible to the tag tree to be identified.

[0067] In summary, the present invention can quickly process a large amount of RFID tag data and significantly reduce the recognition delay in terms of improving recognition efficiency; effectively reduce the impact of environmental factors such as light, sound, temperature, etc. on the recognition process in terms of enhancing anti-interference ability; reduce the risk of misidentification or missed recognition through accurate tag recognition and binding in terms of ensuring data accuracy; and realize centralized management and real-time monitoring of data in terms of simplifying data management, thereby improving the efficiency and accuracy of data management. The implementation of these technical solutions makes the application of radio frequency door recognition system in intelligent warehousing system more efficient and stable, while improving the user experience.

[0068] Example 3

[0069] like Figure 6 As shown, it is the third embodiment of the present invention, which provides a radio frequency gate identification method based on the FSCT algorithm, which can improve the identification efficiency and accuracy, and enhance the stability and reliability of the system.

[0070] The recognition process of the FSCT algorithm combines the processes of the ALOHA algorithm and the collision tree algorithm, so its total number of time slots needs to consider two parts. In the ALOHA algorithm, the frame length N is a constant, so the total number of time slots spent is the sum of the total number of time slots in the collision tree processing stage and the frame length N.

[0071] Assuming that the number of frame time slots is N, the number of tags to be identified is n, and the probability of identifying successful time slots, idle time slots and collision time slots is divided into tables, then the probability of r tags selecting the same time slot in a frame is:

[0072]

[0073] When the tag is successfully read, it is a successful time slot, and its probability is:

[0074]

[0075] When there is no tag in the time slot, it is an idle time slot, and its probability is:

[0076]

[0077] When there are multiple tags in a time slot, it is a collision time slot, and its probability is:

[0078]

[0079] Then the number of tags that can be successfully identified in one frame is:

[0080]

[0081] The number of idle time slots in one frame is:

[0082]

[0083] The number of collision time slots in one frame is:

[0084] A C =NP c =NA s -A I

[0085] In the process of CT tree processing, the total number of tags to be identified M is the total number of tags minus the number of tags successfully identified by the ALOHA algorithm:

[0086] M=nA s

[0087] In a non-empty collision tree, n0 is the label, i.e., the leaf node, n2 is the intermediate node, and X is the total number of nodes in the collision tree, then:

[0088] X=n0+n2

[0089] Due to the nature of the full binary tree

[0090] n0=n2+1#(12)

[0091] From the above formula, we can get:

[0092] X=2n0-1

[0093] At this time, X is:

[0094] X=2(nA S )-1

[0095] At the same time, since the labels in each collision time slot are split according to the prefix of the collision time slot after the FSA processing is completed, X needs to be subtracted from the number of time slots with the collision time slot as the leaf node:

[0096] X=2(nA S )-1-(2A c -1)=2n-2A s -2A c

[0097] Therefore, the total number of time slots for the tag is:

[0098] T FSCT (n) = X + N = 2n - 2A s -2A c +A C +A s +A i =2n+A i -A s -A c

[0099] In RFID readers, throughput is a key factor in determining system performance. The higher the throughput, the lower the system energy consumption and the higher the performance. Throughput is the ratio of the total number of tags to be identified, n, to the total time slots spent by the system in the process of identifying these tags. We use to represent it, and the system efficiency is:

[0100]

[0101] In order to test the efficiency and delay of the FSCT algorithm, the present invention simulates the CT, FAS, and FSCT algorithms using JAVA language and draws graphs using the MATLAB platform. The following table shows the simulation parameters:

[0102] parameter Value Number of readers 1 The number of tags to be identified [0,500] Number of simulations per step 1000 Tag ID length 96 Growth step 10

[0103] Table 1 Simulation parameter design

[0104] like Figure 6As shown in the figure, it can be seen that the efficiency of the FSCT algorithm is significantly higher than that of the traditional FSA algorithm, and is higher than that of the CT tree algorithm when the number of tags is greater than 160, and reaches a peak of about 62% when the number of tags is about 400. The CT algorithm maintains 50% as the theoretical value, and the maximum throughput of the FSA algorithm occurs when the number of tags to be identified is equal to the number of time slots, with a maximum of 36.8%, and then drops sharply with the increase of the number of tags.

[0105] In summary, the present invention proposes a hybrid algorithm based on the CT algorithm and the FSA algorithm. The algorithm first uses the FSA algorithm to identify some tags, and then groups the tags according to the number of time slots, retains the collision prefix, and then uses the CT algorithm to identify each group of tags. The problem of low efficiency of the FSA algorithm and high recognition delay of the CT algorithm is solved. The algorithm throughput reaches 62%, and the recognition delay is significantly reduced, which improves the performance of the RFID reader.

[0106] Importantly, it should be noted that the construction and arrangement of the present application shown in a plurality of different exemplary embodiments are only exemplary. Although only a few embodiments are described in detail in this disclosure, it should be readily understood by those who refer to this disclosure that many modifications are possible without substantially departing from the novel teachings and advantages of the subject matter described in the application (e.g., mounting arrangements, use of materials, color, changes in orientation, etc.). For example, the element shown as integrally formed may be composed of a plurality of parts or elements, the position of the element may be inverted or otherwise changed, and the nature or number or position of the discrete element may be altered or changed. Therefore, all such modifications are intended to be included within the scope of the present invention. The order or sequence of any process or method steps may be changed or reordered according to an alternative embodiment. In the claims, any "bracket plus function" clause is intended to cover the structure of the execution function described herein, and is not only structurally equivalent but also equivalent structure. Without departing from the scope of the present invention, other replacements, modifications, changes and omissions may be made in the design, operating conditions and arrangement of the exemplary embodiments. Therefore, the present invention is not limited to a specific embodiment, but extends to a variety of modifications that still fall within the scope of the appended claims.

[0107] Additionally, in an effort to provide a concise description of example embodiments, all features of an actual implementation may not be described.

[0108] It should be understood that in the development of any actual implementation, as in any engineering or design project, numerous implementation-specific decisions may be made. Such a development effort may be complex and time-consuming, but for those of ordinary skill having the benefit of this disclosure, the development effort will be a routine task of design, fabrication, and production without undue experimentation.

[0109] It should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention rather than to limit it. Although the present invention has been described in detail with reference to the preferred embodiments, those skilled in the art should understand that the technical solutions of the present invention may be modified or replaced by equivalents without departing from the spirit and scope of the technical solutions of the present invention, which should all be included in the scope of the claims of the present invention.

Claims

1. A radio frequency gate identification method based on FSCT algorithm, characterized in that: include, The reader obtains the number of time slots randomly selected by the tag by sending a Query (L) command to the tag; The reader distinguishes different time slot categories based on the number of tag responses in time slot i; When time slot i is greater than L-1, the reader identifies the remaining tags and sends a new command; The tag determines whether to respond based on its own time slot number and decides whether to send its own ID value; Use the reader to determine whether the tag IDs collide; By repeating the recognition steps, all tags are fully recognized.

2. The radio frequency door identification method based on the FSCT algorithm as claimed in claim 1, characterized in that: In the Query (L) command, L is the number of time slots in a frame. After receiving the command, the tag randomly selects a time slot number from 0 to L-1 as its own time slot number.

3. The radio frequency door identification method based on the FSCT algorithm as claimed in claim 2, characterized in that: The different time slot categories include successful time slots, idle time slots, and collision time slots.

4. The radio frequency door identification method based on the FSCT algorithm as claimed in claim 3, characterized in that: The new command is a Query (prefix, i) command, where i is the number of time slots in the collision time slot stack to be read, and prefix is ​​the collision prefix.

5. The radio frequency door identification method based on the FSCT algorithm as claimed in claim 4, characterized in that: The ID collision means that after the reader receives the ID value of the tag, multiple tags send the same ID value; If there is no ID collision, the tag is successfully identified; if there is an ID collision, the reader records the data before the collision bit and generates a new collision prefix for the next round of identification attempts.

6. A radio frequency door recognition system based on FSCT algorithm, characterized in that: include, An identification unit (100) comprises a structural support component (101), an identification component (102) arranged inside the support component, a visual aid component (103) arranged inside the support component, and a door control operation component (104); The auxiliary control unit (200) comprises a transmission component (201) and a data processing component (202).

7. The radio frequency door identification system based on the FSCT algorithm as claimed in claim 6, characterized in that: The structural support component (101) includes an equipment profile frame (101a) and an inner box shell (101b) arranged on the inner side of the equipment profile frame (101a); the identification component (102) includes an antenna bracket (102a) arranged on the inner top of the inner box shell (101b) and an ultra-high frequency antenna (102b) fixedly connected to the antenna bracket (102a); the visual auxiliary component (103) includes a camera (103b) bracket (103a) arranged on the inner side of the inner box shell (101b) and a camera (103b) fixedly connected to the camera (103b) bracket (103a).

8. The radio frequency door identification system based on the FSCT algorithm as claimed in claim 7, characterized in that: The door control operating assembly (104) comprises a cylinder support (104a) arranged on the inner side of the inner box shell (101b), a lifting cylinder (104b) fixedly connected to the cylinder support (104a), sliding guide rails (104c) arranged on both sides of the inner side of the inner box shell (101b), a roller (104d) arranged on the inner side of the sliding guide rail (104c), a lifting door (104e) hinged to the roller (104d), and an inspection door (104f) arranged on both sides of the inner box shell (101b).

9. The radio frequency door recognition system based on the FSCT algorithm as claimed in claim 8, characterized in that: The transmission component (201) comprises a roller conveyor line (201a) arranged on the lower side of the inner box shell (101b), a photoelectric support (201b) fixedly connected to one side of the roller conveyor line (201a), and a diffuse reflection photoelectric (201c) fixedly connected to the photoelectric support (201b).

10. The radio frequency door identification system based on the FSCT algorithm as claimed in claim 9, characterized in that: The data processing component (202) comprises an RFID reader (202a) used in conjunction with the over-frequency antenna, and an industrial computer (202b) arranged outside the equipment profile frame (101a).

Images