An improved non-uniform fast Fourier transform method for radio imaging of coronal mass ejections

Radioheliographs can obtain solar images at high temporal and spatial resolution,with a high dynamic range.These are among the most important instruments for studying solar radio bursts,understanding solar eruption events,and conducting space weather forecasting.This study aims to explore the effective use of radioheliographs for solar observations,specifically for imaging coronal mass ejections(CME),to track their evolution and provide space weather warnings.We have developed an imaging simulation program based on the principle of aperture synthesis imaging,covering the entire data processing flow from antenna configuration to dirty map generation.For grid processing,we propose an improved non-uniform fast Fourier transform(NUFFT)method to provide superior image quality.Using simulated imaging of radio coronal mass ejections,we provide practical recommendations for the performance of radioheliographs.This study provides important support for the validation and calibration of radioheliograph data processing,and is expected to profoundly enhance our understanding of solar activities.

Parameter Estimation of Sub-/Super-synchronous Oscillation Based on Interpolated All-phase Fast Fourier Transform with Optimized Window Function

In recent years,with increasing amounts of renew-able energy sources connecting to power grids,sub-/super-syn-chronous oscillations(SSOs)occurred more frequently.Due to the time-variant nature of SsO magnitudes and frequencies,as well as the mutual interferences among SsO modes with close frequencies,the accurate parameter estimation of SsO has be-come a particularly challenging topic.To solve this issue,this paper proposes an improved spectrum analysis method by im-proving the window function and a spectrum correction method to achieve higher precision.First,by aiming at the sidelobe characteristics of the window function as evaluation criteria,a combined cosine function is optimized using a genetic algorithm(GA).Furthermore,the obtained window function is self-con-volved to extend its excellent characteristics,which have better performance in reducing mutual interference from other SSO modes.Subsequently,a new form of interpolated all-phase fast Fourier transform(IpApFFT)using the optimized window func-tion is proposed to estimate the parameters of SsO.This meth-od allows for phase-unbiased estimation while maintaining algo-rithmic simplicity and expedience.The performance of the pro-posed method is demonstrated under various conditions,com-pared with other estimation methods.Simulation results vali-date the effectiveness and superiority of the proposed method.

A Deepfake Detection Algorithm Based on Fourier Transform of Biological Signal

Deepfake-generated fake faces,commonly utilized in identity-related activities such as political propaganda,celebrity impersonations,evidence forgery,and familiar fraud,pose new societal threats.Although current deepfake generators strive for high realism in visual effects,they do not replicate biometric signals indicative of cardiac activity.Addressing this gap,many researchers have developed detection methods focusing on biometric characteristics.These methods utilize classification networks to analyze both temporal and spectral domain features of the remote photoplethysmography(rPPG)signal,resulting in high detection accuracy.However,in the spectral analysis,existing approaches often only consider the power spectral density and neglect the amplitude spectrum—both crucial for assessing cardiac activity.We introduce a novel method that extracts rPPG signals from multiple regions of interest through remote photoplethysmography and processes them using Fast Fourier Transform(FFT).The resultant time-frequency domain signal samples are organized into matrices to create Matrix Visualization Heatmaps(MVHM),which are then utilized to train an image classification network.Additionally,we explored various combinations of time-frequency domain representations of rPPG signals and the impact of attention mechanisms.Our experimental results show that our algorithm achieves a remarkable detection accuracy of 99.22%in identifying fake videos,significantly outperforming mainstream algorithms and demonstrating the effectiveness of Fourier Transform and attention mechanisms in detecting fake faces.

Performance of Continuous Wavelet Transform over Fourier Transform in Features Resolutions

This study presents a comparative analysis of two image enhancement techniques, Continuous Wavelet Transform (CWT) and Fast Fourier Transform (FFT), in the context of improving the clarity of high-quality 3D seismic data obtained from the Tano Basin in West Africa, Ghana. The research focuses on a comparative analysis of image clarity in seismic attribute analysis to facilitate the identification of reservoir features within the subsurface structures. The findings of the study indicate that CWT has a significant advantage over FFT in terms of image quality and identifying subsurface structures. The results demonstrate the superior performance of CWT in providing a better representation, making it more effective for seismic attribute analysis. The study highlights the importance of choosing the appropriate image enhancement technique based on the specific application needs and the broader context of the study. While CWT provides high-quality images and superior performance in identifying subsurface structures, the selection between these methods should be made judiciously, taking into account the objectives of the study and the characteristics of the signals being analyzed. The research provides valuable insights into the decision-making process for selecting image enhancement techniques in seismic data analysis, helping researchers and practitioners make informed choices that cater to the unique requirements of their studies. Ultimately, this study contributes to the advancement of the field of subsurface imaging and geological feature identification.

Efficient coherent detection of maneuvering targets based on location rotation transform and non-uniform fast Fourier transform

Long-term coherent integration can remarkably improve the ability of detection and motion parameter estimation of radar for maneuvering targets.However,the linear range migration,quadratic range migration(QRM),and Doppler frequency migration within the coherent processing interval seriously degrade the detection and estimation performance.Therefore,an efficient and noise-resistant coherent integration method based on location rotation transform(LRT)and non-uniform fast Fourier transform(NuFFT)is proposed.QRM is corrected by the second-order keystone transform.Using the relationship between the rotation angle and Doppler frequency,a novel phase compensation function is constructed.Motion parameters can be rapidly estimated by LRT and NuFFT.Compared with several representative algorithms,the proposed method achieves a nearly ideal detection performance with low computational cost.Finally,experiments based on measured radar data are conducted to verify the proposed algorithm.

量化噪声对插值fast Fourier transform谐波估计的影响

插值fast Fourier transform(FFT)算法是对谐波频率、幅度和相位三参数进行精确估计的常见方法.信号中的噪声无疑会影响插值FFT算法的谐波估计结果.有文献讨论过信号中的白噪声对插值FFT算法谐波估计结果的影响,尚没有文献讨论过A/D(analog-to-digital)量化噪声对插值FFT算法谐波估计结果的影响.本文首先对插值FFT谐波估计算法做了简单介绍,接着对A/D量化噪声的特点进行了分析研究.在此基础上,仔细研究了量化噪声对插值FFT谐波估计方法的影响程度——给出了计算模型、进行了大量仿真计算、得出了量化噪声对谐波频率、幅度和相位3参数估计结果影响程度的结论.相信所得结论对电路设计中的A/D器件、信号调理器件等的选型有指导意义.

基于插值fast Fourier transform谐波分析的桥梁状态评估方法

桥梁的环境振动信号包含了各种环境噪声成分,如何从噪声影响中提取桥梁的真实自振频率,并进行桥梁状态评估是亟待解决的问题.本文对环境激励下的大跨桥梁响应信号进行了研究,根据环境激励在低频段近于平白噪声以及线性系统在环境激励下,各输出点测量信号之间相关函数与结构的脉冲响应函数具有相同的数学表达式——均是主频正弦函数的叠加这一特点,建立了插值fast Fourier transform(FFT)频谱校正技术分析各测点相关函数的方法.该方法能在白噪声背景下精确提取桥梁振动频率、幅度和相位等模态参数,简单实用,不仅能在线识别参数,而且对桥梁单点激励和多点同时激励均适用.将校正后的主频与三维有限元计算结果相对比,能对桥梁结构整体状态和工作性能进行评估.最后,一座实桥动力试验和计算结果证明了该方法的能有效用于运营条件下桥梁状态的评估.

Cardiac arrhythmias detection in an ECG beat signal using fast fourier transform and artificial neural network

Cardiac Arrhythmias shows a condition of abnor-mal electrical activity in the heart which is a threat to humans. This paper presents a method to analyze electrocardiogram (ECG) signal, extract the fea-tures, for the classification of heart beats according to different arrhythmias. Data were obtained from 40 records of the MIT-BIH arrhythmia database (only one lead). Cardiac arrhythmias which are found are Tachycardia, Bradycardia, Supraventricular Tachycardia, Incomplete Bundle Branch Block, Bundle Branch Block, Ventricular Tachycardia. A learning dataset for the neural network was obtained from a twenty records set which were manually classified using MIT-BIH Arrhythmia Database Directory and docu- mentation, taking advantage of the professional experience of a cardiologist. Fast Fourier transforms are used to identify the peaks in the ECG signal and then Neural Networks are applied to identify the diseases. Levenberg Marquardt Back-Propagation algorithm is used to train the network. The results obtained have better efficiency then the previously proposed methods.

A fast acquisition method of DSSS signals using differential decoding and fast Fourier transform

In low earth orbit (LEO) satellite or missile communication scenarios, signals may experience extremely large Doppler shifts and have short visual time. Thus, direct sequence spread spectrum (DSSS) systems should be able to achieve acquisition in a very short time in spite of large Doppler frequencies. However, the traditional methods cannot solve it well. This work describes a new method that uses a differential decoding technique for Doppler mitigation and a batch process of FFT (fast Fourier transform) and IFFT (invert FFT) for the purpose of parallel code phase search by frequency domain correlation. After the code phase is estimated, another FFT process is carried out to search the Doppler frequency. Since both code phase and Doppler frequency domains are searched in parallel, this architecture can provide acquisition fifty times faster than conventional FFT methods. The performance in terms of the probability of detection and false alarm are also analyzed and simulated, showing that a signal-to-noise ratio (SNR) loss of 3 dB is introduced by the differential decoding. The proposed method is an efficient way to shorten the acquisition time with slightly hardware increasing.

A high performance fast-Fourier-transform spectrum analyzer for measuring spin noise spectrums

A high performance fast-Fourier-transform (FFT) spectrum analyzer, which is developed for measure spin noise spectrums, is presented in this paper. The analyzer is implemented with a field-programmable-gate-arrays (FPGA) chip for data and command management. An analog-to-digital-convertor chip is integrated for analog signal acquisition. In order to meet the various requirements of measuring different types of spin noise spectrums, multiple operating modes are designed and realized using the reprogrammable FPGA logic resources. The FFT function is fully managed by the programmable resource inside the FPGA chip. A 1 GSa/s sampling rate and a 100 percent data coverage ratio with non-dead-time are obtained. 30534 FFT spectrums can be acquired per second, and the spectrums can be on-board accumulated and averaged. Digital filters, multi-stage reconfigurable data reconstruction modules, and frequency down conversion modules are also implemented in the FPGA to provide flexible real-time data processing capacity, thus the noise floor and signals aliasing can be suppressed effectively. An efficiency comparison between the FPGA-based FFT spectrum analyzer and the software-based FFT is demonstrated, and the high performance FFT spectrum analyzer has a significant advantage in obtaining high resolution spin noise spectrums with enhanced efficiency.

Comparison of computation time for estimation of dominant frequency of atrial electrograms: Fast fourier transform, blackman tukey, autoregressive and multiple signal classification

Dominant frequency (DF) of electrophysiological data is an effective approach to estimate the activation rate during Atrial Fibrillation (AF) and it is important to understand the pathophysiology of AF and to help select candidate sites for ablation. Frequency analysis is used to find and track DF. It is important to minimize the catheter insertion time in the atria as it contributes to the risk for the patients during this procedure, so DF estimation needs to be obtained as quickly as possible. A comparison of computation tim- es taken for spectrum estimation analysis is presented in this paper. Fast Fourier Transform (FFT), Blackman-Tukey (BT), Autoregressive (AR) and Multiple Signal Classification (MUSIC) methods are used to obtain the frequency spectrum of the signals. The time to produce DF was measured for each method. The method which takes the shortest time for analysis is selected for real time application purpose.

A sapphire fibre thermal probe based on fast Fourier transform and phase-lock loop

A sapphire fibre thermal probe with Cr^3＋ ion-doped end is developed by using the laser heated pedestal growth method. The fluorescence thermal probe offers advantages of compact structure, high performance and ability to withstand high temperature in a detection range from room temperature to 450℃. Based on the fast Fourier transform （FFT）, the fluorescence lifetime is obtained from the tangent function of phase angle of the non-zeroth terms in the FFT result. This method has advantages such as quick calculation, high accuracy and immunity to the background noise. This FFT method is compared with other traditional fitting methods, indicating that the standard deviation of the FFT method is about half of that of the Prony method and about 1/6 of that of the log-fit method. And the FFT method is immune to the background noise involved in a signal. So, the FFT method is an excellent way of processing signals. In addition, a phase-lock amplifier can effectively suppress the noise.

Fast Fourier Transform Approximation of Foreign Currency Option Pricing Based on Exponential Lévy Model

To study the approximation of foreign currency option prices when the underlying assets＇ price dynamics are described by exponential Lévy processes, the convolution representations for option pricing formulas were given, and then the fast Fourier transform （FFT） algorithm was used to get the approximate values of option prices. Finally, a numerical example was given to demonstrate the calculate steps to the option price by FFT.

Combining Cubic Spline Interpolation and Fast Fourier Transform to Extend Measuring Range of Reflectometry

The reflectometry is a common method used to measure the thickness of thin films. Using a conventional method,its measurable range is limited due to the low resolution of the current spectrometer embedded in the reflectometer.We present a simple method, using cubic spline interpolation to resample the spectrum with a high resolution,to extend the measurable transparent film thickness. A large measuring range up to 385 m in optical thickness is achieved with the commonly used system. The numerical calculation and experimental results demonstrate that using the FFT method combined with cubic spline interpolation resampling in reflectrometry, a simple,easy-to-operate, economic measuring system can be achieved with high measuring accuracy and replicability.

Fast Fourier Transform of Multi-Assets Options under Economic Recession Induced Uncertainties

A Fast Fourier transform approach has been presented by Carr & Madan (2009) on a single underlying asset. In this current research paper, we present fast Fourier transform algorithm for the valuation of Multi-asset Options under Economic Recession Induced Uncertainties. The issue of multi-dimension in both finite and infinite case of Options is part of the focus of this research. The notion of economic recession was incorporated. An intuition behind the introduction of recession induced volatility uncertainty is revealed by huge volatility variation during the period of economic recession compared to the period of recession-free. Nigeria economic recession outbreak in 2016 and its effects on the uncertainty of the payoffs of Nigeria Stocks Exchange (NSE) among other investments was among the motivating factors for proposing economic recession induced volatility in options pricing. The application of the proposed Fast Fourier Transform algorithm in handling multi-assets options was shown. A new result on options pricing was achieved and capable of yielding efficient option prices during and out of recession. Numerical results were presented on assets in 3-dimensions as an illustration taking Black Scholes prices as a bench mark for method effectiveness comparison. The key findings of this research paper among other crucial contributions could be seen in computational procedure of options valuation in multi-dimensions and uncertainties in options payoffs under the exposure of economic recession.

FAST FOURIER TRANSFORMS ON BINARY FIELDS

We give a unified treatment of Fast Fourier Transforms for UDMD systems which contains, as special cases, Fast Fourier algorithms for character groups of many subgroups associated with binary fields.

Theory and algorithms for two-dimensional warped discrete Fourier transform

In this paper, the two-dimensional Warped Discrete Fourier Transform （2-D WDFT） is developed based on the concept of the 1-D WDFT. An exact computation algorithm is developed for 2-D WDFT based on matrix factorizing with special structure. A fast algorithm is then proposed to reduce greatly the computational complexity of the inverse 2-D WDFT. Finally, numerical examples are given to show the efficiency of the proposed approach.

Fast GNSS Acquisition Algorithm Based on SFFT with High Noise Immunity

The Global Navigation Satellite System(GNSS)has been widely used in various fields.To achieve positioning,the receiver must first lock the satellite signal.This is a complicated and expensive process that consumes a lot of resources of the receiver.For this reason,this paper proposes a new fast acquisition algorithm with High Signal-tonoise ratio(SNR)performance based on sparse fast Fourier transform(HSFFT).The algorithm first replaces the IFFT process of the traditional parallel code phase capture algorithm with inverse sparse fast Fourier transform(ISFFT)with better computing performance,and then uses linear search combined with code phase discrimination to replace the positioning loop and the estimation loop with poor noise immunity in ISFFT.Theoretical analysis and simulation results show that,compared with the existing SFFT parallel code phase capture algorithm,the calculation amount of this algorithm is reduced by 19%,and the SNR performance is improved by about 5dB.Compared with the classic FFT parallel code phase capture algorithm,the calculation amount of the algorithm in this paper is reduced by 43%,and when the capture probability is greater than 95%,the SNR performance of the two is approximately the same.

Application of short-time Fourier transform to high-rise frame structural-health monitoring based on change of inherent frequency over time

The high-rise frame structure has become more and more widespread, like its damage from the complication of the environment. The traditional method of damage detection, which is only suitable for the stationary signal, does not apply to a high-rise frame structure because its damage signal is non-stationary. Thus, this paper presents an application of the short-time Fourier transform(STFT) to damage detection of high-rise frame structures. Compared with the fast Fourier transform, STFT is found to be able to express the frequency spectrum property of the time interval using the signal within this interval. Application of STFT to analyzing a Matlab model and the shaking table test with a twelve-story frame-structure model reveals that there is a positive correlation between the slope of the frequency versus time and the damage level. If the slope is equal to or greater than zero, the structure is not damaged. If the slope is smaller than zero, the structure is damaged, and the less the slope is, the more serious the damage is. The damage results from calculation based on the Matlab model are consistent with those from the shaking table test, demonstrating that STFT can be a reliable tool for the damage detection of high-rise frame structures.

Novel Lossless Compression Method Based on the Fourier Transform to Approximate the Kolmogorov Complexity of Elementary Cellular Automata

We propose a novel, lossless compression algorithm, based on the 2D Discrete Fast Fourier Transform, to approximate the Algorithmic (Kolmogorov) Complexity of Elementary Cellular Automata. Fast Fourier transforms are widely used in image compression but their lossy nature exclude them as viable candidates for Kolmogorov Complexity approximations. For the first time, we present a way to adapt fourier transforms for lossless image compression. The proposed method has a very strong Pearsons correlation to existing complexity metrics and we further establish its consistency as a complexity metric by confirming its measurements never exceed the complexity of nothingness and randomness (representing the lower and upper limits of complexity). Surprisingly, many of the other methods tested fail this simple sanity check. A final symmetry-based test also demonstrates our method’s superiority over existing lossless compression metrics. All complexity metrics tested, as well as the code used to generate and augment the original dataset, can be found in our github repository: ECA complexity metrics1.