In low earth orbit (LEO) satellite or missile communication scenarios, signals may experience extremely large Doppler shifts and have short visual time. Thus, direct sequence spread spectrum (DSSS) systems should be a...In low earth orbit (LEO) satellite or missile communication scenarios, signals may experience extremely large Doppler shifts and have short visual time. Thus, direct sequence spread spectrum (DSSS) systems should be able to achieve acquisition in a very short time in spite of large Doppler frequencies. However, the traditional methods cannot solve it well. This work describes a new method that uses a differential decoding technique for Doppler mitigation and a batch process of FFT (fast Fourier transform) and IFFT (invert FFT) for the purpose of parallel code phase search by frequency domain correlation. After the code phase is estimated, another FFT process is carried out to search the Doppler frequency. Since both code phase and Doppler frequency domains are searched in parallel, this architecture can provide acquisition fifty times faster than conventional FFT methods. The performance in terms of the probability of detection and false alarm are also analyzed and simulated, showing that a signal-to-noise ratio (SNR) loss of 3 dB is introduced by the differential decoding. The proposed method is an efficient way to shorten the acquisition time with slightly hardware increasing.展开更多
基于快速傅里叶变换的快速迭代收缩阈值算法(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算法的有效成像区域,压缩气体泄漏试验结果验证了改进算法的有效性。展开更多
DFT is widely applied in the field of signal process and others. Most present rapid ways of calculation are either based on paralleled computers connected by such particular systems like butterfly network, hypercube e...DFT is widely applied in the field of signal process and others. Most present rapid ways of calculation are either based on paralleled computers connected by such particular systems like butterfly network, hypercube etc; or based on the assumption of instant transportation, non-conflict communication, complete connection of paralleled processors and unlimited usable processors. However, the delay of communication in the system of information transmission cannot be ignored. This paper works on the following aspects： instant transmission, dispatching missions, and the path of information through the communication link in the computer cluster systems; layout of the dynamic FFT algorithm under the different structures of computer clusters.展开更多
基金Project(60904090) supported by the National Natural Science Foundation of China
文摘In low earth orbit (LEO) satellite or missile communication scenarios, signals may experience extremely large Doppler shifts and have short visual time. Thus, direct sequence spread spectrum (DSSS) systems should be able to achieve acquisition in a very short time in spite of large Doppler frequencies. However, the traditional methods cannot solve it well. This work describes a new method that uses a differential decoding technique for Doppler mitigation and a batch process of FFT (fast Fourier transform) and IFFT (invert FFT) for the purpose of parallel code phase search by frequency domain correlation. After the code phase is estimated, another FFT process is carried out to search the Doppler frequency. Since both code phase and Doppler frequency domains are searched in parallel, this architecture can provide acquisition fifty times faster than conventional FFT methods. The performance in terms of the probability of detection and false alarm are also analyzed and simulated, showing that a signal-to-noise ratio (SNR) loss of 3 dB is introduced by the differential decoding. The proposed method is an efficient way to shorten the acquisition time with slightly hardware increasing.
文摘基于快速傅里叶变换的快速迭代收缩阈值算法(fast iterative shrinkage threshold algorithm based on fast Fourier transform, FFT-FISTA)具有较高的计算效率,但其忽略点扩散函数的空间变化及卷绕误差,造成声源识别性能的损失,为此提出基于函数波束形成的改进FFT-FISTA算法。改进算法以函数波束形成输出作为FFT-FISTA算法的迭代输入,建立函数波束形成、声源分布及升幂空间转移不变点扩散函数的线性方程组,基于周期边界条件下的快速傅里叶变换进行迭代求解,使被运算的非周期函数变为一个周期函数,解决补零边界带来的波数泄漏问题,可提高运算准确性,进一步提升成像性能;通过指数运算锐化点扩散函数主瓣,拓展点扩散函数空间转移不变性假设的适用性。仿真和试验结果表明,相较于常规FFT-FISTA算法,改进算法能提升成像空间分辨率及动态范围,扩大FFT-FISTA算法的有效成像区域,压缩气体泄漏试验结果验证了改进算法的有效性。
文摘DFT is widely applied in the field of signal process and others. Most present rapid ways of calculation are either based on paralleled computers connected by such particular systems like butterfly network, hypercube etc; or based on the assumption of instant transportation, non-conflict communication, complete connection of paralleled processors and unlimited usable processors. However, the delay of communication in the system of information transmission cannot be ignored. This paper works on the following aspects： instant transmission, dispatching missions, and the path of information through the communication link in the computer cluster systems; layout of the dynamic FFT algorithm under the different structures of computer clusters.
