Multipath aided rapid acquisition: Optimal search strategies

In this paper, we propose a search technique that takes advantage of multipath, which has long been considered deleterious for efficient communication, to aid the sequence acquisition in dense multipath channels. We consider a class of serial-search strategies,and use optimization and convexity theories to determine fundamental limits of achievable mean acquisition times (MATs). In particular, we derive closed-form expressions for both the minimum and maximum MATs and the conditions for achieving these limits. We prove that a fixed-step serial search, a form of nonconsecutive serial search, achieves a near-optimal MAT. We also prove that the conventional serial search, in which consecutive cells are tested serially, should be avoided as it results in the maximum MAT. Our results are valid for all signal-to-noise ratio (SNR) values, regardless of the specifics of the detection layer and the fading distributions.