By Topic

A low-complexity blind synchronization algorithm for UWB systems

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)
Jianfeng Hu ; Sch. of Inf. Eng., Beijing Univ. of Posts & Telecommun., Beijing ; Tiejun Lv

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.

Published in:

Signal Processing Advances in Wireless Communications, 2008. SPAWC 2008. IEEE 9th Workshop on

Date of Conference:

6-9 July 2008