An algorithm for recursive Frisch scheme system identification of linear single-input single-output errors-in-variables systems is developed. For the update of the estimated model parameters, a recursive bias-compensating least squares algorithm, which is based on the wellknown recursive least squares technique, is considered. The estimate of the output measurement noise variance is determined ...

Supervised relational learning over labeled graphs, e.g. via recursive neural nets, received considerable attention from the connectionist community. Surprisingly, with the exception of recursive self organizing maps, unsupervised paradigms have been far less investigated. In particular, no algorithms for density estimation over graphs are found in the literature. This paper introduces first a ...

Equalization plays an important role for the communication system receiver to correctly recover the symbol send by the transmitter, where the received signals may contain additive noise and intersymbol interference (ISI). Blind equalization is a technique of many equalization techniques at which the transmitted symbols over a communication channel can be recovered without the aid of training se...

We describe a novel recursive lter design technique for multi-scale \pyramid" transforms. The recursion in the design technique follows that of the pyramid construction, and allows us to solve a reduced design problem at each step. We demonstrate the use of this technique by designing lters of various orientation bandwidths for use in a \steerable pyramid" image transform.1

This paper introduces a new multistage CIC decimation filter based on non recursive and modified recursive structure of CIC filter. The resulting decimation filter has an improved magnitude response compared with that of a corresponding conventional CIC filter. Additionally the filter is a multiplierfree and has no filtering at high input rate. The sharpening technique is used to further improv...

We present a new approximation technique for quantum field theory. The standard one-loop result is used as a seed for a recursive formula that gives a sequence of improved Gaussian approximations for the generating functional. In a different setting, the basic idea of this recursive scheme is used in the second part of the paper to substantialy speed up the standard Monte Carlo algorithm.

We describe a novel technique for the automatic synthesis of tail-recursive programs. The technique is to specify the required program using the standard equations and then synthesise the tail-recursive program using the proofs as programs technique. This requires the speciication to be proved realisable in a constructive logic. Restrictions on the form of the proof ensure that the synthesised ...

We describe a novel technique for the automatic synthesis of tail-recursive programs. The technique is to specify the required program using the standard equations and then synthesise the tail-recursive program using the proofs as programs technique. This requires the speciication to be proved realisable in a constructive logic. Restrictions on the form of the proof ensure that the synthesised ...