Alessio De Angelis

IT
3papers
69citations
Novelty48%
AI Score23

3 Papers

SPApr 20, 2018
Practical Issues in the Synthesis of Ternary Sequences

Alessio De Angelis, Johan Schoukens, Keith R. Godfrey et al.

Several issues related to the practical synthesis of ternary sequences with specified spectra are addressed in this paper. Specifically, sequences with harmonic multiples of two and three suppressed are studied, given their relevance when testing and characterizing nonlinear systems. In particular, the effect of non-uniform Digital to Analog Converter (DAC) levels on the spectral properties of the generated signal is analyzed. It is analytically shown that the DAC non-uniform levels result in degraded harmonic suppression performance. Moreover, a new approach is proposed for designing ternary sequences, which is flexible and can be adapted to suit different requirements. The resulting sequences, denoted as randomized constrained sequences, are characterized theoretically by deriving an analytical expression of the power spectral density. Furthermore, they are extensively compared with three synthesis approaches proposed in the literature. The approach is validated by numerical simulations and experimental results, showing the potential to achieve harmonic suppression performance of approximately 100 dB.

NIJan 22, 2015
Joint Ranging and Clock Parameter Estimation by Wireless Round Trip Time Measurements

Satyam Dwivedi, Alessio De Angelis, Dave Zachariah et al.

In this paper we develop a new technique for estimating fine clock errors and range between two nodes simultaneously by two-way time-of-arrival measurements us- ing impulse-radio ultra-wideband signals. Estimators for clock parameters and the range are proposed that are robust with respect to outliers. They are analyzed numerically and by means of experimental measurement campaigns. The technique and derived estimators achieve accuracies below 1Hz for frequency estimation, below 1 ns for phase estimation and 20 cm for range estimation, at 4m distance using 100MHz clocks at both nodes. Therefore, we show that the proposed joint approach is practical and can simultaneously provide clock synchronization and positioning in an experimental system.

ITMar 10, 2015
Mobile Node Localization via Pareto Optimization: Algorithm and Fundamental Performance Limitations

Alessio De Angelis, Carlo Fischione

Accurate estimation of the position of network nodes is essential, e.g., in localization, geographic routing, and vehicular networks. Unfortunately, typical positioning techniques based on ranging or on velocity and angular measurements are inherently limited. To overcome the limitations of specific positioning techniques, the fusion of multiple and heterogeneous sensor information is an appealing strategy. In this paper, we investigate the fundamental performance of linear fusion of multiple measurements of the position of mobile nodes, and propose a new distributed recursive position estimator. The Cramér-Rao lower bounds for the parametric and a-posteriori cases are investigated. The proposed estimator combines information coming from ranging, speed, and angular measurements, which is jointly fused by a Pareto optimization problem where the mean and the variance of the localization error are simultaneously minimized. A distinguished feature of the method is that it assumes a very simple dynamical model of the mobility and therefore it is applicable to a large number of scenarios providing good performance. The main challenge is the characterization of the statistical information needed to model the Fisher information matrix and the Pareto optimization problem. The proposed analysis is validated by Monte Carlo simulations, and the performance is compared to several Kalman-based filters, commonly employed for localization and sensor fusion. Simulation results show that the proposed estimator outperforms the traditional approaches that are based on the extended Kalman filter when no assumption on the model of motion is used. In such a scenario, better performance is achieved by the proposed method, but at the price of an increased computational complexity.