Abstract
By using the direct approach to the analysis of the serial-search spread-spectrum code acquisition, the author presents the approximate analysis of the cumulative probability density function (CDF) of the acquisition time. This approach is based on the binomial approximation to the distribution of the partial acquisition times, instead of the Gaussian one used previously. The binomial approximation gives very accurate results but, more importantly, it shows that the analysis of the arbitrary detection/verification scheme can be reduced to the much simpler analysis of the equivalent single-dwell system, whose parameters depend only on the mean test times and not on their distribution. Based on the exact results, simple closed-form approximations are derived for the CDF in the case of the straight-line serial search with uniform a priori distribution, which might be useful in practice.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
