自适应维分编码维数估计与降维算法

doi:10.3969/j.issn.1001-2400.2014.06.025

J4 ›› 2014, Vol. 41 ›› Issue (6): 148-154.doi: 10.3969/j.issn.1001-2400.2014.06.025

自适应维分编码维数估计与降维算法

李致金¹;周杰¹;乔杰¹;吴文娟²

(1. 南京信息工程大学电子与信息工程学院，江苏南京 210044；
2. 南京林业大学理学院，江苏南京 210017)

收稿日期:2013-05-11 出版日期:2014-12-20 发布日期:2015-01-19
通讯作者: 李致金
作者简介:李致金(1973-)，男，副教授，南京信息工程大学博士研究生，Email: lizhijin@nuist.edu.cn．
基金资助:
江苏省行业专项基金资助项目(20110230)；江苏高校优势学科建设工程资助项目；江苏省气象探测与信息处理重点实验室资助项目；江苏省气象传感网技术工程中心资助项目

Dimensions estimating and the dimension-reducing algorithms for the adaptive multi-dimension division code

LI Zhijin¹;ZHOU Jie¹;QIAO Jie¹;WU Wenjuan²

(1. College of Electronic ＆ Information Engineering, Nanjing University of Information Science ＆ Technology, Nanjing 210044, China;
2. College of Science,Nanjing Forestry University, Nanjing 210017, China)

Received:2013-05-11 Online:2014-12-20 Published:2015-01-19
Contact: LI Zhijin

摘要/Abstract

摘要：

在自适应维分编码原理的基础上，证明了维分编码维重Q=4是最优的．标签越多，维分编码的维数就越多．为此文中给出了标签数量估计和维数估计方法，同时还给出了自适应维分编码降维后标签的降维编码算法以及自适应维分编码的解码算法，为自适应维分编码原理的完善做了正确和必要的研究，因此，完善的自适应维分编码算法无论标签数目较多和标签数目较少时，都能大大提高阅读器搜索标签的效率．

关键词: 自适应维分编码, 维数估计, 降维算法, 解码算法

Abstract:

When the dimension-weight(Q) equals the 4, Multi-Dimension Division Code algorithm is optimal. In this paper, we give the proof according to the principle of the Adaptive Multi-Dimension Division Code. The more the tags, the more the dimensions of the Multi-Dimension Division Code, and so we give the methods for tags estimation and dimensions estimation. Moreover, the algorithm for tags encoding after dimension-reduction is given, and the algorithm for tags decoding is given too. The Adaptive Multi-Dimension Division Code algorithm can significantly improve the efficiency of searching for tags whether in many collisions or few collisions.

Key words: adaptive multi-dimension division code, dimensions estimating, dimension-reducing algorithms, de-code algorithms

中图分类号:

TN92

李致金;周杰;乔杰;吴文娟. 自适应维分编码维数估计与降维算法[J]. J4, 2014, 41(6): 148-154.

LI Zhijin;ZHOU Jie;QIAO Jie;WU Wenjuan. Dimensions estimating and the dimension-reducing algorithms for the adaptive multi-dimension division code[J]. J4, 2014, 41(6): 148-154.

参考文献

［1］高飞. 物联网核心技术——RFID原理与应用［M］. 北京: 人民邮电出版社, 2010: 96-101.
［2］ Finkenzeller K. RFID Handbook: Fundamentals and Applications in Contactless Smart Cards and Identification［M］. 2nd Edition. New Jersey: John Wiley ＆ Sons Limited, 2003.
［3］ Bonuccellim A, Lonettif, Martellif. Tree Slotted Aloha: a New Protocol for Tag Identification in RFID Networks ［C］ //Proceedings of IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks. Piscataway: IEEE, 2006: 603-608.
［4］ Wang C C, Derryberry J, Sleator D D. O(loglogn) Competitive Dynamic Binary Search Trees［C］//Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm. New York: ACM, 2006, 374-383.
［5］ Choi J S, Lee H, Engels D W. Robust and Dynamic Bin Slotted Anti-collision Algorithms in RFID Systems［C］//Proceedings of IEEE International Conference on RFID. Piscataway: IEEE, 2008: 191-198.
［6］王必胜, 张其善. 可并行识别的超高频RFID系统防碰撞性能研究［J］. 通信学报, 2009, 30(6): 108-113.
Wang Bisheng, Zhang Qishan. Study of Anti-collision Performance in Parallelizable Identification UHF RFID System［J］. Journal on Communications, 2009, 30(6): 108-113.
［7］侯晓波, 孙玲玲. RFID二进制防碰撞算法研究与改进［J］. 杭州电子科技大学学报, 2009, 29(3): 16-19.
Hou Xiaobo, Sun Lingling. The Research and Improvement of Binary Anti-collision Algorithm in RFID ［J］. Journal of Hangzhou Electronic Science and Technology University, 2009, 29(3): 16-19.
［8］ Eom J, Lee T. Accurate Tag Estimation for Dynamic Framed-slotted ALOHA in RFID Systems ［J］. IEEE Communications Letters, 2010, 14(1): 60-62.
［9］王雪, 钱志鸿, 胡正超, 等. 基于二叉树的RFID防碰撞算法的研究［J］ . 通信学报, 2010, 31(6): 49-57.
Wang Xue, Qian Zhihong, Hu Zhengchao, et al. Research on RFID Anti-collision Algorithms Based on Binary Trees ［J］. Journal on Communications, 2010, 31(6): 49-57.
［10］李泽兰, 何怡刚, 刘拓晟. 基于广义地址码的RFID防碰撞算法［J］. 计算机测量与控制, 2010, 18(5): 1114-1117.
Li Zelan, He Yigang, Liu Tuosheng. An Anti-collision Algorithm on New Spreading Code in RFID［J］. Computer Measurement ＆ Control, 2010, 18(5): 1114-1117.
［11］李萌, 钱志鸿, 张旭, 等. 基于时隙预测的RFID防碰撞ALOHA算法［J］. 通信学报, 2011, 32(12): 43-50.
Li Meng, Qian Zhihong, Zhang Xu, et al. Slot Predicting Based ALOHA Algorithm for RFID Anti Collision ［J］. Journal on Communications, 2011, 32(12): 43-50.
［12］杨坤, 冷甦鹏. RFID系统时隙不完全竞争防碰撞算法［J］. 计算机工程, 2011, 37(1): 260-262.
Yang Kun, Leng Supeng. Slot Partial Competitive Anti-collision Algorithm for RFID System ［J］. Computer Engineering, 2011, 37(1): 260-262.
［13］朱军, 张元, 卢小冬, 等. 基于分段搜索的多RFID标签抗冲突方法［J］ . 计算机应用研究, 2011, 28(3): 1031-1033.
Zhu Jun, Zhang Yuan, Lu Xiaodong, et al. Anti-collision Method of Multi-RFID Tags Based on Segmental Search［J］. Application Research of Computers, 2011, 28(3): 1031-1033.
［14］李致金, 周杰, 乔杰, 等. 多维编码逐维识别RFID防碰撞算法研究［J］. 数据采集与处理, 2013, 28(3): 319-323.
Li Zhijin, Zhou Jie, Qiao Jie, et al. RFID Anti-collision Algorithms Based on Multi-dimension Code and Gradual-dimension Identification［J］. Journal of Data Acquisition ＆ Processing, 2013, 28(3): 319-323.
［15］李致金, 周杰, 乔杰, 等. 自适应MDDC维分编码RFID防碰撞算法研究［J］. 通信学报, 2013, 34(9): 185-190.
Li Zhijin, Zhou Jie, Qiao Jie, et al. Research on RFID Anti-collision Algorithms Based on Adaptive Multi-Dimension Division Code ［J］. Journal on Communications, 2013, 34(9): 185-190.

[1]	李致金;周杰;乔杰;吴文娟. 自适应多维维分编码RFID防碰撞算法[J]. J4, 2013, 40(6): 162-167+179.
[2]	齐佩汉;司江勃;李赞;高锐. 新型抗噪声不确定度谱分段对消频谱感知算法[J]. J4, 2013, 40(6): 19-24.
[3]	汪涵;朱磊基;施玉松;邢涛;王营冠. 利用循环前缀的OFDM系统定时同步算法[J]. J4, 2013, 40(1): 141-147.
[4]	朱颜锐;田斌;安金坤;孙永军;易克初. 一种快速OFDM调制信号识别算法[J]. J4, 2012, 39(1): 17-22.
[5]	李美玲;袁超伟;田心记;李琳. 删余协作频谱感知性能分析及优化[J]. J4, 2012, 39(1): 115-121.
[6]	宋晓鸥;向新;毕笃彦;陈顺方. 一种适用于认知超宽带的CUSUM频谱感知算法[J]. J4, 2011, 38(6): 173-178.

自适应维分编码维数估计与降维算法

Dimensions estimating and the dimension-reducing algorithms for the adaptive multi-dimension division code

PDF (PC)

赞

可视化

被引次数

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 6

Metrics

本文评价

推荐阅读 10