To eliminate the aliasing that appeared during the measurement of multi-components nonstationary signals, a novel kind of anti-aliasing algorithm based on the short time Fourier transform （STFT） is brought forward. ...To eliminate the aliasing that appeared during the measurement of multi-components nonstationary signals, a novel kind of anti-aliasing algorithm based on the short time Fourier transform （STFT） is brought forward. First the physical essence of aliasing that occurs is analyzed; second the interpolation algorithm model is setup based on the Hamming window; then the fast implementation of the algorithm using the Newton iteration method is given. Using the numerical simulation the feasibility of algorithm is validated. Finally, the electrical circuit experiment shows the practicality of the algorithm in the electrical engineering.展开更多
The classical Gerchberg-Saxton algorithm is introduced into the image recovery in fractional Fourier domain after adaptation. When this algorithm is applied directly, its performance is good for smoothed image, but ba...The classical Gerchberg-Saxton algorithm is introduced into the image recovery in fractional Fourier domain after adaptation. When this algorithm is applied directly, its performance is good for smoothed image, but bad for unsmoothed image. Based on the diversity of fractional Fourier transform on its orders, this paper suggests a novel iterative algorithm, which extracts the information of the original image from amplitudes of its fractional Fourier transform at two orders. This new algorithm consists of two independent Gerchberg-Saxton procedures and an averaging operation in each circle. Numerical simulations are carried out to show its validity for both smoothed and unsmoothed images with most pairs of orders in the interval [0, 1].展开更多
基于快速傅里叶变换的快速迭代收缩阈值算法(fast iterative shrinkage threshold algorithm based on fast Fourier transform, FFT-FISTA)具有较高的计算效率,但其忽略点扩散函数的空间变化及卷绕误差,造成声源识别性能的损失,为此提...基于快速傅里叶变换的快速迭代收缩阈值算法(fast iterative shrinkage threshold algorithm based on fast Fourier transform, FFT-FISTA)具有较高的计算效率,但其忽略点扩散函数的空间变化及卷绕误差,造成声源识别性能的损失,为此提出基于函数波束形成的改进FFT-FISTA算法。改进算法以函数波束形成输出作为FFT-FISTA算法的迭代输入,建立函数波束形成、声源分布及升幂空间转移不变点扩散函数的线性方程组,基于周期边界条件下的快速傅里叶变换进行迭代求解,使被运算的非周期函数变为一个周期函数,解决补零边界带来的波数泄漏问题,可提高运算准确性,进一步提升成像性能;通过指数运算锐化点扩散函数主瓣,拓展点扩散函数空间转移不变性假设的适用性。仿真和试验结果表明,相较于常规FFT-FISTA算法,改进算法能提升成像空间分辨率及动态范围,扩大FFT-FISTA算法的有效成像区域,压缩气体泄漏试验结果验证了改进算法的有效性。展开更多
分析了R ife算法的性能,指出当信号频率位于离散傅里叶变换(D iscrete Fourier T ransform,DFT)两个相邻量化频率点的中心区域时,R ife算法精度很高,其均方根误差接近克拉美-罗限(C ram er-R ao Low er Bound,CRLB),但当信号频率位于量...分析了R ife算法的性能,指出当信号频率位于离散傅里叶变换(D iscrete Fourier T ransform,DFT)两个相邻量化频率点的中心区域时,R ife算法精度很高,其均方根误差接近克拉美-罗限(C ram er-R ao Low er Bound,CRLB),但当信号频率位于量化频率点附近时,R ife算法精度降低。本文提出了一种修正R ife(M-R ife)算法,通过对信号进行频移,使新信号的频率位于两个相邻量化频率点的中心区域,然后再利用R ife算法进行频率估计。仿真结果表明本算法性能不随被估计信号的频率分布而产生波动,整体性能优于牛顿迭代法(一次迭代),接近二次迭代,在低信噪比条件下不存在发散问题,性能比牛顿迭代稳定。本算法易于硬件实现。展开更多
针对旋转机械故障振动信号的降噪问题,提出一种基于短时Fourier变换(short time Fourier transform,简称STFT)时频谱系数收缩的信号降噪方法。先将信号进行STFT,得到其时频谱。由于谱系数为复数,故根据模值大小进行谱系数收缩,并利用步...针对旋转机械故障振动信号的降噪问题,提出一种基于短时Fourier变换(short time Fourier transform,简称STFT)时频谱系数收缩的信号降噪方法。先将信号进行STFT,得到其时频谱。由于谱系数为复数,故根据模值大小进行谱系数收缩,并利用步长迭代算法在0到谱系数最大模值的区间内估计最优阈值。迭代运算过程中,首先,分别采用基本的硬阈值函数和软阈值函数进行系数收缩;然后,以改进风险函数为阈值评价标准,估计最优阈值;最后,利用最优阈值重新进行谱系数收缩,对得到的新谱进行STFT逆变换,重构降噪后的时域信号。仿真信号与试验数据的处理结果表明,利用所估计的最优阈值,STFT时频谱系数硬、软阈值函数收缩方法均能够实现噪声混合信号的降噪。展开更多
基金the National Natural Science Foundation of China (90407007 60372001).
文摘To eliminate the aliasing that appeared during the measurement of multi-components nonstationary signals, a novel kind of anti-aliasing algorithm based on the short time Fourier transform （STFT） is brought forward. First the physical essence of aliasing that occurs is analyzed; second the interpolation algorithm model is setup based on the Hamming window; then the fast implementation of the algorithm using the Newton iteration method is given. Using the numerical simulation the feasibility of algorithm is validated. Finally, the electrical circuit experiment shows the practicality of the algorithm in the electrical engineering.
文摘The classical Gerchberg-Saxton algorithm is introduced into the image recovery in fractional Fourier domain after adaptation. When this algorithm is applied directly, its performance is good for smoothed image, but bad for unsmoothed image. Based on the diversity of fractional Fourier transform on its orders, this paper suggests a novel iterative algorithm, which extracts the information of the original image from amplitudes of its fractional Fourier transform at two orders. This new algorithm consists of two independent Gerchberg-Saxton procedures and an averaging operation in each circle. Numerical simulations are carried out to show its validity for both smoothed and unsmoothed images with most pairs of orders in the interval [0, 1].
文摘基于快速傅里叶变换的快速迭代收缩阈值算法(fast iterative shrinkage threshold algorithm based on fast Fourier transform, FFT-FISTA)具有较高的计算效率,但其忽略点扩散函数的空间变化及卷绕误差,造成声源识别性能的损失,为此提出基于函数波束形成的改进FFT-FISTA算法。改进算法以函数波束形成输出作为FFT-FISTA算法的迭代输入,建立函数波束形成、声源分布及升幂空间转移不变点扩散函数的线性方程组,基于周期边界条件下的快速傅里叶变换进行迭代求解,使被运算的非周期函数变为一个周期函数,解决补零边界带来的波数泄漏问题,可提高运算准确性,进一步提升成像性能;通过指数运算锐化点扩散函数主瓣,拓展点扩散函数空间转移不变性假设的适用性。仿真和试验结果表明,相较于常规FFT-FISTA算法,改进算法能提升成像空间分辨率及动态范围,扩大FFT-FISTA算法的有效成像区域,压缩气体泄漏试验结果验证了改进算法的有效性。
文摘针对旋转机械故障振动信号的降噪问题,提出一种基于短时Fourier变换(short time Fourier transform,简称STFT)时频谱系数收缩的信号降噪方法。先将信号进行STFT,得到其时频谱。由于谱系数为复数,故根据模值大小进行谱系数收缩,并利用步长迭代算法在0到谱系数最大模值的区间内估计最优阈值。迭代运算过程中,首先,分别采用基本的硬阈值函数和软阈值函数进行系数收缩;然后,以改进风险函数为阈值评价标准,估计最优阈值;最后,利用最优阈值重新进行谱系数收缩,对得到的新谱进行STFT逆变换,重构降噪后的时域信号。仿真信号与试验数据的处理结果表明,利用所估计的最优阈值,STFT时频谱系数硬、软阈值函数收缩方法均能够实现噪声混合信号的降噪。
