An improved algorithm named "twice-FFT" for multi-point intrusion location in distributed Sagnac sensing system is proposed and demonstrated. To find the null-frequencies more accurately and efficiently, a second FFT is applied to the frequency spectrum of the phase signal caused by intrusion. After Gaussian fitting and searching the peak response frequency in the twice-FFT curve, the intrusion...

Quantics tensor train (QTT), a new data-sparse format for one– and multi–dimensional vectors, is based on a bit representation of mode indices followed by a separation of variables. A radix-2 reccurence, that lays behind the famous FFT algorithm, can be efficiently applied to vectors in the QTT format. If input and all intermediate vectors of the FFT algorithm have moderate QTT ranks, the resul...

Abstract— In this paper, we present a novel modified radix-2 algorithm for 512-point fast Fourier transform (FFT) computation and high-speed eight-parallel data-path architecture for multi-gigabit wireless personal area network (WPAN) systems. The proposed FFT processor can provide a high data throughput and low hardware complexity by using eight-parallel data-path and multi-path delay-feedback...

This paper presents a reusable intellectual property (IP) Coordinate Rotation Digital Computer (CORDIC)-based split-radix fast Fourier transform (FFT) core for orthogonal frequency division multiplexer (OFDM) systems, for example, Ultra Wide Band (UWB), Asymmetric Digital Subscriber Line (ADSL), Digital Audio Broadcasting (DAB), Digital Video Broadcasting – Terrestrial (DVB-T), Very High Bitrat...

The new Proposed design has been designed and developed by novel parallel-pipelined Fast Fourier Transform (FFT) architecture. The most important and fastest efficient algorithm is a FFT. FFT is used to computes the Discrete Fourier Transform (DFT). FFT is mainly applied in autocorrelation, spectrum analysis, linear filtering and pattern recognition system. The proposed architectures were desig...

Problem statement: The need for wireless communication has driven the communication systems to high performance. However, the main bottleneck that affects the communication capability is the Fast Fourier Transform (FFT), which is the core of most modulators. Approach: This study presented on-chip implementation of pipeline digit-slicing multiplier-less butterfly for FFT structure. The approach ...

Many applications invoke the Fast Fourier Transform (FFT) on sparse inputs, with most of their Fourier coefficients being very small or equal to zero. Compared with the “dense” FFT algorithms, the input sparsity makes it easier to parallelize the sparse counterparts. In general, sparse FFT algorithms filter input into different frequency bins, and then process the bins separately. Clearly, the ...

• We compute estimates of inefficiency when its distribution is unknown in Stochastic Frontier Models (SFMs) and Data Envelopment Analysis (DEA). Our procedure based on the Fast Fourier Transform (FFT) utilizes empirical characteristic function. The new techniques perform well Monte Carlo experiments. They deliver reasonable results an application to large U.S. banks. Deconvolution DEA scores w...