期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Constructions for almost perfect binary sequence pairs with even length 被引量:2
1
作者 PENG Xiuping LIN Hongbin +1 位作者 REN Jiadong1 CHEN Xiaoyu 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2018年第2期256-261,共6页
The concept of the binary sequence pair is generalized from a single binary sequence. Binary sequence pairs are applied in many fields of radar, sonar or communication systems, in which signals with optimal periodic c... The concept of the binary sequence pair is generalized from a single binary sequence. Binary sequence pairs are applied in many fields of radar, sonar or communication systems, in which signals with optimal periodic correlation are required. Several types of almost perfect binary sequence pairs of length T = 2q are constructed, where q is an odd number. These almost perfect binary sequence pairs are based on binary ideal sequence or binary ideal two-level correlation sequence pairs by using Chinese remainder theorem. For these almost perfect binary sequence pairs with good balanced property, their corresponding divisible difference set pairs(DDSPs) are also derived. 展开更多
关键词 sequence design divisible difference set pair(DDSP) binary sequence pair almost perfect
在线阅读 下载PDF
Periodic performance of the chaotic spread spectrum sequence on finite precision 被引量:3
2
作者 Zhu Canyan Zhang Lihua +2 位作者 Wang Yiming Liu Jiasheng Mao Lingfeng 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2008年第4期672-678,共7页
It is well known that the periodic performance of spread spectrum sequence heavily affects the correlative and secure characteristics of communication systems. The chaotic binary sequence is paid more and more attenti... It is well known that the periodic performance of spread spectrum sequence heavily affects the correlative and secure characteristics of communication systems. The chaotic binary sequence is paid more and more attention since it is one kind of applicable spread spectrum sequences. However, there are unavoidable short cyclic problems for chaotic binary sequences in finite precision. The chaotic binary sequence generating methods are studied first. Then the short cyclic behavior of the chaotic sequences is analyzed in detail, which are generated by quantification approaches with finite word-length. At the same time, a chaotic similar function is defined for presenting the cyclic characteristics of the sequences. Based on these efforts, an improved method with scrambling control for generating chaotic binary sequences is proposed. To quantitatively describe the improvement of periodic performance of the sequences, an orthogonal estimator is also defined. Some simulating results are provided. From the theoretical deduction and the experimental results, it is concluded that the proposed method can effectively increase the period and raise the complexity of the chaotic sequences to some extent. 展开更多
关键词 chaotic binary sequence finite precision periodic performance orthogonal estimator
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部