By Topic

Multipath Aided Rapid Acquisition: Optimal Search Strategies

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Suwansantisuk, W. ; Lab. for Inf. & Decision Syst., MIT, Cambridge, MA ; Win, M.Z.

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

Published in:

Information Theory, IEEE Transactions on  (Volume:53 ,  Issue: 1 )