{"title":"An ML Approach for Decoding Collision Slots","authors":"-. Schantin. Andreas, C. Ruland","doi":"10.1109/SMARTSYSTECH.2014.7155751","DOIUrl":null,"url":null,"abstract":"The tag inventory process in an EPCglocal Class-1 Generation-2 (EPCglobal Gen2) long-range Radio Frequency Identification (RFID) system is based on Framed Slotted ALOHA (FSA). Collisions between tags are inevitable in an FSA-based system and limit its maximal throughput. In this work we describe a simple Maximum Likelihood (ML) scheme for jointlydecoding R tag replies in a collision-slot, allowing the reader to decode all of the colliding tag replies and greatly increasing the probability of decoding at least on tag reply correctly.","PeriodicalId":309593,"journal":{"name":"Smart SysTech 2014; European Conference on Smart Objects, Systems and Technologies","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Smart SysTech 2014; European Conference on Smart Objects, Systems and Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SMARTSYSTECH.2014.7155751","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The tag inventory process in an EPCglocal Class-1 Generation-2 (EPCglobal Gen2) long-range Radio Frequency Identification (RFID) system is based on Framed Slotted ALOHA (FSA). Collisions between tags are inevitable in an FSA-based system and limit its maximal throughput. In this work we describe a simple Maximum Likelihood (ML) scheme for jointlydecoding R tag replies in a collision-slot, allowing the reader to decode all of the colliding tag replies and greatly increasing the probability of decoding at least on tag reply correctly.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
