计算机应用研究2023，Vol.40Issue(12)：3651-3654,4.DOI:10.19734/j.issn.1001-3695.2023.04.0138
基于Walsh码的RFID并行识别碰撞树算法
Collision tree algorithm of RFID parallel identification based on Walsh code
摘要
Abstract
In order to address the problem of inability to parallelly identify multiple tags in the ICT algorithm when there are multiple collision slots and collisions at multiple positions in large-scale tag scenarios,this paper developed a PICT algorithm based on Walsh codes for RFID.The PICT algorithm combined Walsh synchronization orthogonal codes with the collision tree protocol.It used Walsh codes to spread the tags involved in multiple collisions in the ICT algorithm,and tags with unique Walsh codes communicate with the reader through different sub-channels,enabling parallel identification of multiple tags.Theoretical and experimental analyses demonstrate that the PICT algorithm requires fewer total system time slots compared to similar algo-rithms,and it achieves higher system identification efficiency,making it suitable for fast identification of large-scale tags.关键词
射频识别/Walsh同步正交码/碰撞树协议/并行识别/防碰撞Key words
radio frequency identification/Walsh synchronous orthogonal code/collision tree protocol/parallel recogni-tion/anti-collision分类
信息技术与安全科学引用本文复制引用
骆萱,贾小林,顾娅军..基于Walsh码的RFID并行识别碰撞树算法[J].计算机应用研究,2023,40(12):3651-3654,4.基金项目
国家自然科学基金面上项目(61471306) （61471306）
四川省自然科学基金面上项目(2022NSFSC0548) （2022NSFSC0548）
四川省重点研发计划项目(2020YFS0360) （2020YFS0360）
四川省教育厅人才培养质量和教学改革项目(JG2021-1414) （JG2021-1414）
