On Performance of Sparse Fast Fourier Transform Algorithms Using the Aliasing Filter

Computing the sparse fast Fourier transform (sFFT) has emerged as a critical topic for a long time because of its high efficiency and wide practicability. More than twenty different sFFT algorithms compute discrete Fourier transform (DFT) by their unique methods so far. In order to use them properly, the urgent topic of great concern is how to analyze and evaluate the performance of these algorithms in theory and practice. This paper mainly discusses the technology and performance of sFFT algorithms using the aliasing filter. In the first part, the paper introduces the three frameworks: the one-shot framework based on the compressed sensing (CS) solver, the peeling framework based on the bipartite graph and the iterative framework based on the binary tree search. Then, we obtain the conclusion of the performance of six corresponding algorithms: the sFFT-DT1.0, sFFT-DT2.0, sFFT-DT3.0, FFAST, R-FFAST, and DSFFT algorithms in theory. In the second part, we make two categories of experiments for computing the signals of different SNRs, different lengths, and different sparsities by a standard testing platform and record the run time, the percentage of the signal sampled, and the L0, L1, and L2 errors both in the exactly sparse case and the general sparse case. The results of these performance analyses are our guide to optimize these algorithms and use them selectively.

Research on Multi-Optimizing Strategy for MVB Sporadic Data of Rail Transit On-Board Network

In order to improve real-time of MVB sporadic data communication, we study and analysis MVB sporadic data communication scheduling modelling and collision event arbitration mechanism, the communication maximum arbitration delay is closely related with concurrent message events, binary tree search algorithm mechanism bring out big communication delay, so, we makes use of multi-optimizing strategies, applying dynamically assigned communication of sporadic data and slave frame stuffing of process data, decreasing communication delay of sporadic data and making sure that emergent sporadic data firstly send, it is a good try to optimize real-time of sporadic data.

Improved Binary Tree Search Anti-Collision Algorithm

According to the issue of tag collision in the radio frequency identification technology, this paper proposes a binary tree search anti-collision algorithm, which takes different processing methods according to how many continuous collision. Compared with the dynamic binary tree search algorithm, the improved algorithm reduces the query information send by the reader. At the same time,the algorithm in the process of identifying tags reduces the query information, the query number and tag response times, so as to shorten the recognition time, further improve the search performance.

An Anti-Collision Algorithm for Applications with Massive RFID Tags

Anti-collision is a key technology in systems and applications in which Radio Frequency Identification (RFID) is used since it determines the efficiency of RFID tag identification. Although binary-tree search algorithms can effectively resolve collisions, they may not be very efficient in systems with a large number of RFID tags. In this paper, we propose a new flat-tree anti-collision algorithm and show that the proposed algorithm is more suitable for resolving collisions involving a massive number of RFID tags. Through analysis and experiment, we show that the flat-tree algorithm outperforms the binary-tree search algorithms when the number of RFID tags reaches a massive scale, i.e., exceeds a certain number.

Research on Anti-Collision of Personnel Positioning in Underground Coal Mine Based on RFID

in order to avoid signal collision when two or more tags send recognizable signals to the reader of underground coal mine personnel tracking system , the binary tree search algorithm along with algorithms which improved from them is discussed, an adaptive anti-collision algorithm is proposed .In the respects of time and space the algorithm shows obvious advantages than the binary tree search algorithm ,so the probability of collision reduces greatly and the problem of collision maybe effectively solved.

Segment Slot Partial Competitive Anti-Collision Algorithm for RFID System

Slot partial competitive (SPC) anti-collision algorithm is based on the ISO/IEC18000-6C UHF radio frequency identification (RFID) standard, which introduces dynamic binary tree search technology into the competitive collision avoidance mechanism. Moreover, the SPC algorithm applies the specific technologies to idle slots and collision slots. This paper proposes a segment slot partial competitive (SSPC) anti-collision algorithm based on the SPC, and introduce the segment algorithm. The performances of the dynamic binary tree search, the SPC algorithm and the SSPC algorithm are compared via simulation experiments. Simulation results indicate that the SSPC algorithm is improved significantly.