基于加窗插值FFT和动态频率的谐波检测算法

快速傅立叶变换在非同步采样的情况下存在较大的误差,因而无法在电能计量过程中获取准确的谐波能量。为了减小非同步采样对快速傅立叶变换的影响,提高电能计量的精确度,通常采用加窗的方法。本文详细分析和推导了加窗插值算法。在此基础上,采用Hanning窗,对插值算法进行改进,最后通过仿真试验,分析结果进一步验证了,改进后的谐波分析的结果与实际情况更为接近。     

Combining the Hanning windowed interpolated FFT in both directions

The interpolated fast Fourier transform (IFFT) has been proposed as a way to eliminate the picket fence effect (PFE) of the fast Fourier transform. The modulus based IFFT, cited in most relevant references, makes use of only the 1st and 2nd highest spectral lines. An approach using three principal spectral lines is proposed. This new approach combines both directions of the complex spectrum based IFFT with the Hanning window. The optimal weight to minimize the estimation variance is established on the first order Taylor series expansion of noise interference. A numerical simulation is carried out, and the results are compared with the Cramer-Rao bound. It is demonstrated that the proposed approach has a lower estimation variance than the two-spectral-line approach. The improvement depends on the extent of sampling deviating from the coherent condition, and the best is decreasing variance by 2/7. However, it is also shown that the estimation variance of the windowed IFFT with the Hanning is significantly higher than that of without windowing.     

快速傅里叶变换在轧辊偏心补偿控制中的应用

描述了轧辊偏心信号的特点.介绍了基于快速傅里叶变换的轧辊偏心补偿控制策略,并给出了实施效果.     

基于DSP平台的动态无功补偿装置的设计

本文针对电力系统巾无功补偿装置的现状,分析了无功补偿装置的原理,指出动念无功补偿是对系统参数准确洲量的基础建立的.应用了快速FFT运算原理消除谐波对测量结果的影响.同时与DSP技术结合,设计了一种带电网监测的动态无功补偿装置.采用TI公司的TMSL2407 DSP作为主控制器,该装置能对电网中各项数据进行实时监测,实现了电容器的快速、无过渡投切.同时在满足无功补偿前提下,防止误动作,可有效的避免重大事故的发生.     

三维随机海浪实时模拟方法研究

分析比较了当前两种比较完备的线性海浪理论,在随机海浪模型基础上设计了一种三维海浪实时模拟方法.利用快速傅立叶变换(FFT)算法进行数值加速计算,完成了海浪的三维造型;研究了基于OpenGL的图形绘制原理,引入顶点数组渲染图形的方法完成了海浪波面的绘制;采用多线程机制使得海浪的数值计算和三维显示能够同步进行.在此基础上对天空以及海浪表面光反射效果进行了模拟,提高了视觉逼真度.通过测试发现,图像刷新频率达到30帧/秒,模拟效果良好.     

基于FPGA硬件实现的谐波检测方法

针对现有系统对谐波检测实时性差和精度低的问题,介绍一种基于傅立叶变换和FPGA硬件实现的谐波检测方法.分析了谐波检测中影响测量精度的关键因素,采用数字锁相环来同步被测信号,以减小由非同步采样所产生的误差.基-4FFT 处理器的硬件设计采用全并行的乘法运算单元结构和并行的存储分配方法,最大限度地提高谐波检测的速度.数字锁相环和基-4 FFT 算法用VHDL语言设计实现,并用MAX plus Ⅱ软件进行仿真,仿真结果表明,所设计的数字锁相环可以很好地跟踪被测信号,在180ms时,误差仅为0.01Hz,很好地消除了非同步采样所引起的测量误差;采用所设计的基-4FFT运算器对给定的谐波数据进行运算,得到的谐波幅值和相位误差小于0.05%,运算时间仅为8μs.     

高吞吐率浮点FFT处理器的FPGA实现研究

受浮点操作的长流水线延迟及FPGA片上RAM端口数目的限制,传统H可处理器的吞吐率通常只能达到每周期输出一个复数结果。本文用FPGA设计并实现了一种高吞吐率的IEEE754标准单精度浮点FFT处理器,通过改进蝶形计算单元的结构并重新组织FPGA片上RAM的访问,该处理器每周期平均可输出约两个复数计算结果,吞吐率约为传统FFT处理器吞吐率的两倍。对于1024点FFT变换,可在（512＋10）＊10=5220周期内完成。     

基于高速环形振荡器的皮秒量级事件计时测量

研究设计基于高速环形振荡器的皮秒量级事件计时器。利用代表事件的信号上升沿去触发高速环形振荡器,产生与事件同步的时钟脉冲信号,对正弦参考信号采样,再通过全相位FFT算法处理,大幅提高事件计时测量的精度。实验结果表明,在正弦参考信号中心频率f₀=10 MHz,全相位FFT运算点数N=8 192,ADC的量化位数b=14 bits,采样频率f_s=140 MHz的情况下,事件计时器能够获得约3.16 ps rms的单次测量精度,时间稳定性优于±0.31 ps/h,实验结果与基于理论分析的误差范围一致,达到皮秒量级事件计时测量。     

基于汉宁窗的配电网同步相量测量装置算法及应用

配电网量测环境复杂、恶劣,输电网的传统同步相量算法难以满足要求。分析了常用窗函数下傅立叶算法的谐波抑制能力,利用3个等间隔的加汉宁窗离散傅立叶变换（FFT）推导出定间隔采样下同步相量测量算法,在理论上消除了非额定频率下的频率泄露影响,能满足高精度的相位测量要求,具有很好的谐波/间谐波抑制能力。针对多个信号同时存在时频谱泄露影响计算精度问题,分析比较了加汉宁窗FFT插值算法相对其他窗函数的优势。理论分析和实际测试表明,采用上述方案后,提升了相量、谐波/间谐波等量值的测量精度。     

Computational homogenization of elasticity on a staggered grid

In this article, we propose to discretize the problem of linear elastic homogenization by finite differences on a staggered grid and introduce fast and robust solvers. Our method shares some properties with the FFT‐based homogenization technique of Moulinec and Suquet, which has received widespread attention recently because of its robustness and computational speed. These similarities include the use of FFT and the resulting performing solvers. The staggered grid discretization, however, offers three crucial improvements. Firstly, solutions obtained by our method are completely devoid of the spurious oscillations characterizing solutions obtained by Moulinec–Suquet's discretization. Secondly, the iteration numbers of our solvers are bounded independently of the grid size and the contrast. In particular, our solvers converge for three‐dimensional porous structures, which cannot be handled by Moulinec–Suquet's method. Thirdly, the finite difference discretization allows for algorithmic variants with lower memory consumption. More precisely, it is possible to reduce the memory consumption of the Moulinec–Suquet algorithms by 50%. We underline the effectiveness and the applicability of our methods by several numerical experiments of industrial scale. Copyright © 2015 John Wiley & Sons, Ltd.