{"title":"Rapid acquisition of ultra-wideband signals in the dense multipath channel","authors":"E. Homier, R. Scholtz","doi":"10.1109/UWBST.2002.1006329","DOIUrl":null,"url":null,"abstract":"Efficient serial search strategies are presented and shown to reduce drastically the mean acquisition time for UWB signals in a dense multipath environment. Inherent in traditional serial search problems is the assumption that only a single bin or a small number of consecutive bins can properly terminate the search. This assumption leads to search strategies which tend to be linear in nature, e.g., a linear sweep of the uncertainty region. Because of the dense multipath channel present in most UWB systems, this assumption is invalid as seen by the channel's relatively large delay spread. A generalized analysis of various search algorithms is presented based on a Markov chain model of a simple single-dwell serial search. The results from this analysis reveal that the linear search has a considerably larger mean acquisition time than the more efficient search strategy termed the bit reversal search.","PeriodicalId":272053,"journal":{"name":"2002 IEEE Conference on Ultra Wideband Systems and Technologies (IEEE Cat. No.02EX580)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"245","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2002 IEEE Conference on Ultra Wideband Systems and Technologies (IEEE Cat. No.02EX580)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/UWBST.2002.1006329","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 245
Abstract
Efficient serial search strategies are presented and shown to reduce drastically the mean acquisition time for UWB signals in a dense multipath environment. Inherent in traditional serial search problems is the assumption that only a single bin or a small number of consecutive bins can properly terminate the search. This assumption leads to search strategies which tend to be linear in nature, e.g., a linear sweep of the uncertainty region. Because of the dense multipath channel present in most UWB systems, this assumption is invalid as seen by the channel's relatively large delay spread. A generalized analysis of various search algorithms is presented based on a Markov chain model of a simple single-dwell serial search. The results from this analysis reveal that the linear search has a considerably larger mean acquisition time than the more efficient search strategy termed the bit reversal search.