Primitive Polynomials for Iterative Recursive Soft Sequential Acquisition of Concatenated Sequences
Primitive Polynomials for Iterative Recursive Soft Sequential Acquisition of Concatenated Sequences
复制标题
DOI：
10.1109/access.2019.2892375
复制
发表时间：
2019-01
期刊：
影响因子：
3.9
通讯作者：
Abbas Ahmed;Panagiotis Botsinis;S. Won;Lie-liang Yang;L. Hanzo
中科院分区：
文献类型：
--
作者：
Abbas Ahmed;Panagiotis Botsinis;S. Won;Lie-liang Yang;L. Hanzo
针对用于生成串联序列的一对$m$ -序列产生的伪噪声信号，提出了一种迭代初始序列采集技术，该技术依靠软入软出检测来提高采集性能。这种递归软序列估计技术的复杂度随着序列中芯片数量的增加呈线性增长。接收到$S$连续的（$2^{S}-1$）芯片序列就足以使接收器的本地串联序列生成器同步。因此，这种初始同步技术非常适合长$m$序列和连接序列。另一个关键结果是比较$m$ -序列和连接序列在获取时间上的差异。我们还观察到，对于$m$ -序列和连接序列，低阶原元多项式（PPs）都比高阶多项式具有更好的性能。当考虑具有较高抽头数量的PPs时，串联序列的利用能够实现超过3db的信噪比增益，超过$m$ -序列。
An iterative initial sequence acquisition technique is proposed for the pseudo-noise signal derived from a pair of $m$ -sequences used for generating the concatenated sequence, which relies on the soft-in-soft-out detection to improve the acquisition performance. This recursive soft sequential estimation technique has a linearly increasing complexity with the number of chips in the concatenated sequence. Receiving as few as $S$ consecutive chips of a ( $2^{S}-1$ )-chip sequence is sufficient for the local concatenated-sequence generator of the receiver to synchronize. Hence, this initial synchronization technique is eminently suitable for long $m$ -sequences and concatenated sequences. Another key result is the comparison of $m$ -sequences and concatenated sequences regarding the acquisition time. It is also observed that low-order primitive polynomials (PPs) achieve better performances than higher-order polynomials for both the $m$ -sequences and concatenated sequences. When considering PPs having a higher number of taps, the exploitation of concatenated sequences is capable of achieving in excess of 3-dB signal-to-noise ratio gains over $m$ -sequences.