Multi Detector Fusion of Dynamic TOA Estimation using Kalman Filter

In this paper, we propose fusion of dynamic TOA (time of arrival) from multiple non-coherent detectors like energy detectors operating at sub-Nyquist rate through Kalman filtering. We also show that by using multiple of these energy detectors, we can achieve the performance of a digital matched filter implementation in the AWGN (additive white Gaussian noise) setting. We derive analytical expression for number of energy detectors needed to achieve the matched filter performance. We demonstrate in simulation the validity of our analytical approach. Results indicate that number of energy detectors needed will be high at low SNRs and converge to a constant number as the SNR increases. We also study the performance of the strategy proposed using IEEE 802.15.4a CM1 channel model and show in simulation that two sub-Nyquist detectors are sufficient to match the performance of digital matched filter

A Statistical Analysis of Multipath Interference for Impulse Radio UWB Systems

In this paper, we develop a statistical characterization of the multipath interference in an Impulse Radio (IR)-UWB system, considering the standardized IEEE 802.15.4a channel model. In such systems, the chip length has to be carefully tuned as all the propagation paths located beyond this limit can cause interframe/intersymbol interferences (IFI/ISI). Our approach aims at computing the probability density function (PDF) of the power of all multipath components with delays larger than the chip time, so as to prevent such interferences. Exact analytical expressions are derived first for the probability that the chip length falls into a particular cluster of the multipath propagation model and for the statistics of the number of paths spread over several contiguous clusters. A power delay profile (PDP) approximation is then used to evaluate the total interference power as the problem appears to be mathematically intractable. Using the proposed closed-form expressions, and assuming minimal prior information on the channel state, a rapid update of the chip time value is enabled so as to control the signal to interference plus noise ratio.Comment: 17 pages, 9 figures; submitted to the Journal of the Franklin Institute on Sept. 24, 201

D-SLATS: Distributed Simultaneous Localization and Time Synchronization

Through the last decade, we have witnessed a surge of Internet of Things (IoT) devices, and with that a greater need to choreograph their actions across both time and space. Although these two problems, namely time synchronization and localization, share many aspects in common, they are traditionally treated separately or combined on centralized approaches that results in an ineffcient use of resources, or in solutions that are not scalable in terms of the number of IoT devices. Therefore, we propose D-SLATS, a framework comprised of three different and independent algorithms to jointly solve time synchronization and localization problems in a distributed fashion. The First two algorithms are based mainly on the distributed Extended Kalman Filter (EKF) whereas the third one uses optimization techniques. No fusion center is required, and the devices only communicate with their neighbors. The proposed methods are evaluated on custom Ultra-Wideband communication Testbed and a quadrotor, representing a network of both static and mobile nodes. Our algorithms achieve up to three microseconds time synchronization accuracy and 30 cm localization error

Indoor wireless communications and applications

Chapter 3 addresses challenges in radio link and system design in indoor scenarios. Given the fact that most human activities take place in indoor environments, the need for supporting ubiquitous indoor data connectivity and location/tracking service becomes even more important than in the previous decades. Specific technical challenges addressed in this section are(i), modelling complex indoor radio channels for effective antenna deployment, (ii), potential of millimeter-wave (mm-wave) radios for supporting higher data rates, and (iii), feasible indoor localisation and tracking techniques, which are summarised in three dedicated sections of this chapter

Realization Limits of Impulse-Radio UWB Indoor Localization Systems

In this work, the realization limits of an impulse-based Ultra-Wideband (UWB) localization system for indoor applications have been thoroughly investigated and verified by measurements. The analysis spans from the position calculation algorithms, through hardware realization and modeling, up to the localization experiments conducted in realistic scenarios. The main focus was put on identification and characterization of limiting factors as well as developing methods to overcome them

Implementation Aspects of a Transmitted-Reference UWB Receiver

In this paper, we discuss the design issues of an ultra wide band (UWB) receiver targeting a single-chip CMOS implementation for low data-rate applications like ad hoc wireless sensor networks. A non-coherent transmitted reference (TR) receiver is chosen because of its small complexity compared to other architectures. After a brief recapitulation of the UWB fundamentals and a short discussion on the major differences between coherent and non-coherent receivers, we discuss issues, challenges and possible design solutions. Several simulation results obtained by means of a behavioral model are presented, together with an analysis of the trade-off between performance and complexity in an integrated circuit implementation

Accurate Positioning in Ultra-Wideband Systems

Cataloged from PDF version of article.Accurate positioning systems can be realized via ultra-wideband signals due to their high time resolution. In this article, position estimation is studied for UWB systems. After a brief introduction to UWB signals and their positioning applications, two-step positioning systems are investigated from a UWB perspective. It is observed that time-based positioning is well suited for UWB systems. Then time-based UWB ranging is studied in detail, and the main challenges, theoretical limits, and range estimation algorithms are presented. Performance of some practical time-based ranging algorithms is investigated and compared against the maximum likelihood estimator and the theoretical limits. The trade-off between complexity and accuracy is .observe