RFID防碰撞算法的研究

随着物联网技术的高速发展,作为其关键技术之一的RFID显得愈为重要。标签碰撞的应用在RFID系统中是不可避免的,因此RFID防碰撞算法是RFID系统中一个重要问题,直接决定了RFID系统可以识别多个标签的能力。目前防碰撞算法在时域上主要可以分为非确定性算法（ALOHA算法）和确定性算法（树形算法）两大类。本文分析了现存的两大类算法中主流的防碰撞算法,总结出两大类算法的优点以及存在的问题。通过MATLAB仿真进一步证明此结论,并总结未来研究中需要继续关注的问题与方向。     

射频识别系统的防冲突算法改进与实现

在射频识别系统中.须采取有效的防冲突算法解决多个标签与阅读器数据交换时引起的数据冲突问题.在对ALOHA算法和二进制算搜索法进行分析的基础上提出一种新的防冲突算法.该算法采取动态互补的二进制树形搜索法,充分利用已得到的冲突信息.有效减小了判决过程中数据的传输量.提高了标签的识别效率.仿真结果表明,改进后的算法可有效解决标签间的冲突.     

Application of ICA-based anti-collision algorithm in RFID system

Data collision problem exists in radio frequency identification (RFID) system when tabs are present in the interrogation zone of a single reader at the same time. Though different anti-collision methods have been proposed, it still needs further study on how to improve the identification ability especially in the interference circumstance. This paper presents a new method based on independent component analysis (ICA) algorithm. Coded division multiple access (CDMA) technology is adopted at the transmitter and the maximum signal to noise ratio is applied at the receiver of the RFID system. The proposed method has been verified by computer simulation which shows that the system can separate different users’ source data correctly based on ICA algorithm and has better performance compared with the traditional CDMA technology.     

RFID防碰撞算法中扩频码特性研究

标签碰撞是射频识别(RFID)技术的常见问题,该问题影响了RFID系统数据通信过程中数据传输的完整性。针对在解决防碰撞问题中新出现的码分多址方法,对Walsh码、m序列和Gold序列的3种扩频码组进行比较,研究在标签防碰撞算法中扩频码的性能。仿真实验结果:m序列和Gold序列在基于码分多址技术的防碰撞算法中性能要好一些。由于m序列互相关性能不是很好,因此在以后的研究中,使用Gold序列效果会更明显。     

基于分组策略的RFID自适应防碰撞算法的研究

针对射频识别系统中的标签碰撞问题,提出了一种基于分组策略的RFID自适应防碰撞算法。该算法在二叉树搜索算法的基础上引入分组策略、后退策略、自适应地选择四叉树搜索策略和动态调整标签碰撞检测过程策略,减少了搜索次数和读写器与标签间的通信量,提高了识别效率。     

Enhanced binary search with cut-through operation for anti-collision in RFID systems

RFID systems allow contactless identification of objects using radio frequency. When there is more than one transponder within the interrogation area of a reader, all the transponders may send data (or tags) at the same time which may lead to mutual interference. This event causes data loss and is referred to as a collision. In this letter, we propose an enhanced binary search with cut-through operation to minimize the anti-collision cost. The analytic results show that the proposed scheme achieves low delay in the collision resolution with low power consumption.     

Framed slotted ALOHA with grouping tactic and binary selection for anti-collision in RFID systems

9%-16.3% compared to other ALOHA-based tag anti-collision algorithms when the number of tags is 1 000.     

Dynamic frame-slotted ALOHA anti-collision algorithm in RFID based on non-linear estimation

We propose an RFID tag anti-collision method using adaptive frame length adjustment. Based on the number of tags identified in the first frame, the original tag population can be estimated by solving a non-linear estimating equation. Subsequent frame lengths can be adaptively adjusted according to the number of remaining tags. The simulation results demonstrate the error rate of the proposed method to be less than 5% – superior to that of existing methods. Compared with the widely used dynamic frame slot ALOHA algorithm – adopted by EPC_C1 G2 standard – tag identification throughput performance increased by 50%.     

基于动态位隙分组盲分离的UHF RFID防碰撞算法

提出一种基于独立成分分析(ICA)和位隙动态分组技术的超高频(UHF)射频识别(RFID)多标签防碰撞算法。利用ICA算法实现多目标的同时识别,利用动态位隙标签分组保证阅读器同时读取的标签数少于或等于其天线数,从而使ICA工作于非欠定状态。理论分析和实验结果表明,该算法的标签识别率远高于传统随机或确定性TDMA RFID防碰撞算法的标签识别率。     

Bi-slotted tree based anti-collision protocols for fast tag identification in RFID systems

This paper is intended to present bi-slotted tree based RFID tag anti-collision protocols, bi-slotted query tree algorithm (BSQTA) and bi-slotted collision tracking tree algorithm (BSCTTA). Diminishing prefix overhead and iteration overhead is a significant issue to minimize the anti-collision cost. For fast tag identification, BSQTA and BSCTTA use time divided responses depending on whether the collided bit is `0' or `1' at each tag ID. According to the simulation results, BSQTA and BSCTTA require less time consumption for tag identification than the other tree based RFID tag anti-collision protocols     

自适应维分编码RFID防碰撞算法研究及优化

首先提出MDDC（multi-dimension division code）维分编码的算法。该算法在阅读器范围内标签碰撞较多时,阅读器呼叫每个标签的平均次数C(n)趋近4/3,呼叫每个标签所传输的数据量趋近于一个较小的常数。MDDC维分编码算法在碰撞次数较少时的平均呼叫次数、平均发送数据量相对较大,又提出自适应MDDC维分编码及其优化算法。阅读器根据范围内的标签数目自适应地降低维分编码的维数并对标签重新编码,大大降低了搜素较少标签时的平均呼叫次数和平均数据量。因此,自适应 MDDC 维分编码及优化算法无论在标签较多碰撞和较少碰撞时,都能很好地提高搜索的效率。     

Collision alignment: an RFID anti-collision algorithm assisted by orthogonal signal detection and analogy principle

The replenishment of resource management problem is tough and necessary in RFID system, which requires tags to report the existing information uninterruptedly for guaranteeing goods supply. However, the random or synchronous reply may lead to collision, further, make the system low efficiency. Based on the fusion method between orthogonal code compiling category ID and analogy principle, we present the collision tolerance protocol UACP to identify tags efficiently, which contains UCOM and ACAM mechanisms. UCOM relies on orthogonal signals’ correlation to realize the tolerance and accurate category identification by making a comparison between the collision and the whole elements. ACAM depends on the analogy principle to estimate the existing number from microcosmic to macrocosmic only using the singleton slots, and the tags can transmit one-bit affirming message after a series of ACK commands. UACP also analyses some factors, such as the permutation and combination of multiple sets orthogonal codes, asynchronous code offset, signal missing rate, signal misjudgment probability, and shows the advantages on slot utilization rate, identification rate and time efficiency compared with other algorithms. After adopting BPSK modulation and USRP platform, UACP is verified the time-efficiency increasing of 25–60%.     

A fast tag identification anti‐collision algorithm for RFID systems

In this work, we propose a highly efficient binary tree‐based anti‐collision algorithm for radio frequency identification (RFID) tag identification. The proposed binary splitting modified dynamic tree (BS‐MDT) algorithm employs a binary splitting tree to achieve accurate tag estimation and a modified dynamic tree algorithm for rapid tag identification. We mathematically evaluate the performance of the BS‐MDT algorithm in terms of the system efficiency and the time system efficiency based on the ISO/IEC 18000‐6 Type B standard. The derived mathematical model is validated using computer simulations. Numerical results show that the proposed BS‐MDT algorithm can provide the system efficiency of 46% and time system efficiency of 74%, outperforming all other well‐performed algorithms.     

调频连续波雷达及其在汽车防撞系统中的应用

为了保障汽车驾驶的安全性,可以在汽车上安装汽车防撞信息系统。汽车防撞信息系统一般采用毫米波测距雷达,并且为调频连续波(FMCW)雷达。比较了毫米波脉冲和FMCW雷达汽车防撞系统的基本工作原理。具体地论述了FMCW雷达的基本结构和硬件实现方式;最后简单介绍了该种雷达在国内外的发展状况以及在汽车防撞系统中的应用。     

A cooperative Bayesian and lower bound estimation in dynamic framed slotted ALOHA algorithm for RFID systems

A novel estimation scheme that combines Bayesian and lower bound estimating radio frequency identification tag population size is proposed. The developed methodology is based on the fusion between the Bayesian and lower bound estimating techniques. It turns out that the fusion rule is built up thanks to an existing linear relationship between the cited techniques. Simulation results show that the developed technique significantly improves the accuracy of the estimating tag quantity and presents less estimation error. Also, the resulting advanced dynamic framed slotted ALOHA protocol considerably improves the performance and efficiency of the radio frequency identification anti‐collision compared with the most recent protocols using others estimating methods.     

Computer algorithm for optimal control of linear systems with assigned eigenvalues

An efficient computer algorithm for designing optimal controllers of linear systems to have assigned closed-loop eigenvalues based on the eigenvector solution of the matrix Riccati equation is presented. The algorithm is illustrated with an example.     

A rapid and automatic image registration algorithm with subpixelaccuracy

A number of digital imaging techniques in medicine require the combination of multiple images. Using these techniques, it is essential that the images be adequately aligned and registered prior to addition, subtraction, or any other combination of the images. This paper describes an alignment routine developed to register an image of a fixed object containing a global offset error, rotation error, and magnification error relative to a second image. The described routine uses sparsely sampled regional correlation in a novel way to reduce computation time and avoid the use of markers and human interaction. The result is a fast, robust, and automatic alignment algorithm, with accuracy better than about 0.2 pixel in a test with clinical computed radiography images     

一种快速的压缩感知信号重构算法

重构算法是压缩感知技术的重要环节之一,文中针对现有重构算法收敛速度较慢的问题,提出了一种适用于压缩感知的快速重构算法。该方法的思想是在求解过程中,设计一种有效的步长迭代方案,以此来更新由梯度Lipschitz指数确定的迭代步长,再利用更新后的步长对原始信号的稀疏域表示向量进行迭代收缩,提高收敛速度。实验结果表明,相比传统的正交匹配追踪(OMP)算法、固定步长的l1范数重构算法,该方法在保证信号恢复精度的前提下,具有更快的收敛速度和更高的重构精度。     

A new algorithm for rapid tracking of approximate maximum power point in photovoltaic systems

This paper presents a new algorithm for tracking maximum power point in photovoltaic systems. This is a fast tracking algorithm, where an initial approximation of maximum power point is (MPP) quickly achieved using a variable step-size. Subsequently, the exact maximum power point can be targeted using any conventional method like the hill-climbing or incremental conductance method. Thus, the drawback of a fixed small step-size over the entire tracking range is removed, resulting in reduced number of iterations and much faster tracking compared to conventional methods. The strength of the algorithm comes from the fact that instead of tracking power, which does not have a one-to-one relationship with duty cycle, it tracks an intermediate variable /spl beta/, which has a monotonically increasing, one-to-one relationship. The algorithm has been verified on a photovoltaic system modeled in Matlab-Simulink software. The algorithm significantly improves the efficiency during the tracking phase as compared to a conventional algorithm. It is especially suitable for fast changing environmental conditions. The proposed algorithm can be implemented on any fast controller such as the digital signal processor. All the details of this study are presented.