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.

CEEMD-FastICA-CWT联合瞬态响应阶次的电驱总成噪声源识别

以某增程式电驱动总成为研究对象,提出基于联合算法的噪声分离识别模型。首先,采用互补集合经验模态分解(complementary ensemble empirical mode decomposition,CEEMD)联合快速独立分量分析(fast independent component analysis,FastICA)方法提取纯电模式稳态工况下单一通道噪声信号特征,利用复Morlet小波变换及FFT对各分量信号时频特性进行识别。其次,采用阶次分析法和声能叠加法对稳态分量信号对应的各瞬态响应阶次能量进行对比分析,并结合皮尔逊积矩相关系数(Pearson product moment correlation coefficient,PPMCC)相似性识别确定不同噪声激励源贡献度。结果表明:减速齿副啮合噪声对该增程式电驱总成纯电模式运行噪声整体贡献度最大。

Classification of Electroencephalogram Signals Using LSTM and SVM Based on Fast Walsh-Hadamard Transform

Classification of electroencephalogram(EEG)signals for humans can be achieved via artificial intelligence(AI)techniques.Especially,the EEG signals associated with seizure epilepsy can be detected to distinguish between epileptic and non-epileptic regions.From this perspective,an automated AI technique with a digital processing method can be used to improve these signals.This paper proposes two classifiers:long short-term memory(LSTM)and support vector machine(SVM)for the classification of seizure and non-seizure EEG signals.These classifiers are applied to a public dataset,namely the University of Bonn,which consists of 2 classes–seizure and non-seizure.In addition,a fast Walsh-Hadamard Transform(FWHT)technique is implemented to analyze the EEG signals within the recurrence space of the brain.Thus,Hadamard coefficients of the EEG signals are obtained via the FWHT.Moreover,the FWHT is contributed to generate an efficient derivation of seizure EEG recordings from non-seizure EEG recordings.Also,a k-fold cross-validation technique is applied to validate the performance of the proposed classifiers.The LSTM classifier provides the best performance,with a testing accuracy of 99.00%.The training and testing loss rates for the LSTM are 0.0029 and 0.0602,respectively,while the weighted average precision,recall,and F1-score for the LSTM are 99.00%.The results of the SVM classifier in terms of accuracy,sensitivity,and specificity reached 91%,93.52%,and 91.3%,respectively.The computational time consumed for the training of the LSTM and SVM is 2000 and 2500 s,respectively.The results show that the LSTM classifier provides better performance than SVM in the classification of EEG signals.Eventually,the proposed classifiers provide high classification accuracy compared to previously published classifiers.

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.

量化噪声对插值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)频谱校正技术分析各测点相关函数的方法.该方法能在白噪声背景下精确提取桥梁振动频率、幅度和相位等模态参数,简单实用,不仅能在线识别参数,而且对桥梁单点激励和多点同时激励均适用.将校正后的主频与三维有限元计算结果相对比,能对桥梁结构整体状态和工作性能进行评估.最后,一座实桥动力试验和计算结果证明了该方法的能有效用于运营条件下桥梁状态的评估.

Adaptive modified hough transform track initiator forHFSWR tracking of fast and small targets

High frequency surface wave radar (HFSWR) is well proved to have over the horizon (OTH) detection capability to weak aerial targets, such as concealed airplanes or cruise missiles. The most important problem of detection of fast and small targets using HFSWR is earlier warning, i.e. enlargement of detection range oftargets. Therefore, the detection threshold should be decreased as low as possible, but numerous false alarms are brought about at the same time. On this condition, conventional track initiation techniques, which normally require the probability of false alarm to be at the level of 10-6, will initiate enormous false tracks and lead to abnormal operation of tracking system. An adaptive modified hough transform (AMHT) track initiator is proposed accordingly and the relation of detection range to the performance of track initiator is analyzed in this paper. Simulations are performed to confirm the capability of track initiation to fast and small targets in dense clutter by AMHT track initiator. The tolerable probability of false alarm of detector can reach the level of 10 -3 . And it performs better than track initiator based on modified hough transform (MHT).

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.

Digital Image Watermarking Algorithm Based on Fast Curvelet Transform

A digital image watermarking algorithm based on fast curvelet transform is proposed. Firstly, the carrier image is decomposed by fast curvelet transform, and, the watermarking image is scrambled by Arnold transform. Secondly, the binary watermarking image is embedded into the medium frequency coefficients according to the human visual characteristics and curvelet coefficients. Experiment results show that the proposed algorithm has good performance in both invisibility and security and also has good robustness against the noise, cropping, filtering, JPEG compression and other attacks.

Improve the Nonparametric Image Segmentation with Narrowband Levelset and Fast Gauss Transformation

Nonparametric method based on the mutual information is an efficient technique for the image segmentation. In this method, the image is divided into the internal and external labeled regions, and the segmentation problem constrained by the total length of the region boundaries will be changed into the maximization of the mutual information between the region labels and the image pixel intensities. The maximization problem can be solved by deriving the associated gradient flows and the curve evolutions. One of the advantages for this method does not need to choose the segmentation parameter;another is not sensitive to the noise. By employing the narrowband levelset and Fast Gauss Transformation, the computation time is reduced clearly and the algorithm efficiency is greatly improved.

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 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.

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.

Fast Algorithm for Nonsubsampled Contourlet Transform

多尺度的几何分析(MGA ) 为图象处理作为有效策略被认出了。作为 MGA 的分离工具之一， nonsubsampled contourlet 变换(NSCT ) 广泛地被使用了图象降噪，图象熔化，图象改进，特征抽取等等。然而，处理表演由于它的高冗余性被限制，并且导致集中的计算效率。因此，它的快算法在实践被需要。在这份报纸，我们采用一个优化方向性的过滤器银行(DFB ) 并且把它嵌进 NSCT 当使重建的表演的损失细微时，显著地加速计算速度。试验性的结果证明重建的图象质量能满足人的视觉系统。而且，改进 NSCT 有速度关于若干次比传统的的。图象降噪上的试验性的结果也验证建议方法的可行性和效率。

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.

NEW FAST ALGORITHM OF 2-D DISCRETE COSINE TRANSFORM

In this paper, a new algorithm for the fast computation of a 2-D discrete cosine transform (DCT) is presented. It is shown that the N×N DCT, where N = 2m, can be computed using only N 1-D DCT’s and additions, instead of using 2N 1-D DCT’s as in the conventional row-column approach. Hence the total number of multiplications for the proposed algorithm is only half of that required for the row-column approach, and is also less than that of most of other fast algorithms, while the number of additions is almost comparable to that of others.

A FAST ALGORITHM FOR DISCRETE HARTLEY TRANSFORM OF ARBITRARY LENGTH

DHT of length plq（p is odd and q is arbitrary） is turned into pl DHTs of length qand some additional operations, while the additional operations only involves the computation ofcos-DFT and sin-DFT with length p. If the length of a DHT is p1l1…PNlN2l（P1…,PN are oddprimes）, a fast algorithm is obtained by the similar recursive technique. Therefore, the algorithmcan compute DHT of arbitrary length. The paper also Proves that operations for computingDHT of length N by the algorithm are no more than O（Nlog2N）, when the length is N=pl,operations of the algorithm are fewer than that of other known algorithms.

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.

APPLYING FAST WALSH TRANSFORM TECHNIQUE TO ANALYZE HIGH-SPEED DIGITAL INTEGRAL TRANSMISSION LINES

A new approach, based on the waveform relaxation technique and fast Walsh trans-form, is presented to analyze the coupled loosy transmission lines (CLTL) with arbitrary terminalnetworks. The simulation accuracy of the new method can be greatly improved, the disadvantagewhich always exists in previous methods can be avoided and a considerable saving in time andmemory of CPU is obtained.