专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20100259366A1 METHOD FOR PREVENTING COLLISION OF RFID TAGS IN AN RFID SYSTEM 有权
标题翻译：用于防止RFID标签在RFID系统中的碰撞的方法
公开(公告)号：US20100259366A1
公开(公告)日：2010-10-14
申请号：US12740635
申请日：2008-07-15
申请人： Hongai Jiao , Jian Zhang , Jiang Du
发明人： Hongai Jiao , Jian Zhang , Jiang Du
IPC分类号： H04Q5/22
CPC分类号： G06K7/0008 , G06K7/10019
摘要： The method includes: a reader begins to count the tags, and waits for feedback of the tags; the tags are split into two subsets if the tags feedback the collision, the tags of one of the subsets feedback, the tags of the other subset begin to feedback when the tags of one of the subsets complete the count; when the collision occurs in the course of feedback, then the split continues until all the tags are completed the count; the tags of many branches are at least once split simultaneously when the tags of the subsets are split.
摘要翻译：该方法包括：读者开始对标签进行计数，并等待标签的反馈; 如果标签反馈冲突，则一个子集反馈的标签，另一个子集的标签在其中一个子集的标签完成计数时开始反馈，则将标签分成两个子集; 当在反馈过程中发生碰撞时，分裂继续，直到所有标签完成计数; 当子集的标签被拆分时，许多分支的标签至少一次分割。

2. 发明授权

US08890659B2 Method for preventing collision of RFID tags in an RFID system 有权
标题翻译：用于防止RFID标签在RFID系统中的碰撞的方法
公开(公告)号：US08890659B2
公开(公告)日：2014-11-18
申请号：US12740635
申请日：2008-07-15
申请人： Hongai Jiao , Jian Zhang , Jiang Du
发明人： Hongai Jiao , Jian Zhang , Jiang Du
IPC分类号： H04Q5/22 , G06K7/10 , G06K7/00
CPC分类号： G06K7/0008 , G06K7/10019
摘要： The method includes: a reader begins to count the tags, and waits for feedback of the tags; the tags are split into two subsets if the tags feedback the collision, the tags of one of the subsets feedback, the tags of the other subset begin to feedback when the tags of one of the subsets complete the count; when the collision occurs in the course of feedback, then the split continues until all the tags are completed the count; the tags of many branches are at least once split simultaneously when the tags of the subsets are split.
摘要翻译：该方法包括：读者开始对标签进行计数，并等待标签的反馈; 如果标签反馈冲突，则一个子集反馈的标签，另一个子集的标签在其中一个子集的标签完成计数时开始反馈，则将标签分成两个子集; 当在反馈过程中发生碰撞时，分裂继续，直到所有标签完成计数; 当子集的标签被拆分时，许多分支的标签至少一次分割。

3. 发明授权

US08310343B2 Binary tree method for multi-tag anti-collision 有权
标题翻译：用于多标签防碰撞的二叉树方法
公开(公告)号：US08310343B2
公开(公告)日：2012-11-13
申请号：US12742715
申请日：2008-07-11
申请人： Huan Zhou , Hongai Jiao , Jian Zhang
发明人： Huan Zhou , Hongai Jiao , Jian Zhang
IPC分类号： H04Q5/22 , G08B13/14 , H04W4/00 , G06K19/06
CPC分类号： G06K7/0008 , G06K7/10029 , G06K7/10049
摘要： A binary tree method for avoiding collision of multiple tags, comprising: during inventorying tags, a reader sending a re-splitting instruction to the tags and entering a next time slot for reception if the reader does not receive any reply information from the tags in a specified time slot and one of the following conditions is satisfied: the reader received incorrectly reply information from the tags in the former time slot, or a re-splitting instruction was sent in the former time slot; and when the tags receive the re-splitting instruction, for tags whose counter values are not 1, the counter values remaining unchanged, and tags whose counter values are 1 splitting into two subsets 0 and 1, and those counter-0 tags replying to the reader. With the present invention, the inventorying flow of Binary Tree is optimized, the inventorying efficiency is improved, and the whole flow becomes more reasonable.
摘要翻译：一种用于避免多个标签的冲突的二叉树方法，包括：在清点标签期间，如果读取器没有从标签中接收到任何回复信息，则读者向标签发送重新分割指令并输入下一个时隙用于接收指定的时隙和满足以下条件之一：读卡器从前一时隙中的标签接收到错误的应答信息，或者在前一时隙发送重新分割指令; 并且当标签接收到重新分割指令时，对于其计数器值不为1的标签，计数器值保持不变，其计数器值为1的标签分为两个子集0和1，以及回复到读者。利用本发明，优化了二叉树的库存流程，提高了库存效率，整个流程变得更加合理。

4. 发明申请

US20100271185A1 BINARY TREE METHOD FOR MULTI-TAG ANTI-COLLISION 有权
标题翻译：用于多标签抗碰撞的二叉树方法
公开(公告)号：US20100271185A1
公开(公告)日：2010-10-28
申请号：US12742715
申请日：2008-07-11
申请人： Huan Zhou , Hongai Jiao , Jian Zhang
发明人： Huan Zhou , Hongai Jiao , Jian Zhang
IPC分类号： H04Q5/22
CPC分类号： G06K7/0008 , G06K7/10029 , G06K7/10049
摘要： A binary tree method for avoiding collision of multiple tags, comprising: during inventorying tags, a reader sending a re-splitting instruction to the tags and entering a next time slot for reception if the reader does not receive any reply information from the tags in a specified time slot and one of the following conditions is satisfied: the reader received incorrect reply information from the tags in the former time slot, or a re-splitting instruction was sent in the former time slot; and when the tags receive the re-splitting instruction, for tags whose counter values are not 1, the counter values remaining unchanged, and tags whose counter values are 1 splitting into two subsets 0 and 1, and those counter-0 tags replying to the reader. With the present invention, the inventorying flow of Binary Tree is optimized, the inventorying efficiency is improved, and the whole flow becomes more reasonable.
摘要翻译：一种用于避免多个标签的冲突的二叉树方法，包括：在清点标签期间，如果读取器没有从标签中接收到任何回复信息，则读者向标签发送重新分割指令并输入下一个时隙用于接收指定的时隙和满足以下条件之一：读卡器从前一时隙的标签接收到不正确的应答信息，或者在前一时隙发送重新分割指令; 并且当标签接收到重新分割指令时，对于其计数器值不为1的标签，计数器值保持不变，其计数器值为1的标签分为两个子集0和1，以及回复到读者。利用本发明，优化了二叉树的库存流程，提高了库存效率，整个流程变得更加合理。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式