欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
针对测距m序列扩频码，提出一种快速捕获方法。假定m序列发生器的移位寄存器个数为r，该方法首先根据连续接收的一段长度为r的序列，通过一个寄存器状态解算器，推算出发送完这段序列后m序列发生器寄存器的状态，并将本地m序列发生器的寄存器状态置为该状态。接收机接收上述长度为r的序列，再接收一段长度为2r-1的序列后，本地m序列发生器开始工作，并与接收的m序列进行相关运算和相关性判定。若相关性超过某一阈值，判定结果为“相关”，则捕获成功，否则继续重复上述过程，直到判定结果为“相关”为止。出现不相关情况的原因是作为解算器输入的上述一段长度为r的序列包含误码，以r=20为例，其概率仅为1-0.9802=0.0198，也就是说，这种方法一次捕获成功的概率为0.9802。
英文摘要：
A fast acquisition algorithm of m-sequence spread spectrum codes for ranging is put forward in this paper. Pre-suming that the number of the shift registers of m-sequences generator is r ,according to a consecutively-received sequence with length r,the register state of the m-sequence generator is deduced through a register state resolver when the sequence is trans-mitted completely,and then the local registers of the m-sequences generator is set the same state. After another sequence with length 2r-1 is received,a local m-sequence generator starts working,and simultaneously the correlator compares the local m-se-quence with the received one by calculation. The correlation judgment is made. If the correlation is larger than a threshold,the decision that the current cell is true and the search finishes is made. Otherwise the search system examines the next cell and re-peats the above-mentioned process,until the result of the judgment is“correlation”. In the case of r=20,for example,the probability of finishing acquisition in one search is 0.980 2.
同期刊论文项目
同项目期刊论文
期刊信息
位置：