共查询到20条相似文献,搜索用时 140 毫秒
1.
为进一步提高扩频测控系统的捕获速度,研究了借助辅助序列估计伪码相位的方法,分析了该估计算法的精度。针对该算法在高动态条件下估计偏差较大引起捕获概率骤降的问题,提出引入最大似然频偏估计修正相干载波的方法,显著提高捕获概率。设计了基于码相位估计和载波频率估计的快速捕获算法,仿真结果表明,该算法在载噪比较好的情况下可以有效完成捕获。为提高算法在较低载噪比时捕获的可靠性,提出将估计值作为部分匹配滤波辅助快速傅里叶变换( PMF-FFT )初值的综合捕获方法,与传统捕获方法相比,平均捕获时间显著降低,且并没有带来硬件复杂度的提高,具有一定的理论意义和工程应用价值。 相似文献
2.
3.
4.
5.
扩频通信中伪随机序列的捕获 总被引:2,自引:0,他引:2
1伪随机序列捕获的方法伪随机序列捕获的方法可分为串行搜索法和并行判决法两种。1.1串行搜索法串行搜索捕获是在本地伪随机序列和接收伪随机序列不同步的情况下,调整本地序列相位,逐一进行试验,直到发现某本地序列相位和接收序列相位基本一致为止,如图1所示。假设扩频系数为M,每码片两个采样时,需要进行2M次试验,则每次试验费时为伪随机序列一个周期的时间,即一个符号的时间。也就是说,在其它参量已同步且检测到无错误时,最多需要2M个符号后,才能对伪随机序列实现捕获。串行搜索捕获是以输入数据中伪随机序列相位为参考,… 相似文献
6.
7.
8.
9.
10.
卫星导航系统中,采用扩展复制重叠法(Extended Replica Folding Acquisition Search Tech-nique,XFAST)对长PN码进行直接捕获时,粗捕后得到的对齐码相位存在重叠模糊度.为减少去模糊处理的计算量,提高捕获速度,提出了一种新的去模糊处理算法.新算法在得到粗捕对齐码相位结果后,先对本地码序列重新按照对齐相位进行排列、分段、段内循环移位等操作,然后进行段间叠加,再与接收码序列通过FFT-IFFT运算实现循环相关运算,从而确定对齐码相位所在的子码段,得到无模糊度的捕获结果.理论分析与仿真结果证明,该算法可以在分段叠加段数和子段长满足一定关系的条件下,在检测性能满足系统要求下,大大降低去模糊处理的计算量和操作时间,从而提高捕获速度. 相似文献
11.
An acquisition method of long pseudo-noise (PN) sequences in direct-sequence spread spectrum (DS/SS) systems is presented. The concurrent cross correlation of locally generated auxiliary signals with the incoming PN sequence produces binary search estimates leading to an initial approximation of the input signal's PN offset. The PN receiver then uses a closed-loop subsystem to determine the true offset of the incoming PN signal. New phase estimates are generated from successive corrections of likely errors in the binary search. The acquisition scheme's average acquisition time and its variance are analytically determined. Simulation results show that the proposed acquisition scheme is faster than the conventional serial receiver. A hybrid serial/parallel PN acquisition receiver is used for comparing the acquisition performance given similar hardware complexity. The hybrid receiver used the same number of parallel correlators as used in the proposed receiver's input phase estimator. Simulation results show that the proposed system provides an improved performance under normal operating conditions. 相似文献
12.
Suwon Kang Yong-Hwan Lee 《Selected Areas in Communications, IEEE Journal on》2001,19(6):1128-1137
We propose a new scheme for rapid acquisition of PN signals in direct-sequence spread spectrum (DS/SS) systems by estimating the phase of the received PN signal with the use of an auxiliary signal. The auxiliary signal can be generated by a sum of the phase shifted PN signals. The phase of the incoming PN signal is estimated using the properties of cross correlation between the PN signal and the auxiliary signal. True phase alignment is detected using a conventional serial search scheme, where the initial phase of the local PN generators is set to a value obtained by the phase estimator. The performance of the proposed acquisition scheme is analytically evaluated in terms of the mean acquisition time. Numerical results show that the proposed scheme can achieve acquisition at least two times faster than the conventional scheme in the nominal operating condition 相似文献
13.
14.
15.
Adaptive PN code acquisition using instantaneous power-scaled detection threshold under Rayleigh fading and pulsed Gaussian noise jamming 总被引:1,自引:0,他引:1
Kwonhue Choi Kyungwhoon Cheun Taejin Jung 《Communications, IEEE Transactions on》2002,50(8):1232-1235
An adaptive serial search pseudonoise (PN) code acquisition scheme is proposed, in which the detection threshold is scaled by the instantaneous received power measured prior to PN code correlation. We observe that the proposed scheme achieves significantly improved mean acquisition times compared to the conventional nonadaptive schemes under Rayleigh fading and pulsed Gaussian noise jamming. Furthermore, the proposed scheme is shown to be optimum under pulsed Gaussian noise jamming in the sense that it forces the worst case jamming fraction to unity. 相似文献
16.
Direct sequence spread spectrum systems require a local replica of the pseudonoise (PN) sequence to be synchronized with the received signal's spreading code. A method is proposed to improve the PN sequence acquisition time and decrease the acquisition time variability. The proposed method is based on a binary search algorithm. At each stage of the algorithm, an auxiliary signal is used to formulate a new search region within the PN sequence, and at each stage the search region is reduced by half. The region containing the incoming PN phase is therefore obtained within O(log2 (N+1)) steps. A closed loop coherent PN acquisition algorithm presented by Salih and Tantaratana (1996) motivated the use of the auxiliary signal, and the algorithm of Salih et al. is also used for comparison. Results indicate the algorithm presented in this paper can achieve a factor of two to three times improvement in the mean acquisition time with a significant decrease in the acquisition time variability 相似文献
17.
18.
针对载波多普勒下的伪码捕获问题,分析了基于分段相关-视频积累方法的多驻留伪码捕获系统的最优性能。推导了正交双通道检测器的检测概率和虚警概率表达式,给出了多驻留系统的捕获时间均值表达式;通过采用遗传算法对系统进行优化设计,增大了系统的多普勒容限,降低了捕获时间;分析了驻留级数、多普勒和载噪比等对捕获系统性能的影响。研究成果可用于指导扩频系统接收机伪码捕获模块的设计。 相似文献
19.
在深空测距任务中,高精度的伪码捕获是后续执行伪码跟踪的关键前提.传统基于时频二维搜索的频偏估计算法对于深空测距中频率偏移范围较大的情况难以满足伪码捕获实时性要求.为此,提出了改进的时频二维搜索算法,通过在传统时频二维搜索算法的前端引入快速傅里叶变换(Fast Fourier Transform,FFT)算法对多普勒频偏... 相似文献
20.
A new approach to rapid PN code acquisition using iterative message passing techniques 总被引:4,自引:0,他引:4
Iterative message passing algorithms on graphs, which are generalized from the well-known turbo decoding algorithm, have been studied intensively in recent years because they can provide near-optimal performance and significant complexity reduction. In this paper, we demonstrate that this technique can be applied to pseudorandom code acquisition problems as well. To do this, we represent good pseudonoise (PN) patterns using sparse graphical models, then apply the standard iterative message passing algorithms over these graphs to approximate maximum-likelihood synchronization. Simulation results show that the proposed algorithm achieves better performance than both serial and hybrid search strategies in that it works at low signal-to-noise ratios and is much faster. Compared with full parallel search, this approach typically provides significant complexity reduction. 相似文献