.png){kind=icon}
返回
Performance Analysis of LDPC-Based RFID Group Coding
.png){kind=icon}
OA
AI
DOI：10.1109/TASE.2016.2604339.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we analyze some recently proposed radio-frequency identification group codes based on low-density parity-check matrices that check the integrity of collections of tagged objects. These codes write additional data to the memory of tags to compute the number of missing tags. By studying the underlying requirements for these computations, we obtain bounds and show that there are simpler group codes that perform better, requiring less tag memory. Note to Practitioners-Radio-frequency identification (RFID) is a well-established wireless technology for inventory, retail, and supply-chain management. Recently, several group codes based on low-density parity-check (LDPC) matrices have been proposed to check the integrity of collections of RFID tagged objects and identify the number of missing tags, if any. Such checks do not require packaging lists or external databases, which can increase the operating speed and reduce costs. In this paper, we analyze these LDPC-based codes, find upper bounds for their performance, and show that there is a simpler approach that outperforms these requiring less memory. This questions the suitability of LDPC-based codes for such RFID applications.
Keyword:
Forward error correction
low-density parity-check (LDPC)
missing object identification
radio-frequency identification (RFID) group coding
rank
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.4
论文数:
5.1K
被引数:
1.6W
机构
引用论文
.png){kind=icon}
没有更多内容
没有更多内容