检索结果-内蒙古大学图书馆

Real-time fft algorithm applied to on-line spectral analysis

CIRCUITS SYSTEMS AND SIGNAL PROCESSING 1999年第4期18卷 377-393页

作者： Lo, PC Lee, YY Natl Chiao Tung Univ Dept Elect & Control Engn Hsinchu 30050 Taiwan

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.

关键词： computer time data acquisition and processing algorithms fft algorithm Spectrum Analysis Fast Fourier transform

来源：评论

学校读者我要写书评

暂无评论

fft algorithm of complex exponent moments and its application in image recognition

FFT algorithm of complex exponent moments and its applicatio...

引用

6th International Conference on Digital Image Processing (ICDIP)

作者： Ping, Ziliang Jiang, Yongjing Zhou, Suhua Wu, Yu Inner Mongolia Normal Univ Phys & Elect Coll Hohhot 010022 Peoples R China Beijing Univ Posts & Telecommun Century Coll Beijing Peoples R China

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.

关键词： Complex Exponent Moments fft algorithm Multi-distorted invariance Pattern recognition

来源：评论

学校读者我要写书评

暂无评论

New efficient fft algorithm and pipeline implementation results for OFDM/DMT applications

引用

IEEE TRANSACTIONS ON CONSUMER ELECTRONICS 2003年第1期49卷 14-20页

作者： Jung, YH Yoon, H Kim, J Yonsei Univ Commun SOC Design Lab Dept Elect & Elect Engn Seoul 120749 South Korea

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

关键词： fft algorithm OFDM/DMT applications pipeline implementation radix-2(3) radix-4

来源：评论

学校读者我要写书评

暂无评论

An extended split-radix fft algorithm

引用

IEEE SIGNAL PROCESSING LETTERS 2001年第5期8卷 145-147页

作者： Takahashi, D Saitama Univ Dept Informat & Comp Sci Urawa Saitama 3388570 Japan

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.

关键词： computational complexity fast Fourier transforms signal processing asymptotic arithmetic complexity conventional split-radix fft algorithm extended split-radix fft algorithm fast Fourier transform radix-4 fft algorithm complexity classes fft algorithm signal processing Fast Fourier transform

来源：评论

学校读者我要写书评

暂无评论

Research on harmonic detection based on wavelet threshold and fft algorithm

引用

SYSTEMS SCIENCE & CONTROL ENGINEERING 2018年第3期6卷 339-345页

作者： Zhao, Shuaishuai Wang, Chuanjiang Bian, Xiaoxue Shandong Univ Sci & Technol Coll Elect Engn & Automat Qingdao Peoples R China

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.

关键词： Wavelet threshold fft algorithm polynomial fitting harmonic detection

来源：评论

学校读者我要写书评

暂无评论

A direct phasing method based on the origin-free modulus sum function and the fft algorithm. XII

引用

ACTA CRYSTALLOGRAPHICA A-FOUNDATION AND ADVANCES 2007年第2期63卷 131-134页

作者： Rius, Jordi Crespi, Anna Torrelles, Xavier CSIC Inst Ciencia Mat Barcelona Bellaterra 08193 Catalunya Spain

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.

关键词： direct phasing fft algorithm origin-free modulus sum function.

来源：评论

学校读者我要写书评

暂无评论

Harmonic Analysis of Power Grid Based on fft algorithm 5

Harmonic Analysis of Power Grid Based on FFT Algorithm

引用

5th IEEE International Conference on Smart Cloud (IEEE SmartCloud) / 5th IEEE International Symposium on Reinforcement Learning (IEEE ISRL)

作者： Deng, Han Gao, Yulian Chen, Xuhui Zhang, Yazhen Wu, Qiaohong Zhao, Hui Guangzhou Coll Technol & Business Big Data Dev & Res Ctr Guangzhou 528138 Peoples R China Henan Univ Educ Informat Technol Lab Kaifeng 475000 Peoples R China Xiamen Univ Technol Key Lab Internet Things Applicat Technol Xiamen 361024 Peoples R China

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.

关键词： Harmonics Power Quality fft algorithm

来源：评论

学校读者我要写书评

暂无评论

The Optimization of fft algorithm Based with Parallel Computing on GPU 3

The Optimization of FFT Algorithm Based with Parallel Comput...

引用

3rd IEEE Advanced Information Technology, Electronic and Automation Control Conference (IAEAC)

作者： Zhao, Zhicheng Zhao, Yaqun State Key Lab Math Engn & Adv Comp Zhengzhou Henan Peoples R China

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.

关键词： ARL fft algorithm parallel computation CUDA

来源：评论

学校读者我要写书评

暂无评论

On the Additive Complexity of the Cyclotomic fft algorithm

On the Additive Complexity of the Cyclotomic FFT Algorithm

引用

IEEE Information Theory Workshop (ITW)

作者： Trifonov, Peter St Petersburg State Polytech Univ Distributed Comp & Networking Dept St Petersburg 194021 Russia

ISBN: (纸本)9781467302234;9781467302241

The problem of efficient evaluation of the discrete Fourier transform over finite fields is considered. The techniques for additive complexity reduction of the cyclotomic fft algorithm are proposed. The first one is based on the classical simultaneous reduction algorithm. The second one is based on a factorization of the presummation matrix into a sparse and block-diagonal ones. The proposed methods provide smaller asymptotic complexity, although for small-sized problems the required number of operations appears to be higher than the complexity of computer-optimized algorithms.

关键词： fft algorithm cyclotomic discrete Fourier transform Galois fields factorization Complexity Additives

来源：评论

学校读者我要写书评

暂无评论

A 3-D Precorrected fft algorithm For Electrically Large Objects in Planarly Layered Media

A 3-D Precorrected FFT Algorithm For Electrically Large Obje...

引用

10th International Symposium on Antennas, Propagation and EM Theory (ISAPE)

作者： Guo, Lan-Wei Li, Yin Chen, Yongpin P. Hu, Jun Li, Joshua Le-Wei Univ Elect Sci & Technol China Inst Electromagnet Chengdu 611731 Peoples R China Univ Elect Sci & Technol China Sch Elect Engn Chengdu 611731 Peoples R China

ISBN: (纸本)9781467318006;9781467317993

A three-dimensional (3D) pre-corrected fast Fourier transform (pfft) is presented for the fast analysis of electromagnetic (EM) scattering from electrically large perfect electrically conducting structures embedded inside a planarly layered medium. The mixed-potential integral equation (MPIE) is used to formulate the problem and the method of moments (MOM) with Rao-Wilton-Glisson (RWG) basis function is employed to solve the integral equation. In order to avoid direct numerical computation of Sommerfeld integrals (SIs), the two-level discrete complex image method (DCIM) is employed to expedite the matrix filling process. In the iterative stage, the pfft method is further adopted to accelerate the matrix-vector product, since the resulting matrix contains both cyclic convolution and correlation terms after proper splitting. Moreover, the incomplete LU preconditioner is applied to improve the convergence of the matrix equation. Numerical results are presented to show the efficiency and capability of the method.

关键词： fft algorithm Electricity integration numerical calculation LINEAR EQUATION,MATRIX Riccati matrix equation Lyapunov matrix equations Cross product Iterative binary large object Equation

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：