基于FPGA的基-16FFT模块的实现

阐述了采用Alter公司的StratixⅡ系列FPGA设计高速FFT处理器的实现方法及技巧;充分利用其芯片的硬件资源,减少复杂逻辑,采用流水方式对复数数据实现了FFT运算;整个设计采用流水与并行方式尽量避免“瓶颈”的出现,提高系统时钟频率,达到高速处理;实验表明,此处理器既有专用ASIC电路的快速性,又有DSP器件灵活性的特点,适合用于高速数字信号处理。     

一种基于谱线幅值归零的加窗插值FFT谐波检测方法

提出了一种基于谱线幅值归零的加窗插值FFT谐波检测方法用于分析复杂电网信号中的各次谐波.该检测方法将每一次在离散频谱中找到的最大谱线及其左右两侧的数根谱线幅值归零,直到各次谐波分析完毕.通过仿真实验分析了在基波频率稳定时对模拟信号的测量精度,研究了基波频率波动对谐波分析的影响.通过对EAST实验数据的分析,验证了该谐波...     

一种正弦波信号频率幅值的高精度估计方法

为了提高正弦波信号频率和幅值的频域估计精度,提出了窗函数迭代逼近方法.Matlab仿真结果表明,该方法切实可行,估计精度可以提高4~5个数量级,且与频率偏差δ基本无关.     

红黑排序混合算法收敛速度分析

The algorithm of applying the block Gauss elimination to the Red-Black or-dering matrix to reduce the order of the system then solve the reduced system byiterative methods is called Hybrid Red-Black Ordering algorithm.In this paper,we discuss the convergence rate of the hybrid methods combined with JACOBI,CG,GMRES(m).Theoretical analysis shows that without preconditioner thesethree hybrid methods converge about 2 times as fast as the corresponding natural ordering methods.For the case that all the eigenvalues is near the real axis, the GMRES(m) algorithm converges about 3 times faster than the natural ordering GMRES(m).Various numerical experiments are presented.For large scale prob-lem with preconditioners, numerical experiments show that the GMRES(m) hybrid methods converge from about 3 times to even 5 times as fast as the natural order-ing methods and the computing time is reduced to about 1/3 even 1/6 of that of the natural ordering methods.     

基于FPGA的高速FFT处理器的设计与实现

针对高速实时信号处理的要求,提出了4096点快速傅立叶变换（FFT）处理器在现场可编程门阵列（FPGA）中的设计与实现方法。该方法采用了按频率抽取（DIF）基4算法和6级流水线结构,每级均采用FIFO存储器实现延迟功能,和四路转接器一起共同完成序列的码位抽取。为了避免数据溢出,采用块浮点结构来表示数据,节省了器件资源。实验结果表明,该方法在保证运算精度和实现复杂度的同时,提高了处理器的数据时钟频率和处理速度。     

高温拉曼光谱提高信噪比的途径分析

结合累积时间分辨和空间分辨建成了上海大学高温拉曼谱仪SU-HTRS(T/S).由于高温噪声的不可避免,采用了移动平均方法,傅里叶变换滤波和小波分析的方法对其进行了数据降噪处理.在不同噪声水平上分析了不同处理方式对谱峰中心位置、强度、面积的影响及处理后数据的光滑度的影响.三种方法比较起来,移动平均法快而简单,小波分析的去噪效果最好.     

Iterative solutions to coupled Sylvester-transpose matrix equations

This note studies the iterative solutions to the coupled Sylvester-transpose matrix equation with a unique solution. By using the hierarchical identification principle, an iterative algorithm is presented for solving this class of coupled matrix equations. It is proved that the iterative solution consistently converges to the exact solution for any initial values. Meanwhile, sufficient conditions are derived to guarantee that the iterative solutions given by the proposed algorithm converge to the exact solution for any initial matrices. Finally, a numerical example is given to illustrate the efficiency of the proposed approach.     

Nonsmooth analysis of vector-valued mappings with contributions to nondifferentiable programming

We define order Lipschitz mappings from a Banach space to an order complete vector lattice and present a nonsmooth analysis for such functions. In particular, we establish properties of a generalized directional derivative and gradient and derive results concerning a calculus of generalized gradients (i.e., calculation of the generalized gradient of f when f = f₁ + f₂, f = f · ₂, etc.). We show the relevance of the above analysis to nondifferentiaile programming by deriving optimality conditions for problems of the form min f(x) subject to x [euro] S. For S arbitrary we state the results in terms of cones of displacement of the feasible region at the optimal point; when S ={x ? A|g(x) ? B}, we obtain Kuhn-Tucker type results.     

p－一致平滑空间局部Lipschitz方程解的迭代逼近

设Ｘ为ｐ－一致平滑的Ｂａｎａｃｈ空间，ｐ∈［１，２］，Ｔ：Ｄ（Ｔ）→Ｘ是局部Ｌｉｐｓｃｈｉｔｚ和严格增殖算子，本文给出了非线性方程ＴＸ＝Ｙ的解的迭代逼近，所得结果推广了文［１］的主要结果。