{"title":"Extended grouping of RFID tags based on progressive edge-growth methods","authors":"Reem Alkanhel, M. Ambroze","doi":"10.1109/ICEDSA.2016.7818544","DOIUrl":null,"url":null,"abstract":"This paper proposes a novel method for recovering missing radio frequency identification (RFID) tag identifiers from a group, based on progressive edge-growth (PEG) methods. Extended grouping of RFID tags allows the recovery of missing tag identifiers without external systems such as databases. Motivated by the properties of Tanner graphs, or equivalently, parity check matrices constructed using PEG methods, extended grouping via the PEG method is proposed. In addition, this paper examines the performance and complexity of Gaussian elimination (GE) and iterative (IT) decoding algorithms. Simulation results are presented, showing that the proposed method can make significant missing recovery enhancements compared to other extended grouping methods.","PeriodicalId":247318,"journal":{"name":"2016 5th International Conference on Electronic Devices, Systems and Applications (ICEDSA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 5th International Conference on Electronic Devices, Systems and Applications (ICEDSA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICEDSA.2016.7818544","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
This paper proposes a novel method for recovering missing radio frequency identification (RFID) tag identifiers from a group, based on progressive edge-growth (PEG) methods. Extended grouping of RFID tags allows the recovery of missing tag identifiers without external systems such as databases. Motivated by the properties of Tanner graphs, or equivalently, parity check matrices constructed using PEG methods, extended grouping via the PEG method is proposed. In addition, this paper examines the performance and complexity of Gaussian elimination (GE) and iterative (IT) decoding algorithms. Simulation results are presented, showing that the proposed method can make significant missing recovery enhancements compared to other extended grouping methods.