The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Cette lettre propose l'algorithme d'inférence par allocation effective de slots (ESA-IA). En ESA-IA, les tags qui correspondent au préfixe de la requête-réponse du lecteur dans l'emplacement correspondant ; le groupe d'étiquettes avec un nombre pair de 1 répond dans l'emplacement 0, tandis que le groupe avec un nombre impair de 1 répond dans l'emplacement 1. L'algorithme proposé déduit '00' et '11' s'il y a deux bits entrés en collision dans l'emplacement 0, tout en déduisant « 01 » et « 10 » s'il y a deux bits entrés en collision dans l'emplacement 1. L'ESA-IA diminue la consommation de temps pour l'identification des étiquettes en réduisant le nombre total de requêtes.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
Sungsoo KIM, Yonghwan KIM, Kwangseon AHN, "An Inference Algorithm with Efficient Slot Allocation for RFID Tag Identification" in IEICE TRANSACTIONS on Communications,
vol. E93-B, no. 1, pp. 170-173, January 2010, doi: 10.1587/transcom.E93.B.170.
Abstract: This letter proposes the Inference Algorithm through Effective Slot Allocation (ESA-IA). In ESA-IA, the tags which match the prefix of the reader's request-respond in the corresponding slot; the group of tags with an even number of 1's responds in slot 0, while the group with an odd number of 1's responds in slot 1. The proposed algorithm infers '00' and '11' if there are two collided bits in slot 0, while inferring '01' and '10' if there are two collided bits in slot 1. The ESA-IA decreases the time consumption for tag identification by reducing the overall number of queries.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E93.B.170/_p
Copier
@ARTICLE{e93-b_1_170,
author={Sungsoo KIM, Yonghwan KIM, Kwangseon AHN, },
journal={IEICE TRANSACTIONS on Communications},
title={An Inference Algorithm with Efficient Slot Allocation for RFID Tag Identification},
year={2010},
volume={E93-B},
number={1},
pages={170-173},
abstract={This letter proposes the Inference Algorithm through Effective Slot Allocation (ESA-IA). In ESA-IA, the tags which match the prefix of the reader's request-respond in the corresponding slot; the group of tags with an even number of 1's responds in slot 0, while the group with an odd number of 1's responds in slot 1. The proposed algorithm infers '00' and '11' if there are two collided bits in slot 0, while inferring '01' and '10' if there are two collided bits in slot 1. The ESA-IA decreases the time consumption for tag identification by reducing the overall number of queries.},
keywords={},
doi={10.1587/transcom.E93.B.170},
ISSN={1745-1345},
month={January},}
Copier
TY - JOUR
TI - An Inference Algorithm with Efficient Slot Allocation for RFID Tag Identification
T2 - IEICE TRANSACTIONS on Communications
SP - 170
EP - 173
AU - Sungsoo KIM
AU - Yonghwan KIM
AU - Kwangseon AHN
PY - 2010
DO - 10.1587/transcom.E93.B.170
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E93-B
IS - 1
JA - IEICE TRANSACTIONS on Communications
Y1 - January 2010
AB - This letter proposes the Inference Algorithm through Effective Slot Allocation (ESA-IA). In ESA-IA, the tags which match the prefix of the reader's request-respond in the corresponding slot; the group of tags with an even number of 1's responds in slot 0, while the group with an odd number of 1's responds in slot 1. The proposed algorithm infers '00' and '11' if there are two collided bits in slot 0, while inferring '01' and '10' if there are two collided bits in slot 1. The ESA-IA decreases the time consumption for tag identification by reducing the overall number of queries.
ER -