A tag-collision (or missed reads) in RFID system (Radio Frequency Identification) system degrades the identification efficiency. The so-called tag collision is that a reader cannot identify a tag when more than one ta...A tag-collision (or missed reads) in RFID system (Radio Frequency Identification) system degrades the identification efficiency. The so-called tag collision is that a reader cannot identify a tag when more than one tags respond to a reader at the same time. There are some major anti-collision protocols on resolving tag collision, e.g., ALOHA-based protocol, binary tree protocol, and Query Tree (QT) protocol. Up to date, most tag anti-collision protocols are QT protocols. QT protocols are categorized into M-ary query tree (QT). In the previous literature, choosing M = 3 (i.e., a ternary QT (TQT)) was proven to have the optimum performance for tag identification. Recently, Yeh et al. used parallel response approach to reduce the number of collisions. In this paper, we combine the partial response and TQT to propose an effective parallel response TQT (PRTQT) protocol. Simulation results reveal that our PRTQT outperforms Yeh et al.’s protocol and TQT protocol.展开更多
It is obviously advantageous to use single-pattern cell ternary tree (T-gate)network to obtain ternary logic function. Many scholars at home and abroad have done much in minimization of T-gate realization of multiple-...It is obviously advantageous to use single-pattern cell ternary tree (T-gate)network to obtain ternary logic function. Many scholars at home and abroad have done much in minimization of T-gate realization of multiple-valued logic. It is generally acknowledged that it is necessary to try N! times in order to get an optimal result. However, using the Input Vector Map presented here, which is as simple and convenient as Binary Karnaugh Map, we can get an optimal result by trying only N times.展开更多
文摘A tag-collision (or missed reads) in RFID system (Radio Frequency Identification) system degrades the identification efficiency. The so-called tag collision is that a reader cannot identify a tag when more than one tags respond to a reader at the same time. There are some major anti-collision protocols on resolving tag collision, e.g., ALOHA-based protocol, binary tree protocol, and Query Tree (QT) protocol. Up to date, most tag anti-collision protocols are QT protocols. QT protocols are categorized into M-ary query tree (QT). In the previous literature, choosing M = 3 (i.e., a ternary QT (TQT)) was proven to have the optimum performance for tag identification. Recently, Yeh et al. used parallel response approach to reduce the number of collisions. In this paper, we combine the partial response and TQT to propose an effective parallel response TQT (PRTQT) protocol. Simulation results reveal that our PRTQT outperforms Yeh et al.’s protocol and TQT protocol.
文摘It is obviously advantageous to use single-pattern cell ternary tree (T-gate)network to obtain ternary logic function. Many scholars at home and abroad have done much in minimization of T-gate realization of multiple-valued logic. It is generally acknowledged that it is necessary to try N! times in order to get an optimal result. However, using the Input Vector Map presented here, which is as simple and convenient as Binary Karnaugh Map, we can get an optimal result by trying only N times.
