Code acquisition is the kernel operation for signal synchronization in the spread-spectrum receiver.To reduce the computational complexity and latency of code acquisition,this paper proposes an efficient scheme employ...Code acquisition is the kernel operation for signal synchronization in the spread-spectrum receiver.To reduce the computational complexity and latency of code acquisition,this paper proposes an efficient scheme employing sparse Fourier transform(SFT)and the relevant hardware architecture for field programmable gate array(FPGA)and application-specific integrated circuit(ASIC)implementation.Efforts are made at both the algorithmic level and the implementation level to enable merged searching of code phase and Doppler frequency without incurring massive hardware expenditure.Compared with the existing code acquisition approaches,it is shown from theoretical analysis and experimental results that the proposed design can shorten processing latency and reduce hardware complexity without degrading the acquisition probability.展开更多
Signal decomposition and multiscale signal analysis provide many useful tools for timefrequency analysis.We proposed a random feature method for analyzing time-series data by constructing a sparse approximation to the...Signal decomposition and multiscale signal analysis provide many useful tools for timefrequency analysis.We proposed a random feature method for analyzing time-series data by constructing a sparse approximation to the spectrogram.The randomization is both in the time window locations and the frequency sampling,which lowers the overall sampling and computational cost.The sparsification of the spectrogram leads to a sharp separation between time-frequency clusters which makes it easier to identify intrinsic modes,and thus leads to a new data-driven mode decomposition.The applications include signal representation,outlier removal,and mode decomposition.On benchmark tests,we show that our approach outperforms other state-of-the-art decomposition methods.展开更多
Modern agricultural mechanization has put forward higher requirements for the intelligent defect diagnosis.However,the fault features are usually learned and classified under all speeds without considering the effects...Modern agricultural mechanization has put forward higher requirements for the intelligent defect diagnosis.However,the fault features are usually learned and classified under all speeds without considering the effects of speed fluctuation.To overcome this deficiency,a novel intelligent defect detection framework based on time-frequency transformation is presented in this work.In the framework,the samples under one speed are employed for training sparse filtering model,and the remaining samples under different speeds are adopted for testing the effectiveness.Our proposed approach contains two stages:1)the time-frequency domain signals are acquired from the mechanical raw vibration data by the short time Fourier transform algorithm,and then the defect features are extracted from time-frequency domain signals by sparse filtering algorithm;2)different defect types are classified by the softmax regression using the defect features.The proposed approach can be employed to mine available fault characteristics adaptively and is an effective intelligent method for fault detection of agricultural equipment.The fault detection performances confirm that our approach not only owns strong ability for fault classification under different speeds,but also obtains higher identification accuracy than the other methods.展开更多
针对稀疏线阵波达方向估计精度较低问题,提出一种稀疏线阵双迭代傅里叶优化方法。基于阵列孔径原理,利用阵列因子与阵元激励间的傅里叶变换关系,构建稀疏线阵构型优化目标函数;提出双迭代傅里叶变换算法,制定合理的旁瓣阈值和旁瓣约束条...针对稀疏线阵波达方向估计精度较低问题,提出一种稀疏线阵双迭代傅里叶优化方法。基于阵列孔径原理,利用阵列因子与阵元激励间的傅里叶变换关系,构建稀疏线阵构型优化目标函数;提出双迭代傅里叶变换算法,制定合理的旁瓣阈值和旁瓣约束条件,依据稀疏率和阵元数将孔径自适应分区,以阵列峰值旁瓣和孔径为约束,由双层嵌套循环迭代优化阵列麦克风数量和位置,获得更低的阵列峰值旁瓣电平。数值仿真和实验结果表明,根据该方法获得的49.5λ孔径、23%稀疏率的稀疏阵列峰值旁瓣电平为-21.59 dB,主瓣宽度为1.03°,角度分辨率为1°,估计误差小于0.01。与其他方法对比,峰值旁瓣低1 d B,优化效率提升50%,由此可证明该方法的有效性和快速性。展开更多
卫星导航接收机中捕获阶段的用时直接影响了接收机的首次定位时间(Time to First Fix,TTFF),许多场景对卫星导航接收机的捕获速度提出了更高的要求。基于稀疏傅立叶变换(Sparse Fourier Transform,SFT)的卫星导航信号快速捕获算法利用...卫星导航接收机中捕获阶段的用时直接影响了接收机的首次定位时间(Time to First Fix,TTFF),许多场景对卫星导航接收机的捕获速度提出了更高的要求。基于稀疏傅立叶变换(Sparse Fourier Transform,SFT)的卫星导航信号快速捕获算法利用捕获相关值的稀疏特性,通过对输入信号进行混叠处理,优化捕获过程中相关运算的效率,减少运算量。对基于SFT的卫星导航信号快速捕获算法性能进行分析和仿真验证,仿真结果表明,与基于快速傅立叶变换(Fast Fourier Transform,FFT)的并行码相位捕获算法相比,基于SFT的并行码相位捕获算法能大幅提高运算效率,减少运算量,具有一定的工程参考价值。展开更多
A communication and navigation receiver is required to remove hostile jamming signals and synchronize receiving signals effectively especially for satellite communication and navigation whose resources are becoming mo...A communication and navigation receiver is required to remove hostile jamming signals and synchronize receiving signals effectively especially for satellite communication and navigation whose resources are becoming more and more limited. This paper proposes a novel signal receiving method by combining the pro- cesses of anti-jamming and synchronization to reduce the overall computationa~ complexity at the expense of slightly affecting the detection probability, which is analyzed in detail by derivations. Furthermore, this paper introduces sparse Fourier transformation （SFT） into the proposed algorithm to replace fast Fourier transfor- mation （FFT） so as to further reduce the calculation time especially in large frequency offset environments.展开更多
The Clifford Fourier transform （CFT） can be applied to both vector and scalar fields. However, due to problems with big data, CFT is not efficient, because the algorithm is calculated in each semaphore. The sparse f...The Clifford Fourier transform （CFT） can be applied to both vector and scalar fields. However, due to problems with big data, CFT is not efficient, because the algorithm is calculated in each semaphore. The sparse fast Fourier transform （sFFT） theory deals with the big data problem by using input data selectively. This has inspired us to create a new algorithm called sparse fast CFT （SFCFT）, which can greatly improve the computing performance in scalar and vector fields. The experiments are im- plemented using the scalar field and grayscale and color images, and the results are compared with those using FFT, CFT, and sFFT. The results demonstrate that SFCFT can effectively improve the performance of multivector signal processing.展开更多
Detection of maneuvering small targets has always been an important yet challenging task for radar signal processing.One primary reason is that target variable motions within coherent processing interval generate ener...Detection of maneuvering small targets has always been an important yet challenging task for radar signal processing.One primary reason is that target variable motions within coherent processing interval generate energy migrations across multiple resolution bins,which severely deteriorate the parameter estimation performance.A coarse-to-fine strategy for the detection of maneuvering small targets is proposed.Integration of small points segmented coherently is performed first,and then an optimal inter-segment integration is utilized to derive the coarse estimation of the chirp rate.Sparse fractional Fourier transform(FrFT)is then employed to refine the coarse estimation at a significantly reduced computational complexity.Simulation results verify the proposed scheme that achieves an efficient and reliable maneuvering target detection with-16dB input signal-to-noise ratio(SNR),while requires no exact a priori knowledge on the motion parameters.展开更多
基金supported by the National Natural Science Foundation of China(61801503).
文摘Code acquisition is the kernel operation for signal synchronization in the spread-spectrum receiver.To reduce the computational complexity and latency of code acquisition,this paper proposes an efficient scheme employing sparse Fourier transform(SFT)and the relevant hardware architecture for field programmable gate array(FPGA)and application-specific integrated circuit(ASIC)implementation.Efforts are made at both the algorithmic level and the implementation level to enable merged searching of code phase and Doppler frequency without incurring massive hardware expenditure.Compared with the existing code acquisition approaches,it is shown from theoretical analysis and experimental results that the proposed design can shorten processing latency and reduce hardware complexity without degrading the acquisition probability.
基金supported in part by the NSERC RGPIN 50503-10842supported in part by the AFOSR MURI FA9550-21-1-0084the NSF DMS-1752116.
文摘Signal decomposition and multiscale signal analysis provide many useful tools for timefrequency analysis.We proposed a random feature method for analyzing time-series data by constructing a sparse approximation to the spectrogram.The randomization is both in the time window locations and the frequency sampling,which lowers the overall sampling and computational cost.The sparsification of the spectrogram leads to a sharp separation between time-frequency clusters which makes it easier to identify intrinsic modes,and thus leads to a new data-driven mode decomposition.The applications include signal representation,outlier removal,and mode decomposition.On benchmark tests,we show that our approach outperforms other state-of-the-art decomposition methods.
基金Project(51675262)supported by the National Natural Science Foundation of ChinaProject(2016YFD0700800)supported by the National Key Research and Development Program of China+2 种基金Project(6140210020102)supported by the Advance Research Field Fund Project of ChinaProject(NP2018304)supported by the Fundamental Research Funds for the Central Universities,ChinaProject(2017-IV-0008-0045)supported by the National Science and Technology Major Project
文摘Modern agricultural mechanization has put forward higher requirements for the intelligent defect diagnosis.However,the fault features are usually learned and classified under all speeds without considering the effects of speed fluctuation.To overcome this deficiency,a novel intelligent defect detection framework based on time-frequency transformation is presented in this work.In the framework,the samples under one speed are employed for training sparse filtering model,and the remaining samples under different speeds are adopted for testing the effectiveness.Our proposed approach contains two stages:1)the time-frequency domain signals are acquired from the mechanical raw vibration data by the short time Fourier transform algorithm,and then the defect features are extracted from time-frequency domain signals by sparse filtering algorithm;2)different defect types are classified by the softmax regression using the defect features.The proposed approach can be employed to mine available fault characteristics adaptively and is an effective intelligent method for fault detection of agricultural equipment.The fault detection performances confirm that our approach not only owns strong ability for fault classification under different speeds,but also obtains higher identification accuracy than the other methods.
文摘针对稀疏线阵波达方向估计精度较低问题,提出一种稀疏线阵双迭代傅里叶优化方法。基于阵列孔径原理,利用阵列因子与阵元激励间的傅里叶变换关系,构建稀疏线阵构型优化目标函数;提出双迭代傅里叶变换算法,制定合理的旁瓣阈值和旁瓣约束条件,依据稀疏率和阵元数将孔径自适应分区,以阵列峰值旁瓣和孔径为约束,由双层嵌套循环迭代优化阵列麦克风数量和位置,获得更低的阵列峰值旁瓣电平。数值仿真和实验结果表明,根据该方法获得的49.5λ孔径、23%稀疏率的稀疏阵列峰值旁瓣电平为-21.59 dB,主瓣宽度为1.03°,角度分辨率为1°,估计误差小于0.01。与其他方法对比,峰值旁瓣低1 d B,优化效率提升50%,由此可证明该方法的有效性和快速性。
文摘卫星导航接收机中捕获阶段的用时直接影响了接收机的首次定位时间(Time to First Fix,TTFF),许多场景对卫星导航接收机的捕获速度提出了更高的要求。基于稀疏傅立叶变换(Sparse Fourier Transform,SFT)的卫星导航信号快速捕获算法利用捕获相关值的稀疏特性,通过对输入信号进行混叠处理,优化捕获过程中相关运算的效率,减少运算量。对基于SFT的卫星导航信号快速捕获算法性能进行分析和仿真验证,仿真结果表明,与基于快速傅立叶变换(Fast Fourier Transform,FFT)的并行码相位捕获算法相比,基于SFT的并行码相位捕获算法能大幅提高运算效率,减少运算量,具有一定的工程参考价值。
基金supported by the National Natural Science Foundation of China(The Key Research of Beidou Receiver based on SFT,61301089)
文摘A communication and navigation receiver is required to remove hostile jamming signals and synchronize receiving signals effectively especially for satellite communication and navigation whose resources are becoming more and more limited. This paper proposes a novel signal receiving method by combining the pro- cesses of anti-jamming and synchronization to reduce the overall computationa~ complexity at the expense of slightly affecting the detection probability, which is analyzed in detail by derivations. Furthermore, this paper introduces sparse Fourier transformation （SFT） into the proposed algorithm to replace fast Fourier transfor- mation （FFT） so as to further reduce the calculation time especially in large frequency offset environments.
基金Project supported by the National Natural Science Foundation of China （Nos. 61301027, 61375015, and 11274226）
文摘The Clifford Fourier transform （CFT） can be applied to both vector and scalar fields. However, due to problems with big data, CFT is not efficient, because the algorithm is calculated in each semaphore. The sparse fast Fourier transform （sFFT） theory deals with the big data problem by using input data selectively. This has inspired us to create a new algorithm called sparse fast CFT （SFCFT）, which can greatly improve the computing performance in scalar and vector fields. The experiments are im- plemented using the scalar field and grayscale and color images, and the results are compared with those using FFT, CFT, and sFFT. The results demonstrate that SFCFT can effectively improve the performance of multivector signal processing.
基金supported in part by the National Natural Science Foundation of China (Nos.62171029,61931015,U1833203)Natural Science Foundation of Beijing Municipality (No.4172052)supported in part by the Basic Research Program of Jiangsu Province (No.SBK2019042353)。
文摘Detection of maneuvering small targets has always been an important yet challenging task for radar signal processing.One primary reason is that target variable motions within coherent processing interval generate energy migrations across multiple resolution bins,which severely deteriorate the parameter estimation performance.A coarse-to-fine strategy for the detection of maneuvering small targets is proposed.Integration of small points segmented coherently is performed first,and then an optimal inter-segment integration is utilized to derive the coarse estimation of the chirp rate.Sparse fractional Fourier transform(FrFT)is then employed to refine the coarse estimation at a significantly reduced computational complexity.Simulation results verify the proposed scheme that achieves an efficient and reliable maneuvering target detection with-16dB input signal-to-noise ratio(SNR),while requires no exact a priori knowledge on the motion parameters.
