Variable-delay tree-based PN code acquisition
S. Heidari · 2002
Before a communication link is established, spread spectrum systems must acquire the spreading PN code. The choice of code-acquisition algorithms is dictated by the trade-off of complexity and performance. A new tree-based search approach is proposed, which permits the resting of "multiple hypotheses" by utilizing the orthogonality property of the PN sequence. By defining a delayed decision mechanism and a depth dependent threshold, in the proposed approach, it is possible to permit a trade-off between the computational time required for the maximum likelihood (ML) test and the robustness lost in pure tree search.