On Optimal PN Code Acquisition

최적화된 PN Code Acquisition에 대한 연구

Many of the currently used PN code acquisition algorithms detect the phase of the incoming PN signal on the basis of ML estimation principle and utilize statistics grounded in taking inner products. By showing that any set of 2n-1 PN sequences arising in SSRG or MSRG (those typically used in IS'95 implementations) configuration constitutes a linearly independent set and that the number of candidate PN sequences has to equal the dimension of the span of the candidate PN sequences, we prove that the lowerbounding computational complexity involved in any PN code acquistion, utilizing (only) inner product computations at each stage of acquisition, corresponds precisely to those, such as double dwell acquistion circuitries, currently used.