论文部分内容阅读
现有的分析扩谱码同步搜索问题的方法是一维相关函数的方法,并由此得出搜索时间随处理增益增加而增加的结论。搜索时间与处理增益之间的矛盾大大影响了扩谱性能的提高。本文从扩谱码与该码延迟复共轭乘积的付氐变换出发,从二维角度分析了扩谱码搜索的难易性。将该法应用于二元PN码上去,我们得出:二元PN码同步时最难搜索。使用这种方法,我们给出了易搜索扩谱码应具有的特征。最后给出了一种不需搜索的扩谱码的讨论。
The existing methods for analyzing the problem of the simultaneous search of the spreading code are the one-dimensional correlation functions, and the conclusion that the search time increases as the processing gain increases is derived. The conflict between search time and processing gain greatly affects the improvement of spread spectrum performance. This paper starts from the Fourier transform of the complex conjugate product of the spreading code and the delay code, and analyzes the difficulty of searching the spreading code from a two-dimensional perspective. Apply this method to binary PN code, we come to the conclusion: binary PN code synchronization is the most difficult to search. Using this method, we give the features that easy-to-search spread spectrum codes should have. Finally, a discussion of the search-free spread spectrum code is given.