Deterministic anti-collision algorithm based on multi-prefix matching of query tree method
An anti-collision algorithm and prefix matching technology, applied in computing, computer components, instruments, etc., can solve performance impact and other problems, achieve the effects of reducing system energy consumption, stable algorithm performance, and improving query efficiency
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0030] The present invention will be further elaborated below in conjunction with the accompanying drawings and specific embodiments.
[0031] Such as figure 1 Shown, a kind of deterministic anti-collision algorithm based on the multi-prefix matching of query tree method of the present invention, comprises the following steps:
[0032] Step 1, the reader / writer reads the query prefix prefix from the stack. In the initial state, the query prefix is an empty string, and the query command is sent; the query commands in the step 1 are respectively CMD_INI and PROBE_EQ, and the command bit sent in the initialization phase CMD_INI, followed by PROBE_EQ, returns the complete ID data when the tag receives the CMD_INI command, and returns the remaining matching data when it receives the PROBE_EQ command.
[0033] Step 2, the tag to be identified within the working range of the reader receives the query command sent by the reader, and gives a matching response according to the query ...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com