A fast algorithm for the arbitrary polynomial transformation is described. This algorithm is based on the fast Fourier transform (fft) algorithm and reduces the computational complexity of a recently proposed recursiv...
详细信息
A fast algorithm for the arbitrary polynomial transformation is described. This algorithm is based on the fast Fourier transform (fft) algorithm and reduces the computational complexity of a recently proposed recursive algorithm by an order of magnitude.
On-line running spectral analysis is of considerable interest in many electrophysiological signals, such as the EEG (electroencephalograph). This paper presents a new method of implementing the fast Fourier transform ...
详细信息
On-line running spectral analysis is of considerable interest in many electrophysiological signals, such as the EEG (electroencephalograph). This paper presents a new method of implementing the fast Fourier transform (fft) algorithm. Our "real-time fft algorithm" efficiently utilizes computer time to perform the fft computation while data acquisition proceeds so that local butterfly modules are built using the data points that are already available. The real-time fft algorithm is developed using the decimation-in-time split-radix fft (DIT sr-fft) butterfly structure. In order to demonstate the synchronization ability of the proposed algorithm, the authors develop a method of evaluating the number of arithmetic operations that it requires. Both the derivation and the experimental result show that the real-time fft algorithm is superior to the conventional whole-block fft algorithm in synchronizing with the data acquisition process. Given that the fft size N = 2(r), real-time implementation of the fft algorithm requires only 2/r the computational time required by the whole-block fft algorithm.
Orthogonal multi-distorted invariant Complex Exponent Moments (CEMs) are proposed. A fast and accurate 2-D Fast Fourier Transform (fft) algorithm is used to calculate CEMs. Theoretical analysis is presented to demonst...
详细信息
ISBN:
(纸本)9781628411867
Orthogonal multi-distorted invariant Complex Exponent Moments (CEMs) are proposed. A fast and accurate 2-D Fast Fourier Transform (fft) algorithm is used to calculate CEMs. Theoretical analysis is presented to demonstrate the multi-distorted invariant property of CEMs. The proposed method is applied in the pattern recognition of human faces, English letters and Chinese characters. Experimental results show that CEMs have higher quality and lower computational complexity than RHFMs in image reconstruction and pattern recognition.
In this paper, we propose a new efficient fft algorithm for OFDM/DMT applications and present. its pipeline implementation results. Since the proposed algorithm is based on the radix-4 butterfly unit, the processing r...
详细信息
In this paper, we propose a new efficient fft algorithm for OFDM/DMT applications and present. its pipeline implementation results. Since the proposed algorithm is based on the radix-4 butterfly unit, the processing rate can be twice as fast as that based on the radix-2(3) algorithm. Also, its implementation is more area-efficient than the implementation from conventional radix-4 algorithm due to reduced number of nontrivial multipliers like using the radix-2(3) algorithm. In order to compare the proposed algorithm with the conventional radix-4 algorithm, the 64-point MDC pipelined fft processor based on the proposed algorithm was implemented. After the logic synthesis using 0.35mum CMOS technology, the logic gate count for the processor with the proposed algorithm is only about, 70% of that for the processor with the conventional radix-4 algorithm. Since the proposed algorithm can achieve higher processing rate and better efficiency than the conventional algorithm, it is very suitable for the OFDM/DMT applications such as the WLAN, DAB/DVB, and ADSL/VDSL systems(1).
It is shown by using the Walsh-Hadamard matrix and a conversion matrix, a DIF-fft algorithm can be developed for the radix-2 discrete Fourier transform (DFT). The recursive generation of the DFT matrix leads to its sp...
详细信息
It is shown by using the Walsh-Hadamard matrix and a conversion matrix, a DIF-fft algorithm can be developed for the radix-2 discrete Fourier transform (DFT). The recursive generation of the DFT matrix leads to its sparse matrix factorization. The flowgraph based on these sparse matrices is identical to that of the DFT-fft algorithm.
An extended split-radix fast Fourier transform (fft) algorithm is proposed. The extended split-radix fft algorithm hits the same asymptotic arithmetic complexity as the conventional split-radix fft algorithm. Moreover...
详细信息
An extended split-radix fast Fourier transform (fft) algorithm is proposed. The extended split-radix fft algorithm hits the same asymptotic arithmetic complexity as the conventional split-radix fft algorithm. Moreover, this algorithm has the advantage of fewer loads and stores than either the conventional split-radix fft algorithm or the radix-4 fft algorithm.
The fast Fourier transform (fft) algorithm with window interpolation is the most commonly used and most effective method in harmonic analysis. However, the fast Fourier transform has a great dependence on the quality ...
详细信息
The fast Fourier transform (fft) algorithm with window interpolation is the most commonly used and most effective method in harmonic analysis. However, the fast Fourier transform has a great dependence on the quality of the signal, and the existence of noise makes the detection result error. A harmonic detection method based on wavelet threshold preprocessing noise elimination and windowed interpolation fft algorithm is proposed in this thesis. Firstly, de-noising the selected signals, and the wavelet coefficients are used to select the wavelet threshold to eliminate the noise in the signal. Then the signal after the de-noising is analysed by the Nuttall window interpolate fft algorithm, and the calculation formula is derived by using the amplitude information content of four spectral lines. The simulation results show that the proposed method is more accurate and effective to detect the signal after de-noising.
An alternative way of refining phases with the origin-free modulus sum function S is shown that, instead of applying the tangent formula in sequential mode [Rius (1993). Acta Cryst. A49, 406-409], applies it in parall...
详细信息
An alternative way of refining phases with the origin-free modulus sum function S is shown that, instead of applying the tangent formula in sequential mode [Rius (1993). Acta Cryst. A49, 406-409], applies it in parallel mode with the help of the fast Fourier transform (fft) algorithm. The test calculations performed on intensity data of small crystal structures at atomic resolution prove the convergence and hence the viability of the procedure. This new procedure called S-fft is valid for all space groups and especially competitive for low-symmetry ones. It works well when the charge-density peaks in the crystal structure have the same sign, i.e. either positive or negative.
Industrialization in production is developing rapidly, and a large number of non-linear, impact and volatility loads are increasing in the power system, seriously affecting the power quality of the grid. The analysis ...
详细信息
ISBN:
(纸本)9781728165479
Industrialization in production is developing rapidly, and a large number of non-linear, impact and volatility loads are increasing in the power system, seriously affecting the power quality of the grid. The analysis and monitoring of power quality parameters can achieve the goal of improving power quality. This paper first introduces the influence of harmonics in power quality, and then deduces the acceleration principle of fft algorithm for DFT acceleration algorithm. In MATLAB software, the fft algorithm is used to verify the analog signal. Finally, experimental data shows that accurate harmonic parameters can be obtained by the fft algorithm.
fftW and CUfft are used as typical fft computing libraries based on CPU and GPU respectively. This paper tests and analyzes the performance and total consumption time of machine floating-point operation accelerated by...
详细信息
ISBN:
(纸本)9781538645093
fftW and CUfft are used as typical fft computing libraries based on CPU and GPU respectively. This paper tests and analyzes the performance and total consumption time of machine floating-point operation accelerated by CPU and GPU algorithm under the same data volume. The results show that CUfft based on GPU has a better comprehensive performance than fftW.
暂无评论