| A joint data and channel estimation/tracking algorithm is presented for the time varying frequency selective multi-path fading channel. An in-depth formulation of time varying frequency selective channel structure is developed for a receiver employing multiple antennae where the formulation of the channel model enables channel tap delays a fraction of the symbol period. Moreover the Doppler f...

A geometric formulation of the "null-steering" array antenna pattern synthesis problems for arbitrary array geometries is proposed. The formulation allows the use of some simple ktuitive techniques for the construction of the array weights. In particular it is shown that the optimum weight vector can be obtained in an appropriately selected "weight vector subspace" via a recursive projection al...

Abstract: We introduce and study distributions of sets of binary variables that are symmetric, that is each has equally probable levels. The joint distribution of these special types of binary variables, if generated by a recursive process of linear main effects is essentially parametrized in terms of marginal correlations. This contrasts with the log-linear formulation of joint probabilities i...

This paper presents a novel recursive maximum a posteriori update for the Kalman formulation of undelayed bearing-only SLAM. The estimation update step is cast as an optimization problem for which we can prove the global minimum is reachable via a bidirectional search using Gauss-Newton’s method along a one-dimensional manifold. While the filter is designed for mapping just one landmark, it is ...

In recent years, several attempts have been made to define query languages characterized by both high expressive power and easy query formulation. Several issues concern graphical applications, based on the diagrammatic representation of a semantic model and visual interaction. This paper describes the architecture and the implementation of a graphical query system, based on the diagrammatic re...

We examine here the modular and recursive formulation of the inverse dynamics of parallel architecture manipulators. The concept of the decoupled natural orthogonal complement (DeNOC) is combined with the spatial parallelism of the robots of interest to develop an inverse dynamics algorithm which is both recursive and modular. INTRODUCTION The modular and recursive inverse dynamics formulation ...

Ackermann's function can be expressed using an iterative algorithm, which essentially takes the form of a term rewriting system. Although termination this algorithm is far from obvious, its equivalence to traditional recursive formulation--and therefore totality--has simple proof in Isabelle/HOL. This small example formalising mathematics assistant, with focus on treatment difficult recursions.