| 摘要 |
A code space is divided into three windows of different sizes. The position of the strongest ray in the code space is called the "normal". Two search correlators are allocated to window (1), four search correlators to window (2), and two search correlators to window (3). This allocation of the search correlators is based on an estimation of the probability of a new ray appearing in the relevant portions of the code space, relative to the normal. To begin with, the four search correlators allocated to the window (2) are controlled to occupy the normal, 0.5 chips, 1.0 chips and 1.5 chips respectively. After dwelling at their positions for 512 chips (the dwell time) each search correlator is moved four steps (two chips) along the code space. Each of the search correlators dwells at its new position for 512 chips, before again moving two chips further along the code space. Whilst the search correlators are dwelling at a position in the code space, the signal power at that position is calculated, and a signal detector acts according to the signal power so detected. When the search correlators reach the end of a window, they are moved back to the start of that window, and the search of the window is repeated. Due to the relative sizes of the windows and to the numbers of correlators assigned to those windows, the frequency of searching is different for each window. |
