A track before detect method based on data fusion of infrared and radar is proposed to increase the probability of correct track initiation and shorten initiation time. Track before detect is a new technique for dim target detection and tracking which is useful when the signal-tonoise ratio of target is low. Particle filter and dynamic programming for track before detect are currently proposed ...

Real-radar data containing a small manoeuvring boat in sea clutter is processed using a finite difference (FD) implementation of continuous-discrete filtering with a four-dimensional constant velocity model. Measurement data is modelled assuming a Rayleigh sea clutter model with embedded Swerling 0, 1, or 3 target signal models. The results are examined to obtain a qualitative understanding of ...

Future mobile communications will bring a terminal diversity that until today has never happened before. 3GPP services will have to be developed taking into account every possible client. This paper describes an end-to-end framework able of delivering multimedia content that is tailored for each type of terminal. The framework is composed by three applications: a content authoring/analyzer appl...

Multipath is today still one of the most critical problems in satellite navigation, in particular in urban environments, where the received navigation signals can be affected by blockage, shadowing, and multipath reception. Latest multipath mitigation algorithms are based on the concept of sequential Bayesian estimation and improve the receiver performance by exploiting the temporal constraints...

We propose a high performance hybrid hardware/software solution to race detection that uses minimal hardware support. This hardware extension consists of a single extra instruction, StateChk, that simply returns the coherence state of a cache block without requiring any complex traps to handlers. To leverage this support, we propose a new algorithm for race detection. This detection algorithm u...

This paper presents a new lightweight algorithm for pruning inactive entries in version vectors (VVs). This algorithm lets each node remove inactive VV entries without any coordination with other nodes. It achieves this feature by devising a new way to compare two version vectors based on loosely synchronized clocks and placing a timing restriction on the behavior of the application. VVs comput...