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.

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.

大点数FFT在“申威26010”上的并行优化

根据“神威·太湖之光”超级计算机所用国产“申威26010”处理器的架构特点和编程规范,提出针对大点数FFT的众核并行优化方案.该方案源自经典的Cooley-Tukey FFT算法,通过将一维大点数数据迭代分解为二维小规模矩阵进行并行加速.为了解决矩阵“列FFT”的读写、转置和计算问题,提出“列均分-行连续”的读写策略,通过对数据进行合理的分配、重排、交换,结合SIMD向量化、旋转因子优化、双缓冲、寄存器通信、跨步传输等优化手段,充分利用了众核处理器的计算资源和传输带宽.实验结果显示,单核组64从核并行程序较主核运行FFTW库,可以达到最高65x、平均48x以上的加速比.

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.

基于双窗全相位FFT的变流器阻抗高精度辨识新方法

为了提高变流器阻抗辨识精度,提出将布莱克曼双窗全相位快速傅里叶变换算法应用于并网变流器输出阻抗高精度辨识之中。首先,建立了dq坐标系下的三相并网变流器的dq阻抗模型;其次,基于原理分析论证了所提方法具有优良的频谱泄漏抑制性能以及较强的抗噪能力,特别适合于在施加小扰动信号背景下非线性特性较强的并网变流器输出阻抗的高精度辨识,并给出变流器阻抗辨识流程;最后,通过仿真试验,验证了方法的优越性。基于布莱克曼双窗全相位快速傅里叶变换的阻抗辨识方法,相比传统方法能以更高的精度辨识出变流器输出阻抗。

可扩展架构的超大点数FFT处理器设计

面向合成孔径雷达、遥感、电子对抗等领域研究了一款高性能的超大点数快速傅里叶变换(FFT)处理器。文中提出了一种可扩展架构,即针对不同的应用场景可以动态实时调整FFT算法的基数以及处理点数;存储器划分为16个存储模块,可以通过产生无冲突地址进行访问,输出与输入数据帧可以共享同一存储器,具备高效存储器特征。FFT运算采用并行流水线排布,当采用高基算法时,可高并行度访问存储器,实现并行计算,从而获得明显的实时性优势。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.

Enhanced Wideband Frequency Estimation via FFT: Leveraging Polynomial Interpolation and Array Indexing

Accurate frequency estimation in a wideband digital receiver using the FFT algorithm encounters challenges, such as spectral leakage resulting from the FFT’s assumption of signal periodicity. High-resolution FFTs pose computational demands, and estimating non-integer multiples of frequency resolution proves exceptionally challenging. This paper introduces two novel methods for enhanced frequency precision: polynomial interpolation and array indexing, comparing their results with super-resolution and scalloping loss. Simulation results demonstrate the effectiveness of the proposed methods in contemporary radar systems, with array indexing providing the best frequency estimation despite utilizing maximum hardware resources. The paper demonstrates a trade-off between accurate frequency estimation and hardware resources when comparing polynomial interpolation and array indexing.

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.

基于FFT和Masking的实时语音通话降噪算法

针对语音通话质量的提升问题,提出一种基于快速傅里叶变换(Fast Fourier Transform,FFT)和Masking技术的实时语音通话降噪算法。首先,提出一个实时语音通话降噪的基本框架,并研究了帧分割、窗函数处理及FFT的数学原理。其次,阐述了基于人耳听觉特性的Masking方法及其在频域中的应用。最后,通过逆快速傅里叶变换(Inverse Fast Fourier Transform,IFFT)将信号转换回时域,并进行实验分析。实验结果表明,该降噪算法可以有效改善语音的清晰度和整体感知质量。

一种二级分段PMF-FFT卫星信号捕获算法

针对在小点数快速傅里叶变换(Fast Fourier Transform,FFT)中,经典分段匹配滤波(Partial Matched Filtering,PMF)与FFT相结合的PMF-FFT卫星信号捕获算法存在增益损失,导致捕获灵敏度低、频率覆盖范围小和搜索速度慢的问题,提出了一种改进的二级分段PMF-FFT卫星信号捕获算法。截取部分FFT频率分量,缩短算法有效频率覆盖范围,以改善分段求和带来的包络增益衰减;采用在FFT频率分量中间位置追加搜索的方法,以改善FFT带来的扇贝损失;使用从粗略搜索到高精度搜索的策略,以减少搜索次数,提高搜索速度。仿真结果表明,相比经典PMF-FFT算法,在FFT点数不大于64点的情况下,改进算法能有效提高搜索增益和搜索速度,在8点FFT、125 Hz频率精度条件下,平均增益提升了22.19%,搜索次数减少了7.69%。

A Precise Algorithm for Non-Integer Harmonics Analysis Based on FFT and Neural Network

By means of an arificial neural network (ANN) model, higher measurement accuracy of integer harmonics can be obtained. Combining the windowed fast Fourier transform (FFT) algorithm with the improved ANN model, we present a new precise algorithm for non-integer harmonics analysis. According to the result obtained from the Hanning-windowed FFT algorithm, we choose the initial values of orders of harmonics for the neural network. Through such processing, the time of iterations is shortened and the convergence rate of neural network is raised thereby. The simulation results show that close non-integer harmonics can be separated from a signal with higher accuracy and better real-time by using the algorithm presented in the paper. Key words fast Fourier transform (FFT) - artificial neural network (ANN) - Hanning-window - harmonics analysis CLC number TM 935 Foundation item: Supported by the Teaching and Research Award Program for Outstanding Young Teachers in Higher Education Institutions of China (2001-182) and the Science Foundation of Naval University of Engineering(HGDJJ03001).Biography: WANG Gong-bao (1962-), male, Professor, research direction: artificial neural network, wavelet analysis and their applications to signal processing in electric power systems.

A GENERAL IN-PLACE AND IN-ORDER PRIME FACTOR FFT ALGORITHM

Starting from an index mapping for one to multi-dimensions, a general in-placeand in-order prime factor FFT algorithm is proposed in this paper. In comparing with existingprime factor FFT algorithms, this algorithm saves about half of the required storage capacityand possesses a higher efficiency. In addition, this algorithm can easily implement the DFT andIDFT in a single subroutine,

Parallel FFT Algorithm on Computer Clusters

DFT is widely applied in the field of signal process and others. Most present rapid ways of calculation are either based on paralleled computers connected by such particular systems like butterfly network, hypercube etc; or based on the assumption of instant transportation, non-conflict communication, complete connection of paralleled processors and unlimited usable processors. However, the delay of communication in the system of information transmission cannot be ignored. This paper works on the following aspects： instant transmission, dispatching missions, and the path of information through the communication link in the computer cluster systems; layout of the dynamic FFT algorithm under the different structures of computer clusters.

面向5G终端基带处理的高量化信噪比FFT加速器设计

针对第5代移动通信系统(5G)终端基带处理芯片的设计要求,本文提出一种基于新型块浮点(BFP)技术的快速傅里叶变换(FFT)加速器。为了降低FFT计算过程中的量化误差,本文实现了一种逐级迭代、动态调整共享指数的块浮点技术,并在此基础上,引入“银行家舍入规则”处理BFP尾数缩放过程中的舍入误差,进一步提高该加速器的整体精度。此外,为了实现5G基带连续FFT处理需求,本文还实现了一种无地址冲突的顺序访存机制。实验结果表明,该加速器从128点至4096点FFT处理的量化信噪比(SQNR)都超过75 dB,比未采用块浮点的方案高8~15 dB;与其他较优秀的设计相比,在高点数(2048点、4096点)上也有3 dB的优势。本文FFT加速器在TSMC 28 nm工艺库下综合显示,总面积为0.193 mm^(2),最高支持600 MHz时钟频率,计算4096点FFT平均功耗为16.3 mW。

Computational Performances of OFDM Using Different FFT Algorithms

In this paper, an intuitive comparison of the computational performance of orthogonal frequency division multiplexing (OFDM) system has been made in terms of complex calculations required using different Fourier transform techniques. The different transform techniques are introduced such as discrete Fourier transform (DFT) and various types of fast Fourier transform (FFT) as 2-radix FFT, 4-radix FFT etc. and the very recent very fast Fourier transform (VFFT). With intuitive mathematical analysis, it has been shown that with the reduced complexity that VFFT can offer, OFDM performance can be greatly improved in terms of calculations needed.

大点数FFT的工程案例

快速傅里叶变换(FFT)是“数字信号处理”课程中的重要知识点,该算法工程应用非常广泛。但FFT算法的推导过程比较复杂,学生不太容易深刻领会并灵活运用。以某型多频连续波雷达的数据处理为例,介绍如何利用16K缓存的芯片来实现128K点的FFT运算,通过实际工程案例来加深学生对FFT算法的理解,提高学生解决工程问题的能力。

An Accurate FFT-Based Algorithm for Bermudan Barrier Option Pricing

An efficient and accurate numerical method, which is called the CONV method, was proposed by Lord et al in [1] to price Bermudan options. In this paper, this method is applied to price Bermudan barrier options in which the monitored dates may be many times more than the exercise dates. The corresponding algorithm is presented to practical option pricing. Numerical experiments show that this algorithm works very well for different exponential Lévy asset models.

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.

一种高速2-D滑动FFT的设计实现

文章介绍了采用2-D快速傅里叶变换(fast Fourier transform,FFT)算法的滑动窗FFT的基本特性原理和硬件实现过程,完成了窗长256点、步长16点的2-D滑动窗FFT的专用集成电路(application specific integrated circuit,ASIC)设计。传统FFT算法受序列完整性的制约,时滞较大,无法满足某些高实时性信号分析领域的处理速度要求。该文采用滑动FFT算法,克服了传统FFT对序列完整性的依赖,设计的滑动FFT处理器使用2-D FFT压缩新序列计算时间,以基16蝶形运算器为核心,采用系数复用和高基Booth方法优化系数编码技术压缩乘法器的数量,减少电路面积。所设计的2-D滑动FFT完成单次滑动窗长的计算时间比传统算法节约了16.1%,变换结果与MATLAB的运算结果相比,信噪比(signal-to-noise ratio,SNR)大于130 dB。在TSMC 28 nm的工艺下,工作主频为600 MHz,面积为1980μm×2060μm。