SearcharxivSearch

arXiv subjects

Francesco Montorsi

Publications and source records attributed to Francesco Montorsi.

12 recordsLinked to original sources

Tracing long-lived atomic coherences generated via molecular conical intersections

Accessing coherences is key to fully understand and control ultrafast dynamics of complex quantum systems like molecules. Most photochemical processes are mediated by conical intersections (CIs), which generate coherences between electronic states in molecules. We show with accurate calculations performed on gas-phase methyl iodide that CI-induced electronic coherences of spin-orbit-split states persist in atomic iodine after dissociation. Our simulation predicts a maximum magnitude of vibronic coherence in the molecular regime of 0.75% of the initially photoexcited state population. Upon dissociation, one third of this coherence magnitude is transferred to a long-lived atomic coherence where vibrational decoherence can no longer occur. To trace these dynamics, we propose a table-top experimental approach--heterodyned attosecond four-wave-mixing spectroscopy (Hd-FWM). This technique can temporally resolve small electronic coherence magnitudes and reconstruct the full complex coherence function via phase cycling. Hence, Hd-FWM leads the way to a complete understanding and optimal control of spin-orbit-coupled electronic states in photochemistry.

physics.chem-ph

Stimulated X-ray Raman scattering for selective preparation of dark states bypassing optical selection rules

We present an X-ray based stimulated Raman approach to control the preparation of optically dark electronic states in generic molecular systems. Leveraging on the unique properties of core-level excited states, we demonstrate that optically forbidden transitions between singlet states, or between singlet and triplet states are made accessible. Two molecular systems are studied as a test-bed of the proposed approach, and its experimental feasibility is eventually discussed.

physics.chem-ph

Multiple Bayesian Filtering as Message Passing

In this manuscript, a general method for deriving filtering algorithms that involve a network of interconnected Bayesian filters is proposed. This method is based on the idea that the processing accomplished inside each of the Bayesian filters and the interactions between them can be represented as message passing algorithms over a proper graphical model. The usefulness of our method is exemplified by developing new filtering techniques, based on the interconnection of a particle filter and an extended Kalman filter, for conditionally linear Gaussian systems. Numerical results for two specific dynamic systems evidence that the devised algorithms can achieve a better complexity-accuracy tradeoff than marginalized particle filtering and multiple particle filtering.

math.ST

Parallel Concatenation of Bayesian Filters: Turbo Filtering

In this manuscript a method for developing novel filtering algorithms through the parallel concatenation of two Bayesian filters is illustrated. Our description of this method, called turbo filtering, is based on a new graphical model; this allows us to efficiently describe both the processing accomplished inside each of the constituent filter and the interactions between them. This model is exploited to develop two new filtering algorithms for conditionally linear Gaussian systems. Numerical results for a specific dynamic system evidence that such filters can achieve a better complexity-accuracy tradeoff than marginalized particle filtering.

stat.CO

Rao-Blackwellized Particle Smoothing as Message Passing

In this manuscript the fixed-lag smoothing problem for conditionally linear Gaussian state-space models is investigated from a factor graph perspective. More specifically, after formulating Bayesian smoothing for an arbitrary state-space model as forward-backward message passing over a factor graph, we focus on the above mentioned class of models and derive a novel Rao-Blackwellized particle smoother for it. Then, we show how our technique can be modified to estimate a point mass approximation of the so called joint smoothing distribution. Finally, the estimation accuracy and the computational requirements of our smoothing algorithms are analysed for a specific state-space model.

stat.CO

Marginalized Particle Filtering and Related Filtering Techniques as Message Passing

In this manuscript a factor graph approach is employed to investigate the recursive filtering problem for a mixed linear/nonlinear state-space model, i.e. for a model whose state vector can be partitioned in a linear state variable (characterized by conditionally linear dynamics) and a non linear state variable. Our approach allows us to show that: a) the factor graph characterizing the considered filtering problem is not cycle free; b) in the case of conditionally linear Gaussian systems, applying the sum-product rule, together with different scheduling procedures for message passing, to this graph results in both known and novel filtering techniques. In particular, it is proved that, on the one hand, adopting a specific message scheduling for forward only message passing leads to marginalized particle filtering in a natural fashion; on the other hand, if iterative strategies for message passing are employed, novel filtering methods, dubbed turbo filters for their conceptual resemblance to the turbo decoding methods devised for concatenated channel codes, can be developed.

math.ST

Design and Implementation of an Inertial Navigation System for Pedestrians Based on a Low-Cost MEMS IMU

Inertial navigation systems for pedestrians are infrastructure-less and can achieve sub-meter accuracy in the short/medium period. However, when low-cost inertial measurement units (IMU) are employed for their implementation, they suffer from a slowly growing drift between the true pedestrian position and the corresponding estimated position. In this paper we illustrate a novel solution to mitigate such a drift by: a) using only accelerometer and gyroscope measurements (no magnetometers required); b) including the sensor error model parameters in the state vector of an extended Kalman filter; c) adopting a novel soft heuristic for foot stance detection and for zero-velocity updates. Experimental results evidence that our inertial-only navigation system can achieve similar or better performance with respect to pedestrian dead-reckoning systems presented in related studies, although the adopted IMU is less accurate than more expensive counterparts.

cs.RO

Map-Aware Models for Indoor Wireless Localization Systems: An Experimental Study

The accuracy of indoor wireless localization systems can be substantially enhanced by map-awareness, i.e., by the knowledge of the map of the environment in which localization signals are acquired. In fact, this knowledge can be exploited to cancel out, at least to some extent, the signal degradation due to propagation through physical obstructions, i.e., to the so called non-line-of-sight bias. This result can be achieved by developing novel localization techniques that rely on proper map-aware statistical modelling of the measurements they process. In this manuscript a unified statistical model for the measurements acquired in map-aware localization systems based on time-of-arrival and received signal strength techniques is developed and its experimental validation is illustrated. Finally, the accuracy of the proposed map-aware model is assessed and compared with that offered by its map-unaware counterparts. Our numerical results show that, when the quality of acquired measurements is poor, map-aware modelling can enhance localization accuracy by up to 110% in certain scenarios.

cs.IT

On the Performance Limits of Map-Aware Localization

Establishing bounds on the accuracy achievable by localization techniques represents a fundamental technical issue. Bounds on localization accuracy have been derived for cases in which the position of an agent is estimated on the basis of a set of observations and, possibly, of some a priori information related to them (e.g., information about anchor positions and properties of the communication channel). In this manuscript new bounds are derived under the assumption that the localization system is map-aware, i.e., it can benefit not only from the availability of observations, but also from the a priori knowledge provided by the map of the environment where it operates. Our results show that: a) map-aware estimation accuracy can be related to some features of the map (e.g., its shape and area) even though, in general, the relation is complicated; b) maps are really useful in the presence of some combination of low signal-to-noise ratios and specific geometrical features of the map (e.g., the size of obstructions); c) in most cases, there is no need of refined maps since additional details do not improve estimation accuracy.

cs.IT

Statistical Characterization and Mitigation of NLOS Bias in UWB Localization Systems

Propagation in non-line-of-sight (NLOS) conditions is one of the major impairments in ultrawideband (UWB) wireless localization systems based on time-of-arrival (TOA) measurements. In this paper the problem of the joint statistical characterization of the NLOS bias and of the most representative features of LOS/NLOS UWB waveforms is investigated. In addition, the performance of various maximum-likelihood (ML) estimators for joint localization and NLOS bias mitigation is assessed. Our numerical results evidence that the accuracy of all the considered estimators is appreciably influenced by the LOS/NLOS conditions of the propagation environment and that a statistical knowledge of multiple signal features can be exploited to mitigate the NLOS bias, reducing the overall localization error.

cs.IT

Statistical Characterization and Mitigation of NLOS Errors in UWB Localization Systems

In this paper some new experimental results about the statistical characterization of the non-line-of-sight (NLOS) bias affecting time-of-arrival (TOA) estimation in ultrawideband (UWB) wireless localization systems are illustrated. Then, these results are exploited to assess the performance of various maximum-likelihood (ML) based algorithms for joint TOA localization and NLOS bias mitigation. Our numerical results evidence that the accuracy of all the considered algorithms is appreciably influenced by the LOS/NLOS conditions of the propagation environment.

cs.IT

On the Performance Limits of Pilot-Based Estimation of Bandlimited Frequency-Selective Communication Channels

In this paper the problem of assessing bounds on the accuracy of pilot-based estimation of a bandlimited frequency selective communication channel is tackled. Mean square error is taken as a figure of merit in channel estimation and a tapped-delay line model is adopted to represent a continuous time channel via a finite number of unknown parameters. This allows to derive some properties of optimal waveforms for channel sounding and closed form Cramer-Rao bounds.

cs.IT