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.

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.

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.

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.

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.

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

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 IMPLEMENTATION OF CONVOLUTION BACKPROJECTION ALGORITHM IN SPOTLIGHT SAR

A fast implementation of the convolution backprojection（CBP）algorithm in spotlight synthetic aperture radar（SAR）is presented based on the fast Fourier transform（FFT）.Traditionally,the computation of the ＇backprojection＇ process is expensive,since resampling in the process is implemented by using the interpolation operation.By analyzing the relative location relationship among different pixels,the algorithm realizes the ＇backprojection＇ using a series of FFTs instead of the interpolation operation.The point target simulation validates that the new algorithm accelerates the CBP algorithm,and the computational rate increases about 85%.

Fast Digital Correlation Calculation Method in Extended Beacon Wavefront Detection

On the basis of Hartmann Shack sensor imaging analysis, a new method is presented with which the wavefront slope can be obtained when the object is incoherent and extended. This method, which is demonstrated by both theoretical interpreting and computer simulation, explains how to measure the wavefront slope difference between two sub apertures through the determination of image displacements on detector plane. It includes a fast and accurate digital algorithm for detecting wavefront disturbance, which is much suitable for realization in such electrical hardwares as digital signal processors.

Ultrafast multi-target control of tightly focused light fields

The control of ultrafast optical field is of great interest in developing ultrafast optics as well as the investigation on vari-ous light-matter interactions with ultrashort pulses.However,conventional spatial encoding approaches have only lim-ited steerable targets usually neglecting the temporal effect,thus hindering their broad applications.Here we present a new concept for realizing ultrafast modulation of multi-target focal fields based on the facile combination of time-depend-ent vectorial diffraction theory with fast Fourier transform.This is achieved by focusing femtosecond pulsed light carrying vectorial-vortex by a single objective lens under tight focusing condition.It is uncovered that the ultrafast temporal de-gree of freedom within a configurable temporal duration(~400 fs)plays a pivotal role in determining the rich and exotic features of the focused optical field at one time,namely,bright-dark alternation,periodic rotation,and longitudinal/trans-verse polarization conversion.The underlying control mechanisms have been unveiled.Besides being of academic in-terest in diverse ultrafast spectral regimes,these peculiar behaviors of the space-time evolutionary beams may underpin prolific ultrafast-related applications such as multifunctional integrated optical chip,high-efficiency laser trapping,micro-structure rotation,super-resolution optical microscopy,precise optical measurement,and liveness tracking.

Fast Computation of Cross-Ambiguity Function

A novel method based on zoom fast Fourier transform（FFT） is proposed for minimizing the burden processing of cross-ambiguity functions without affecting performance. The low-pass anti-aliasing filter in zoom FFT is realized by using the multistage filtering technique and the weighting processing is employed in the first stage filter to get rid of the redundancy of the computation. In practical systems, the input data is divided into overlapped data frames to avoid loss of detection ability which results in the rapid increase of computational complexity. A segment technique is also proposed in which CAF calculation of overlapped data frames is viewed as slide window FFT to decrease the computational complexity. The experimental results show that compared to the conventional methods, the proposed method can lower computational complexity and is consistent with the real time implementation in existing high-speed digital processors.

Novel Fourier-based iterative reconstruction for sparse fan projection using alternating direction total variation minimization

Sparse-view x-ray computed tomography （CT） imaging is an interesting topic in CT field and can efficiently decrease radiation dose. Compared with spatial reconstruction, a Fourier-based algorithm has advantages in reconstruction speed and memory usage. A novel Fourier-based iterative reconstruction technique that utilizes non-uniform fast Fourier transform （NUFFF） is presented in this work along with advanced total variation （TV） regularization for a fan sparse-view CT. The proposition of a selective matrix contributes to improve reconstruction quality. The new method employs the NUFFT and its adjoin to iterate back and forth between the Fourier and image space. The performance of the proposed algorithm is demonstrated through a series of digital simulations and experimental phantom studies. Results of the proposed algorithm are compared with those of existing TV-regularized techniques based on compressed sensing method, as well as basic algebraic reconstruction technique. Compared with the existing TV-regularized techniques, the proposed Fourier-based technique significantly improves convergence rate and reduces memory allocation, respectively.

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.

An Accurate Numerical Solution for the Modified Equal Width Wave Equation Using the Fourier Pseudo-Spectral Method

In this study, the numerical solution for the Modified Equal Width Wave (MEW) equation is presented using Fourier spectral method that use to discretize the space variable and Leap-frog method scheme for time dependence. Test problems including the single soliton wave motion, interaction of two solitary waves and interaction of three solitary waves will use to validate the proposed method. The three invariants of the motion are evaluated to determine the conservation properties of the generated scheme. Finally, a Maxwellian initial condition pulse is then studied. The L2 and L∞ error norms are computed to study the accuracy and the simplicity of the presented method.

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.

Microstructure effect of mechanical and cracking behaviors on brittle rocks using image-based fast Fourier transform method

The internal microstructures of rock materials, including mineral heterogeneity and intrinsic microdefects, exert a significant influence on their nonlinear mechanical and cracking behaviors. It is of great significance to accurately characterize the actual microstructures and their influence on stress and damage evolution inside the rocks. In this study, an image-based fast Fourier transform (FFT) method is developed for reconstructing the actual rock microstructures by combining it with the digital image processing (DIP) technique. A series of experimental investigations were conducted to acquire information regarding the actual microstructure and the mechanical properties. Based on these experimental evidences, the processed microstructure information, in conjunction with the proposed micromechanical model, is incorporated into the numerical calculation. The proposed image-based FFT method was firstly validated through uniaxial compression tests. Subsequently, it was employed to predict and analyze the influence of microstructure on macroscopic mechanical behaviors, local stress distribution and the internal crack evolution process in brittle rocks. The distribution of feldspar is considerably more heterogeneous and scattered than that of quartz, which results in a greater propensity for the formation of cracks in feldspar. It is observed that initial cracks and new cracks, including intragranular and boundary ones, ultimately coalesce and connect as the primary through cracks, which are predominantly distributed along the boundary of the feldspar. This phenomenon is also predicted by the proposed numerical method. The results indicate that the proposed numerical method provides an effective approach for analyzing, understanding and predicting the nonlinear mechanical and cracking behaviors of brittle rocks by taking into account the actual microstructure characteristics.

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.

Enhanced Steganalysis for Color Images Using Curvelet Features and Support Vector Machine

Algorithms for steganography are methods of hiding data transfers in media files.Several machine learning architectures have been presented recently to improve stego image identification performance by using spatial information,and these methods have made it feasible to handle a wide range of problems associated with image analysis.Images with little information or low payload are used by information embedding methods,but the goal of all contemporary research is to employ high-payload images for classification.To address the need for both low-and high-payload images,this work provides a machine-learning approach to steganography image classification that uses Curvelet transformation to efficiently extract characteristics from both type of images.Support Vector Machine(SVM),a commonplace classification technique,has been employed to determine whether the image is a stego or cover.The Wavelet Obtained Weights(WOW),Spatial Universal Wavelet Relative Distortion(S-UNIWARD),Highly Undetectable Steganography(HUGO),and Minimizing the Power of Optimal Detector(MiPOD)steganography techniques are used in a variety of experimental scenarios to evaluate the performance of the proposedmethod.Using WOW at several payloads,the proposed approach proves its classification accuracy of 98.60%.It exhibits its superiority over SOTA methods.