Abstract
In this paper, we propose several subspace-based algorithms for near-far robust synchronization of asynchronous direct-sequence code-division multiple access (DS-CDMA) systems. A tuning parameter is introduced in the form of a scalar weighting of the propagation delay estimator cost functions. The asymptotic (large data blocks) variance of the algorithms is derived and the optimum weighting strategy, in the sense that asymptotic variance is minimized, is found. The analytical results are validated by simulations. The algorithms are shown to be near-far robust, both analytically and experimentally. Performance is of course improved by using training sequences, however, not by much; furthermore, optimum weighting is shown to yield only modest performance gains.
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.
