{"title":"A low-complexity blind synchronization algorithm for UWB systems","authors":"Jianfeng Hu, Tiejun Lv","doi":"10.1109/SPAWC.2008.4641558","DOIUrl":null,"url":null,"abstract":"In this paper, a low complexity blind synchronization algorithm is proposed for ultra wideband (UWB) communication systems in the multipath environment. Using the first order statistics of the received signal, the proposed algorithm is carried out without aided data. The synchronization parameter and nuisance ones are separated from each other on account of the structure of the Vandermonde matrix, and their estimates are obtained by one-dimensional searching according to the orthogonality among vectors. During the searching process, relative path delays and attenuations come out as by-products. Most importantly, the proposed algorithm has a very low complexity, because the computational requirements are determined mainly by simple additions and inner products among vectors. Simulations and comparisons are performed to illustrate the promising performance of the proposed algorithm.","PeriodicalId":197154,"journal":{"name":"2008 IEEE 9th Workshop on Signal Processing Advances in Wireless Communications","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE 9th Workshop on Signal Processing Advances in Wireless Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPAWC.2008.4641558","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper, a low complexity blind synchronization algorithm is proposed for ultra wideband (UWB) communication systems in the multipath environment. Using the first order statistics of the received signal, the proposed algorithm is carried out without aided data. The synchronization parameter and nuisance ones are separated from each other on account of the structure of the Vandermonde matrix, and their estimates are obtained by one-dimensional searching according to the orthogonality among vectors. During the searching process, relative path delays and attenuations come out as by-products. Most importantly, the proposed algorithm has a very low complexity, because the computational requirements are determined mainly by simple additions and inner products among vectors. Simulations and comparisons are performed to illustrate the promising performance of the proposed algorithm.