CN111753562A - Label identification method and device, electronic equipment and readable medium - Google Patents
Label identification method and device, electronic equipment and readable medium Download PDFInfo
- Publication number
- CN111753562A CN111753562A CN201910441484.6A CN201910441484A CN111753562A CN 111753562 A CN111753562 A CN 111753562A CN 201910441484 A CN201910441484 A CN 201910441484A CN 111753562 A CN111753562 A CN 111753562A
- Authority
- CN
- China
- Prior art keywords
- tag
- request signal
- write request
- read
- tags
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K7/00—Methods or arrangements for sensing record carriers, e.g. for reading patterns
- G06K7/0008—General problems related to the reading of electronic memory record carriers, independent of its reading method, e.g. power transfer
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K7/00—Methods or arrangements for sensing record carriers, e.g. for reading patterns
- G06K7/10—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation
- G06K7/10009—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation sensing by radiation using wavelengths larger than 0.1 mm, e.g. radio-waves or microwaves
- G06K7/10019—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation sensing by radiation using wavelengths larger than 0.1 mm, e.g. radio-waves or microwaves resolving collision on the communication channels between simultaneously or concurrently interrogated record carriers.
- G06K7/10029—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation sensing by radiation using wavelengths larger than 0.1 mm, e.g. radio-waves or microwaves resolving collision on the communication channels between simultaneously or concurrently interrogated record carriers. the collision being resolved in the time domain, e.g. using binary tree search or RFID responses allocated to a random time slot
Abstract
The present disclosure provides a tag identification method, a tag identification device, an electronic device, and a readable medium, wherein the method includes: acquiring the number n of labels; dividing n time slots according to the number of the labels; sending a read-write request signal to each tag so as to receive n tag serial numbers returned by each tag in response to the read-write request signal in the n time slots, and identifying the n tags; if m tags in the n tags collide during identification, generating and sending an update read-write request signal according to collision bits of the m tags; receiving m reply serial numbers of the m tags responding to the updated read-write request signal; and identifying the m labels according to the updated read-write request signal and the m reply serial numbers. The tag identification method, the tag identification device, the tag identification equipment and the tag identification medium can improve the stability of tag identification and improve the execution efficiency by combining the mode of identifying according to the time slot and the mode of identifying according to the reply sequence number.
Description
Technical Field
The present disclosure relates to the field of computer technologies, and in particular, to a tag identification method and apparatus, an electronic device, and a computer readable medium.
Background
When the tag is identified, the reader-writer can only perform read-write operation on one tag in the identification range at a time point, but in practical application, the situation that a plurality of tags enter the read-write range of the reader-writer at the same time often occurs. The reader/writer selects a specific one of the plurality of tags and performs operations such as reading and writing to avoid tag collision, which is a technique that must be solved when recognizing the tags.
The existing tag identification algorithm reads and writes tags in a random receiving mode, the execution efficiency is high, but the method has the possibility that all tags can not be identified forever, namely the problem of tag hunger and thirst; in addition, the search-based algorithm can solve the above problems, but the execution efficiency is low, and the tag identification requirement in a complex scene cannot be met.
Therefore, a new tag identification method, apparatus, electronic device and computer readable medium are needed.
The above information disclosed in this background section is only for enhancement of understanding of the background of the disclosure and therefore it may contain information that does not constitute prior art that is already known to a person of ordinary skill in the art.
Disclosure of Invention
In view of this, the present disclosure provides a tag identification method, a tag identification apparatus, an electronic device, and a computer-readable medium, which combine the time slot identification and the reply sequence number identification to identify a tag, so as to improve the stability of tag identification, improve the execution efficiency, and reduce the data transmission amount.
Additional features and advantages of the disclosure will be set forth in the detailed description which follows, or in part will be obvious from the description, or may be learned by practice of the disclosure.
According to a first aspect of the embodiments of the present disclosure, a tag identification method is provided, where the method includes: acquiring the number n of labels of the labels, wherein n is a positive integer greater than or equal to 1; dividing n time slots according to the number of the labels; sending a read-write request signal to each tag so as to receive n tag serial numbers returned by each tag in response to the read-write request signal in the n time slots, and identifying the n tags; if m tags in the n tags collide during identification, generating and sending an update read-write request signal according to collision bits of the m tags; receiving m reply serial numbers of the m tags responding to the updated read-write request signal; and identifying the m labels according to the updated read-write request signal and the m reply serial numbers.
In an exemplary embodiment of the present disclosure, generating and transmitting an update read/write request signal according to a collision bit where the m tags collide includes: determining a part to update the read-write request signal according to the highest bit of the n label serial numbers and the highest collision bit of the collision bits; inverting the highest collision position of the read-write request signal, and combining with the partial update read-write request signal to generate the update read-write request signal
In an exemplary embodiment of the present disclosure, the reply sequence number is generated by the m tags that have collided according to the lowest bit of the respective tag sequence numbers and the highest collision bit.
In an exemplary embodiment of the present disclosure, identifying the m tags according to the update read-write request signal and the m reply sequence numbers includes: and generating the label serial numbers of the m labels according to the m reply serial numbers and the update read-write request signal so as to identify the m labels according to the label serial numbers of the m labels.
In an exemplary embodiment of the present disclosure, generating and transmitting an update read/write request signal according to a collision bit where the m tags collide includes: and inverting the corresponding position in the read-write request signal according to the highest collision bit in the collision bits to generate an updated read-write request signal.
In an exemplary embodiment of the present disclosure, obtaining the number n of tags of the tag includes: sending a detection instruction to each label; obtaining response signals of the tags responding to the detection instructions; and obtaining the label number n of the labels according to each response signal.
In an exemplary embodiment of the present disclosure, the read-write request signal includes the n time slots.
In an exemplary embodiment of the present disclosure, the method further comprises: and when the number of the identified tags is less than n, continuing to send the read-write request signal, and receiving the tag serial number of the tag which does not finish identification and responds to the read-write request signal so as to identify the tag which does not finish identification.
According to a second aspect of the embodiments of the present disclosure, there is provided a tag identification apparatus, including: the system comprises a tag number obtaining module, a tag number obtaining module and a tag matching module, wherein the tag number obtaining module is used for obtaining the tag number n of tags, and n is a positive integer which is more than or equal to 1; the time slot dividing module is used for dividing n time slots according to the number of the labels; the first identification module is used for sending a read-write request signal to each label so as to receive n label serial numbers returned by each label in response to the read-write request signal in the n time slots and identify the n labels; the request signal updating module is used for generating and sending an updating read-write request signal according to collision bits of m labels in collision if m labels in the n labels collide during identification; a reply sequence number receiving module, configured to receive m reply sequence numbers of the m tags in response to the update read-write request signal; and the second identification module is used for identifying the m labels according to the updated read-write request signal and the m reply serial numbers.
According to a third aspect of the embodiments of the present disclosure, an electronic device is provided, which includes: one or more processors; storage means for storing one or more programs; when executed by the one or more processors, cause the one or more processors to implement the tag identification method of any of the above.
According to a fourth aspect of the embodiments of the present disclosure, a computer-readable medium is proposed, on which a computer program is stored, wherein the program, when executed by a processor, implements the tag identification method according to any one of the above.
According to the tag identification method, the tag identification device, the electronic equipment and the computer readable medium provided by some embodiments of the disclosure, firstly, the tag is identified according to a method of receiving the tag serial number in a time slot, the logic is simple, and the execution efficiency is improved; the reply sequence number is received through the update read-write request signal, and the tags collided in the identification process are identified according to the reply sequence number and the update read-write request signal, so that the situation that the tags are always collided in the identification mode possibly to cause that the tags can not be identified forever can be avoided, and the stability of the identification effect is improved; the tag identification method disclosed by the embodiment of the disclosure can improve the execution efficiency by combining the two modes to complete the identification of the tag on the basis of ensuring the stability of the identification algorithm, and can improve the stability of the tag identification and improve the execution efficiency by combining the modes of identifying according to the time slot and the reply sequence number to identify the tag.
According to the tag identification method provided by other embodiments of the present disclosure, the update read-write request signal is generated and sent according to the collision bit, and the tag identification is completed based on the reply sequence number returned by the collided tag and the update read-write request signal, so that the data transmission amount can be reduced, and the algorithm efficiency is further improved.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the disclosure.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present disclosure and together with the description, serve to explain the principles of the disclosure. The drawings described below are merely some embodiments of the present disclosure, and other drawings may be derived from those drawings by those of ordinary skill in the art without inventive effort.
Fig. 1 is a system block diagram illustrating a tag identification method and apparatus according to an example embodiment.
Fig. 2 is a flow chart illustrating a method of tag identification according to an example embodiment.
Fig. 3 is a flow chart illustrating a method of tag identification according to another exemplary embodiment.
Fig. 4 is a flow chart illustrating a method of tag identification according to another exemplary embodiment.
Fig. 5 is a block diagram illustrating a tag identification apparatus according to an exemplary embodiment.
Fig. 6 is an architecture diagram illustrating a tag identification system in accordance with another exemplary embodiment.
FIG. 7 is a block diagram illustrating an electronic device in accordance with an example embodiment.
Detailed Description
Example embodiments will now be described more fully with reference to the accompanying drawings. Example embodiments may, however, be embodied in many different forms and should not be construed as limited to the embodiments set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of example embodiments to those skilled in the art. The same reference numerals denote the same or similar parts in the drawings, and thus, a repetitive description thereof will be omitted.
The described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. In the following description, numerous specific details are provided to provide a thorough understanding of embodiments of the invention. One skilled in the relevant art will recognize, however, that the invention may be practiced without one or more of the specific details, or with other methods, components, devices, steps, and so forth. In other instances, well-known methods, devices, implementations or operations have not been shown or described in detail to avoid obscuring aspects of the invention.
The drawings are merely schematic illustrations of the present invention, in which the same reference numerals denote the same or similar parts, and thus, a repetitive description thereof will be omitted. Some of the block diagrams shown in the figures do not necessarily correspond to physically or logically separate entities. These functional entities may be implemented in the form of software, or in one or more hardware modules or integrated circuits, or in different networks and/or processor devices and/or microcontroller devices.
The flow charts shown in the drawings are merely illustrative and do not necessarily include all of the contents and steps, nor do they necessarily have to be performed in the order described. For example, some steps may be decomposed, and some steps may be combined or partially combined, so that the actual execution sequence may be changed according to the actual situation.
The following detailed description of exemplary embodiments of the invention refers to the accompanying drawings.
Fig. 1 is a system block diagram illustrating a tag identification method and apparatus according to an example embodiment.
The server 105 may be a server providing various services, such as a background management server (for example only) providing support for a tag identification system operated by a user with the terminal device 101, 102, 103. The backend management server may analyze and perform other processing on the received data such as the tag identification request, and feed back a processing result (for example, a tag identification result — just an example) to the terminal device.
The server 105 may, for example, obtain the tag number n of the tags, where n is a positive integer greater than or equal to 1; the server 105 may divide the n time slots, for example, according to the number of tags; the server 105 may, for example, send a read-write request signal to each tag to receive n tag sequence numbers returned by each tag in the n time slots in response to the read-write request signal, so as to identify the n tags; the server 105 may, for example, generate and send an update read-write request signal according to a collision bit of m tags in the n tags if m tags in the n tags collide during identification, where m is a positive integer greater than or equal to 2 and less than or equal to n; the server 105 may, for example, receive m reply sequence numbers of the m tags in response to the update read-write request signal; the server 105 may identify the m tags according to the update read-write request signal and the m reply sequence numbers, for example.
The server 105 may be a server of one entity, and may also be composed of a plurality of servers, for example, a part of the server 105 may be, for example, used as a tag identification task submitting system in the present disclosure, and is configured to obtain a task to be executed with a tag identification command; and a part of the server 105 may also be, for example, as a tag identification system in the present disclosure, configured to obtain a number n of tags, where n is a positive integer greater than or equal to 1; dividing n time slots according to the number of the labels; sending a read-write request signal to each tag so as to receive n tag serial numbers returned by each tag in response to the read-write request signal in the n time slots, and identifying the n tags; if m tags in the n tags collide during identification, generating and sending an update read-write request signal according to collision bits of the m tags, wherein m is a positive integer greater than or equal to 2 and less than or equal to n; receiving m reply serial numbers of the m tags responding to the updated read-write request signal; and identifying the m labels according to the updated read-write request signal and the m reply serial numbers.
According to the tag identification method and device disclosed by the invention, the tag is identified by combining the modes of identifying according to the time slot and the reply sequence number, so that the stability of tag identification can be improved, and the execution efficiency is improved.
Fig. 2 is a flow chart illustrating a method of tag identification according to an example embodiment. The recommended tallying method provided by the embodiments of the present disclosure may be executed by any electronic device with computing processing capability, such as the terminal devices 101, 102, and 103 and/or the server 105, and in the following embodiments, the method executed by the server is taken as an example for illustration, but the present disclosure is not limited thereto. The tag identification method 20 provided by the embodiment of the present disclosure may include steps S201 to S211.
As shown in fig. 2, in step S201, the number n of tags of the tags is acquired, where n is a positive integer greater than or equal to 1.
The tag may be a physical carrier with a communication function, and may be, for example and without limitation, a radio frequency tag of Radio Frequency Identification (RFID). The radio frequency label is a physical carrier of an electronic code of a product, is attached to a traceable article, can circulate globally and can be identified and read and written.
In one embodiment, a probe instruction may be sent to each tag; obtaining response signals of the tags responding to the detection instructions; and obtaining the label number n of the labels according to each response signal. Wherein each response signal is the same. The number n of the tags can be obtained according to the number statistics of the response signals.
In step S203, n slots are divided according to the number of tags.
The time slot is the minimum unit of circuit switching summary information transmission, and is a part of serial self-multiplexing of time slot information special for a certain single channel. In the T1 and E1 services, a slot typically refers to a 64 kilobit per second (kbps) channel.
In step S205, a read/write request signal is sent to each tag to receive n tag serial numbers returned by each tag in the n time slots in response to the read/write request signal, so as to identify the n tags.
The reading and writing request signals are used for being sent to each label, and the labels judge whether the reading and writing request signals meet the conditions contained in the reading and writing request signals or not according to the reading and writing request signals. And if a certain label meets the condition of the read-write request signal, sending the label serial number of the label responding to the read-write request signal. The condition included in the read/write request signal can be represented by a binary code, for example, in this step, the read/write request signal includes binary numbers all of which are1, and tags with tag numbers less than or equal to the binary numbers are tags that satisfy the condition. For another example, the read/write request signal includes binary numbers of all 0, and the tags having tag numbers equal to or greater than the binary number are tags satisfying the condition. Each tag may return its tag sequence number in turn according to n time slots, for example, the binary number in the condition in the read/write request signal may be, for example, a number greater than or equal to n-1. The time slot for each tag to return its tag serial number is determined by the size of the number corresponding to its tag serial number. For example, if n is 16, the condition of the read/write request signal is 1111 (binary numbers satisfying the condition are 0000 to 1111), and the tag number of a tag is 0011, the tag returns its tag number in the 3 rd time slot. After the 16 time slots are finished, the label serial numbers of all labels can be obtained.
In one embodiment, the read-write request signal includes the n slots. The n time slots in the read-write request signal can be used for informing each tag of returning the time slot rule to which the tag serial number of the tag should follow, so that each tag returns the n tag serial numbers of each tag in the n time slots. Wherein the read-write request signal may only include a binary condition (e.g. 1111), and the tag may determine n (1111+1) according to the binary condition, i.e. determine the slot number as a decimal number: 16.
in step S207, if m tags of the n tags collide during identification, an update read/write request signal is generated and transmitted according to collision bits of the m tags, where m is a positive integer greater than or equal to 2 and less than or equal to n.
Wherein, the n labels can randomly select any time slot in the n time slots to transmit the label serial number. If two or more tags return the tag serial numbers in the same time slot, the two or more tags collide during identification. For example, the tag numbers of the tags are different. Taking the Mifare1 card as an example, each card tag has a 32-bit binary serial number that is unique globally. When collision occurs, two or more tag serial numbers must have different bits, which are collision bits for sending collision. The update request signal may be used to send to m tags that have collided. The number of the non-collided tags is n-m, and the non-collided tags can be identified in step S205 and do not receive the update read/write request signal any more.
The collision bit may be detected, for example, using manchester code modulated by a subcarrier. The right half of the subcarrier modulation code element represents data '0', the left half of the subcarrier modulation code element represents data '1', when collision occurs, the card returns '0' and '1' at the same time, so that the whole code element has subcarrier modulation, when the reader-writer receives the code element, the collision is confirmed, and the collision bit can be determined according to the collision.
In one embodiment, the read-write request signal may be updated according to the highest bit of the m tag serial numbers and the highest collision bit determination part of the collision bits; and inverting the highest collision position of the read-write request signal, and combining the highest collision position with the partial update read-write request signal to generate the update read-write request signal. For example, following the four-bit binary tag serial number example, the tags with tag serial numbers 1010 and 1000 are respectively "1" and "0" because of their third bits, and the second bit is the collision bit. For another example, the first and second bits of 1011 and 1000 have collided, but the highest collision bit is the second bit. In the first example of this embodiment, after determining that the highest collision bit is the second bit, according to m — 2 tags: the highest order bits and the second order bits of the 1010 and 1000 sequence numbers are intercepted to obtain a partial update request signal: 10. inverting the highest collision position of the read-write request signal may be: setting the second bit 1 to 0, and combining it with a part of the refresh request signal, i.e. 10 and 0, to generate a refresh request read-write signal: 100. in this embodiment, the update read/write request signal includes the serial number of the partial tag of the collided tag, and the tag sending the collision can only return the partial tag when returning the serial number again, thereby reducing the data transmission amount.
In one embodiment, the corresponding position in the read/write request signal may be inverted according to the highest collision bit in the collision bits to generate the updated read/write request signal. In the foregoing example, the update read/write request signal can be obtained by inverting the highest collision bit, i.e. the second position: 1101.
in step S209, m reply serial numbers of the m tags in response to the update read/write request signal are received.
Wherein, m tags are all tags that have collided. Due to the collision, the tag number thereof is not successfully identified in step S205. m reply sequence numbers are returned by m tags respectively. The reply serial number of a certain tag may be a part of the tag serial number of the tag, or may be the entire tag serial number. When the m tags reply the serial numbers, if the part from the highest bit to the highest collision bit plus 1 bit of the update request signal is judged to be completely the same as the corresponding part of the tag serial number, only the part from the highest collision bit (excluding the highest collision bit) to the lowest bit can be returned as the m reply serial numbers, otherwise, the whole content of the tag serial number can be returned as the m reply serial numbers.
In one embodiment, the reply sequence number is generated by the m tags that have collided according to the lowest bit and the highest collision bit of the respective tag sequence numbers. For example, in the foregoing example, the tags sending the collision are 1010 and 1000, the highest collision bit is the second bit, and the partially updated read/write request signal is 100, and if m is 2 tags, only 1000 satisfies the condition of the partially updated read/write request signal, and the lowest bit to the highest collision bit-1 bit, that is, 0, will be returned. And a tag with tag number 1010 will not return a reply number because the condition is not satisfied. The tag of 1010 can complete the identification of its tag serial number at the next read/write.
In step S211, the m tags are identified according to the update read-write request signal and the m reply serial numbers.
In an embodiment, the tag sequence numbers of the m tags may be generated according to the m reply sequence numbers and the update read-write request signal, so as to identify the m tags according to the tag sequence numbers of the m tags. The m reply serial numbers and the update read-write request signal can be combined to generate the tag serial numbers of the m tags. For example, if the update read/write request signal is 100 and the reply sequence number returned by a tag is 0, the update read/write request signal and the reply sequence number are combined to generate: 1000, the tag serial number of the tag.
In one embodiment, when the number of the identified tags is less than n, the read-write request signal is continuously sent, and the tag serial number of the tag which does not complete identification and responds to the read-write request signal is received, so as to identify the tag which does not complete identification. According to the embodiment, the read-write request signal can be sent in an iterative manner, and the identification of all the tags can be completed.
According to the tag identification method shown in the embodiment of the disclosure, firstly, the tag is identified according to the method of receiving the tag serial number in the time slot, the logic is simple, and the execution efficiency is improved; the reply sequence number is received through the update read-write request signal, and the tags collided in the identification process are identified according to the reply sequence number and the update read-write request signal, so that the situation that the tags are always collided in the identification mode possibly to cause that the tags can not be identified forever can be avoided, and the stability of the identification effect is improved; according to the tag identification method, the two modes are combined to complete the identification of the tag, so that the execution efficiency can be improved on the basis of ensuring the stability of the identification algorithm. According to the tag identification method, the tag is identified by combining the modes of identifying according to the time slot and the reply serial number, so that the stability of tag identification can be improved, and the execution efficiency is improved.
According to the tag identification method, the tag identification device, the electronic device and the computer readable medium provided by other embodiments of the present disclosure, the update read-write request signal is generated and sent according to the collision bit, and the tag identification is completed based on the reply sequence number returned by the collided tag and the update read-write request signal, so that the data transmission amount can be reduced, and the algorithm efficiency is further improved.
It should be clearly understood that this disclosure describes how to make and use particular examples, but the principles of this disclosure are not limited to any details of these examples. Rather, these principles can be applied to many other embodiments based on the teachings of the present disclosure.
Fig. 3 is a flow chart illustrating a method of tag identification according to another exemplary embodiment. The tag identification method 30 may include steps S302 to S306.
As shown in fig. 3, in step S302, a probe instruction is sent to each tag, each response signal of each tag in response to the probe instruction is obtained, and the number n of tags in the tag is determined according to each response signal. Wherein n is a positive integer greater than or equal to 1.
In step S304, all 1 read/write request signals are sent to the tags, and n tag numbers responding to the read/write request signals returned by the n tags in n time slots are received. When the label serial number of each label is smaller than the read-write request signal, the label serial number of each label responds to the read-write request signal and returns the label serial number of each label, otherwise, the label serial number of each label cannot be returned. Because the read-write request signals are all 1 and are greater than the label serial numbers of all the labels, all the labels return the label serial numbers thereof.
In step S306, it is determined whether collision occurs during recognition in the n tags, if so, step S308 is continuously executed, otherwise, recognition is finished.
In step S308, the highest collision position 0 of the read/write request signal and the other bits are not changed to generate an updated read/write request signal, and the updated read/write request signal is transmitted to each tag having a collision.
In step S310, the tag numbers of the tags satisfying the update read/write request signal are received. When the collision occurs, each tag returns the tag serial number when the tag serial number of each collided tag is confirmed to be smaller than the update read-write request signal.
In step S312, it is determined whether the tag serial numbers responding to the update read/write request signal collide, if yes, the process returns to step S308, otherwise, all tags are obtained through identification, and the identification is finished.
According to the tag identification method provided by the embodiment of the disclosure, firstly, the tag is identified according to the method of receiving the tag serial number in the time slot, the logic is simple, and the execution efficiency is improved; and the label serial number is received in an iterative search mode by updating the read-write request signal, so that the condition that labels can not be identified forever due to permanent collision possibly existing in the identification mode can be avoided, and the stability of the identification effect is improved.
Fig. 4 is a flow chart illustrating a method of tag identification according to another exemplary embodiment. The tag identification method 40 may include steps S402 to S412.
As shown in fig. 4, in step S402, a probe instruction is sent to each tag, each response signal of each tag in response to the probe instruction is obtained, and the number n of tags in the tag is determined according to each response signal. Wherein n is a positive integer greater than or equal to 1.
In step S404, all 1 read/write request signals are sent to the tags, and n tag numbers responding to the read/write request signals returned by the n tags in n time slots are received. When the label serial number of each label is smaller than the read-write request signal, the label serial number of each label responds to the read-write request signal and returns the label serial number of each label, otherwise, the label serial number of each label cannot be returned. Because the read-write request signals are all 1 and are greater than the label serial numbers of all the labels, all the labels return the label serial numbers thereof.
In step S406, it is determined whether a collision occurs during the identification of the n tags, if so, the step S408 is continuously performed, otherwise, the identification is finished.
In step S408, a part between the highest bit of the tag sequence number that has collided and the previous bit of the highest collision bit is intercepted as a partial update read/write request signal, and after the highest collision position 0 of the read/write request signal, the partial update read/write request signal is combined with the read/write request signal to generate an update read/write signal, and the update read/write signal is sent to each tag that has collided.
In step S410, a reply sequence number of each tag satisfying the update read/write request signal is received. And when each collided tag confirms that the tag serial number of each collided tag is smaller than the update read-write request signal, returning a reply serial number. The reply sequence number is generated by intercepting the next bit of the highest collision bit of the tag sequence number to the lowest bit of the tag sequence number.
In step S412, it is determined whether each reply serial number responding to the update read/write request signal collides, if so, the process returns to step S408, otherwise, all tags are identified and executed, and step S414 is pointed to.
In step S414, the updated read/write request signal is combined with the reply serial number to generate a tag serial number, so as to complete the identification of the collided tag.
According to the tag identification method provided by the embodiment of the disclosure, on the basis of combining the time slot identification and the iterative search tag serial number identification, the reply serial number is provided, so that the data volume of the read-write request signal and the tag return data is reduced, the method has the advantages of simple logic, high execution efficiency and stable identification, and the data transmission volume is reduced.
Those skilled in the art will appreciate that all or part of the steps implementing the above-described embodiments are implemented as computer programs executed by a central processing unit CPU. When executed by a central processing unit CPU, performs the above-described functions defined by the above-described methods provided by the present disclosure. The program may be stored in a computer readable storage medium, which may be a read-only memory, a magnetic or optical disk, or the like.
Furthermore, it should be noted that the above-mentioned figures are only schematic illustrations of the processes involved in the methods according to exemplary embodiments of the present disclosure, and are not intended to be limiting. It will be readily understood that the processes shown in the above figures are not intended to indicate or limit the chronological order of the processes. In addition, it is also readily understood that these processes may be performed synchronously or asynchronously, e.g., in multiple modules.
The following are embodiments of the disclosed apparatus that may be used to perform embodiments of the disclosed methods. For details not disclosed in the embodiments of the apparatus of the present disclosure, refer to the embodiments of the method of the present disclosure.
Fig. 5 is a block diagram illustrating a tag identification apparatus according to an exemplary embodiment. Referring to fig. 5, a tag identification apparatus 50 provided by an embodiment of the present disclosure may include: a tag number obtaining module 502, a time slot dividing module 504, a first identification module 506, a request signal updating module 508, a reply sequence number receiving module 510, and a second identification module 512.
In the tag identification apparatus 50, the tag number obtaining module 502 is configured to obtain a tag number n of a tag, where n is a positive integer greater than or equal to 1.
In an exemplary embodiment, the tag number obtaining module 502 may include: the detection instruction sending module can be used for sending detection instructions to the labels; the response signal receiving module is used for obtaining response signals of all the tags responding to the detection instruction; and the tag number counting module can be used for obtaining the tag number n of the tags according to each response signal.
The time slot dividing module 504 may be configured to divide the n time slots according to the number of tags.
The first identifying module 506 may be configured to send a read-write request signal to each tag, so as to receive n tag sequence numbers returned by each tag in the n time slots in response to the read-write request signal, so as to identify the n tags.
In an exemplary embodiment, the read-write request signal includes the n slots.
The request signal updating module 508 may be configured to generate and send an update read/write request signal according to a collision bit of m tags in the n tags if m tags in the n tags collide during identification, where m is a positive integer greater than or equal to 2 and less than or equal to n.
In an exemplary embodiment, the request signal update module 508 may include: a partial update read-write request signal generation module, configured to determine a partial update read-write request signal according to a highest bit of the m tag sequence numbers and a highest collision bit of the collision bits; and the updating read-write request signal generating module can be used for inverting the highest collision position of the read-write request signal and combining the highest collision position with the partial updating read-write request signal to generate the updating read-write request signal.
In an exemplary embodiment, the request signal updating module 508 may be configured to invert a corresponding position in the read/write request signal according to a highest collision bit of the collision bits to generate the updated read/write request signal.
The reply sequence number receiving module 510 may be configured to receive m reply sequence numbers of the m tags in response to the update read/write request signal.
In an exemplary embodiment, the reply sequence number is generated by the m tags that have collided according to the lowest bit and the highest collision bit of the respective tag sequence numbers.
The second identifying module 512 is configured to identify the m tags according to the update read-write request signal and the m reply serial numbers.
In an exemplary embodiment, the second identifying module 512 may be configured to generate the tag sequence numbers of the m tags according to the m reply sequence numbers and the update read-write request signal, so as to identify the m tags according to the tag sequence numbers of the m tags.
In an exemplary embodiment, the second identification module 512 may be configured to continue to send the read/write request signal when the number of identified tags is less than n, and receive the tag serial number of the tag that has not been identified in response to the read/write request signal, so as to identify the tag that has not been identified.
According to the tag identification device provided by the embodiment of the disclosure, the tag is identified according to the method of receiving the tag serial number in the time slot, the logic is simple, and the execution efficiency is improved; the reply sequence number is received through the update read-write request signal, and the tags collided in the identification process are identified according to the reply sequence number and the update read-write request signal, so that the situation that the tags are always collided in the identification mode possibly to cause that the tags can not be identified forever can be avoided, and the stability of the identification effect is improved; the tag identification device disclosed by the invention can be used for completing the identification of the tag by combining two modes, and the execution efficiency can be improved on the basis of ensuring the stability of an identification algorithm. The tag identification device can improve the stability of tag identification and improve the execution efficiency by combining the mode of identifying according to the time slot and the mode of identifying according to the reply sequence number.
According to the tag identification device provided by other embodiments of the present disclosure, the update read-write request signal is generated and sent according to the collision bit, and the identification of the tag is completed based on the reply sequence number returned by the collided tag and the update read-write request signal, so that the data transmission amount can be reduced, and the algorithm efficiency is further improved.
FIG. 6 is a block diagram illustrating an electronic device in accordance with an example embodiment.
An electronic device 200 according to this embodiment of the present disclosure is described below with reference to fig. 6. The electronic device 200 shown in fig. 6 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present disclosure.
As shown in fig. 6, the electronic device 200 is embodied in the form of a general purpose computing device. The components of the electronic device 200 may include, but are not limited to: at least one processing unit 210, at least one memory unit 220, a bus 230 connecting different system components (including the memory unit 220 and the processing unit 210), a display unit 240, and the like.
Wherein the storage unit stores program code executable by the processing unit 210 to cause the processing unit 210 to perform the steps according to various exemplary embodiments of the present disclosure described in the above-mentioned electronic prescription flow processing method section of the present specification. For example, the processing unit 210 may perform the steps as shown in fig. 2, 3, 4.
The memory unit 220 may include readable media in the form of volatile memory units, such as a random access memory unit (RAM)2201 and/or a cache memory unit 2202, and may further include a read only memory unit (ROM) 2203.
The storage unit 220 may also include a program/utility 2204 having a set (at least one) of program modules 2205, such program modules 2205 including, but not limited to: an operating system, one or more application programs, other program modules, and program data, each of which, or some combination thereof, may comprise an implementation of a network environment.
The electronic device 200 may also communicate with one or more external devices 300 (e.g., keyboard, pointing device, bluetooth device, etc.), with one or more devices that enable a user to interact with the electronic device 200, and/or with any devices (e.g., router, modem, etc.) that enable the electronic device 200 to communicate with one or more other computing devices. Such communication may occur via an input/output (I/O) interface 250. Also, the electronic device 200 may communicate with one or more networks (e.g., a Local Area Network (LAN), a Wide Area Network (WAN), and/or a public network such as the Internet) via the network adapter 260. The network adapter 260 may communicate with other modules of the electronic device 200 via the bus 230. It should be appreciated that although not shown in the figures, other hardware and/or software modules may be used in conjunction with the electronic device 200, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, among others.
Through the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein may be implemented by software, or by software in combination with necessary hardware. Therefore, the technical solution according to the embodiments of the present disclosure may be embodied in the form of a software product, which may be stored in a non-volatile storage medium (which may be a CD-ROM, a usb disk, a removable hard disk, etc.) or on a network, and includes several instructions to enable a computing device (which may be a personal computer, a server, or a network device, etc.) to execute the above method according to the embodiments of the present disclosure.
Fig. 7 schematically illustrates a computer-readable storage medium in an exemplary embodiment of the disclosure.
Referring to fig. 7, a program product 400 for implementing the above method according to an embodiment of the present disclosure is described, which may employ a portable compact disc read only memory (CD-ROM) and include program code, and may be run on a terminal device, such as a personal computer. However, the program product of the present disclosure is not limited thereto, and in this document, a readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
The program product may employ any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. A readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples (a non-exhaustive list) of the readable storage medium include: an electrical connection having one or more wires, a portable disk, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
The computer readable storage medium may include a propagated data signal with readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A readable storage medium may also be any readable medium that is not a readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a readable storage medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Program code for carrying out operations for the present disclosure may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computing device, partly on the user's device, as a stand-alone software package, partly on the user's computing device and partly on a remote computing device, or entirely on the remote computing device or server. In the case of a remote computing device, the remote computing device may be connected to the user computing device through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computing device (e.g., through the internet using an internet service provider).
The computer readable medium carries one or more programs which, when executed by a device, cause the computer readable medium to perform the functions of: acquiring the number n of labels of the labels, wherein n is a positive integer greater than or equal to 1; dividing n time slots according to the number of the labels; sending a read-write request signal to each tag so as to receive n tag serial numbers returned by each tag in response to the read-write request signal in the n time slots, and identifying the n tags; if m tags in the n tags collide during identification, generating and sending an update read-write request signal according to collision bits of the m tags, wherein m is a positive integer greater than or equal to 2 and less than or equal to n; receiving m reply serial numbers of the m tags responding to the updated read-write request signal; and identifying the m labels according to the updated read-write request signal and the m reply serial numbers.
Those skilled in the art will appreciate that the modules described above may be distributed in the apparatus according to the description of the embodiments, or may be modified accordingly in one or more apparatuses unique from the embodiments. The modules of the above embodiments may be combined into one module, or further split into multiple sub-modules.
Through the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein may be implemented by software, or by software in combination with necessary hardware. Therefore, the technical solution according to the embodiments of the present disclosure may be embodied in the form of a software product, which may be stored in a non-volatile storage medium (which may be a CD-ROM, a usb disk, a removable hard disk, etc.) or on a network, and includes several instructions to enable a computing device (which may be a personal computer, a server, a mobile terminal, or a network device, etc.) to execute the method according to the embodiments of the present disclosure.
Exemplary embodiments of the present disclosure are specifically illustrated and described above. It is to be understood that the present disclosure is not limited to the precise arrangements, instrumentalities, or instrumentalities described herein; on the contrary, the disclosure is intended to cover various modifications and equivalent arrangements included within the spirit and scope of the appended claims.
Claims (11)
1. A tag identification method, comprising:
acquiring the number n of labels of the labels, wherein n is a positive integer greater than or equal to 1;
dividing n time slots according to the number of the labels;
sending a read-write request signal to each tag so as to receive n tag serial numbers returned by each tag in response to the read-write request signal in the n time slots, and identifying the n tags;
if m tags in the n tags collide during identification, generating and sending an update read-write request signal according to collision bits of the m tags, wherein m is a positive integer greater than or equal to 2 and less than or equal to n;
receiving m reply serial numbers of the m tags responding to the updated read-write request signal;
and identifying the m labels according to the updated read-write request signal and the m reply serial numbers.
2. The method of claim 1, wherein generating and sending an update read-write request signal according to a collision bit of the m tags in collision comprises:
determining a part to update the read-write request signal according to the highest bit of the m label serial numbers and the highest collision bit of the collision bits;
and inverting the highest collision position of the read-write request signal, and combining the highest collision position with the partial update read-write request signal to generate the update read-write request signal.
3. The method of claim 2, wherein the reply sequence numbers are generated by the m tags that have collided based on the lowest bit and the highest collision bit of the respective tag sequence numbers.
4. The method of claim 3, wherein identifying the m tags according to the update read-write request signal and the m reply sequence numbers comprises:
and generating the label serial numbers of the m labels according to the m reply serial numbers and the update read-write request signal so as to identify the m labels according to the label serial numbers of the m labels.
5. The method of claim 1, wherein generating and sending an update read-write request signal according to a collision bit of the m tags in collision comprises:
and inverting the corresponding position in the read-write request signal according to the highest collision bit in the collision bits to generate the updated read-write request signal.
6. The method of claim 1, wherein obtaining the tag number n of tags comprises:
sending a detection instruction to each label;
obtaining response signals of the tags responding to the detection instructions;
and obtaining the label number n of the labels according to each response signal.
7. The method of claim 1, wherein the read and write request signals include the n time slots.
8. The method of claim 1, further comprising:
and when the number of the identified tags is less than n, continuing to send the read-write request signal, and receiving the tag serial number of the tag which does not finish identification and responds to the read-write request signal so as to identify the tag which does not finish identification.
9. A label identification device, comprising:
the system comprises a tag number obtaining module, a tag number obtaining module and a tag matching module, wherein the tag number obtaining module is used for obtaining the tag number n of tags, and n is a positive integer which is more than or equal to 1;
the time slot dividing module is used for dividing n time slots according to the number of the labels;
the first identification module is used for sending a read-write request signal to each label so as to receive n label serial numbers returned by each label in response to the read-write request signal in the n time slots and identify the n labels;
a request signal updating module, configured to generate and send an update read-write request signal according to a collision bit of m tags in the n tags if m tags in the n tags collide during identification, where m is a positive integer greater than or equal to 2 and less than or equal to n;
a reply sequence number receiving module, configured to receive m reply sequence numbers of the m tags in response to the update read-write request signal;
and the second identification module is used for identifying the m labels according to the updated read-write request signal and the m reply serial numbers.
10. An electronic device, comprising:
one or more processors; and
storage means for storing one or more programs;
when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-8.
11. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the method according to any one of claims 1-8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910441484.6A CN111753562A (en) | 2019-05-24 | 2019-05-24 | Label identification method and device, electronic equipment and readable medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910441484.6A CN111753562A (en) | 2019-05-24 | 2019-05-24 | Label identification method and device, electronic equipment and readable medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111753562A true CN111753562A (en) | 2020-10-09 |
Family
ID=72672836
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910441484.6A Pending CN111753562A (en) | 2019-05-24 | 2019-05-24 | Label identification method and device, electronic equipment and readable medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111753562A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113098568A (en) * | 2021-03-30 | 2021-07-09 | 太原理工大学 | Multi-label collision backscattering communication method and system |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101840489A (en) * | 2010-06-02 | 2010-09-22 | 西南交通大学 | Multi-tag identification anti-collision method based on collision tree |
| US20130043982A1 (en) * | 2010-02-01 | 2013-02-21 | France Telecom | Method of identifying and authenticating a radio tag by a reader |
| CN105654010A (en) * | 2015-12-16 | 2016-06-08 | 广东工业大学 | RFID tag anti-collision method based on self-adaptive search strategy |
| CN107644185A (en) * | 2017-10-23 | 2018-01-30 | 中国石油大学(华东) | The recognition methods of loss crucial label of the anonymous radio-frequency recognition system based on vector |
| CN107908992A (en) * | 2017-10-27 | 2018-04-13 | 国网河南省电力公司商丘供电公司 | A kind of electrical power system network safety method and system of identity-based identification |
| CN109740394A (en) * | 2018-12-13 | 2019-05-10 | 北京计算机技术及应用研究所 | A kind of radio frequency identification anti-collision method |
-
2019
- 2019-05-24 CN CN201910441484.6A patent/CN111753562A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130043982A1 (en) * | 2010-02-01 | 2013-02-21 | France Telecom | Method of identifying and authenticating a radio tag by a reader |
| CN101840489A (en) * | 2010-06-02 | 2010-09-22 | 西南交通大学 | Multi-tag identification anti-collision method based on collision tree |
| CN105654010A (en) * | 2015-12-16 | 2016-06-08 | 广东工业大学 | RFID tag anti-collision method based on self-adaptive search strategy |
| CN107644185A (en) * | 2017-10-23 | 2018-01-30 | 中国石油大学(华东) | The recognition methods of loss crucial label of the anonymous radio-frequency recognition system based on vector |
| CN107908992A (en) * | 2017-10-27 | 2018-04-13 | 国网河南省电力公司商丘供电公司 | A kind of electrical power system network safety method and system of identity-based identification |
| CN109740394A (en) * | 2018-12-13 | 2019-05-10 | 北京计算机技术及应用研究所 | A kind of radio frequency identification anti-collision method |
Non-Patent Citations (1)
| Title |
|---|
| 李波;: "基于标签信息分组的射频识别防碰撞算法", 华南理工大学学报(自然科学版), no. 07 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113098568A (en) * | 2021-03-30 | 2021-07-09 | 太原理工大学 | Multi-label collision backscattering communication method and system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109409121B (en) | Desensitization processing method and device and server | |
| CN108596616B (en) | User data authenticity analysis method and device, storage medium and electronic equipment | |
| CN109783490B (en) | Data fusion method and device, computer equipment and storage medium | |
| CN111325156A (en) | Face recognition method, device, equipment and storage medium | |
| CN110287146B (en) | Method, device and computer storage medium for downloading application | |
| US20100131685A1 (en) | Hardware configuration information system, method, and computer program product | |
| CN111737564A (en) | Information query method, device, equipment and medium | |
| US9311348B2 (en) | Method and system for implementing an array using different data structures | |
| US11137947B2 (en) | Recognizing hard disk movement | |
| CN111753562A (en) | Label identification method and device, electronic equipment and readable medium | |
| CN111679959A (en) | Computer performance data determination method and device, computer equipment and storage medium | |
| CN110070383B (en) | Abnormal user identification method and device based on big data analysis | |
| CN115934082A (en) | Page generation method, device, equipment, readable storage medium and program product | |
| US20220092452A1 (en) | Automated machine learning tool for explaining the effects of complex text on predictive results | |
| CN110555763A (en) | financial data processing method and device based on block chain | |
| CN112199922B (en) | Encoding method, apparatus, device, and computer-readable storage medium | |
| CN111753548A (en) | Information acquisition method and device, computer storage medium and electronic equipment | |
| CN110245231B (en) | Training sample feature extraction method, device and equipment for messy codes | |
| CN104679687A (en) | Method and device for recognizing interruption source | |
| CN112035732A (en) | Method, system, equipment and storage medium for expanding search results | |
| CN114860390B (en) | Container data management method, device, program product, medium and electronic equipment | |
| CN111859972B (en) | Entity identification method, entity identification device, computer equipment and computer readable storage medium | |
| CN111241017B (en) | Data transmission method and device of multi-channel PSAM card and multi-channel PSAM card | |
| CN116594570B (en) | Memory access circuit, memory access method, integrated circuit, and electronic device | |
| CN105741104A (en) | Offline transaction apparatus and method based on offline transaction apparatus |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |