In this paper we consider the optimization of com-paction gain for lters belonging to a restricted class of IIR lters, having the transfer function H(z) = 1 p 2 ? z ?2N + z ?1 A(z 2) where A(z) is a stable allpass lter. This parameter-ization has the advantage that perfect reconstruction condition is automatically fullllled (see (3) below). Our results represent a generalization off6] where onl...

A robust lter for the estimation of the pulse repetition interval (PRI) of a periodic radar pulse train is derived. The lter uses only the pulse times of arrival (TOA) and is speciically designed, using mixture distribution techniques developed for the robustiication of the Kalman lter to outliers, to be robust to both missing pulses and to a small number of spurious noise pulses. In fact, the ...

This paper, introduces a new lter bank structure called the perfect reconstruction circular convolution (PRCC) lter bank. These lter banks satisfy the perfect reconstruction properties, namely, the paraunitary properties in the discrete frequency domain. We further show how the PRCC analysis and synthesis lter banks are completely implemented in this domain and give a simple and a exible method...

A novel extension of the classical signal -adaptive median lter (SAM) is proposed in this paper. It is the so-called morphological signal -adaptive median lter (MSAM). Two mod-iications are introduced in the SAM lter aiming at: (1) enhancing SAM impulse detection mechanism so that it detects not only impulses of a constant amplitude but randomly-valued impulses as well, (2) employing an anisotr...

| This paper proposes modiications to the Kalman lter-based multiuser code-division multiple-access (CDMA) detector of 1] based on the normalised least mean square (NLMS) lter, the motivation being complexity reduction. The variable step size and information reuse concepts are investigated. The proposed detectors are compared with the conventional and Kalman lter detector in terms of complexity...

IMAGE ENHANCEMENT V. Pahor, G. Ramponi, G.L. Sicuranza D.E.E.I., University of Trieste via A. Valerio, 10, 34127 Trieste, Italy Tel: +39 40 6767140; fax: +39 40 6763460 e-mail: [email protected] ABSTRACT A two-dimensional adaptive nonlinear lter, called 2{ D FIR{PWL lter is introduced for noise cancellation from images. It is based on the cascade of a linear FIR lter and a piecewise...

In this paper, we propose a new radar tracking algorithm based on the Gaussian sum "lter. To alleviate the computational burden associated with the Gaussian sum "lter, we have developed a new systematic and e$cient way to approximate a non-Gaussian and measurement-dependent function by a weighted sum of Gaussian density functions and we have also suggested a way to alleviate the growing memory ...

Information managers at each of the 26 sites in the Long Term Ecological Research (LTER) Network face many challenges managing structurally and thematically diverse ecological data sets collected by LTER scientists. Since the LTER’s inception in 1980, LTER information managers have partnered with computer scientists to seek innovative information management solutions. This panel of three comput...

Employing a recently introduced framework, within which a large number of classical and modern adaptive lter algorithms can be viewed as special cases, a generic, variable step-size adaptive lter has been presented. Variable Step-Size (VSS) Normalized Least Mean Square (VSSNLMS) and VSS A ne Projection Algorithms (VSSAPA) are particular examples of adaptive algorithms covered by this generic va...

• list(A) is the set of all lists having their elements in A • nil is the empty list • a :: q is the list starting with an element a and continuing with the tail list q • q − is the append (list concatenation) operator: for any list l, we have nil q −l def. l and (a :: q) q −l def. a :: (q q −l). • lterf (l) is the lter operator, recursively de ned as follows: lterf ( ) = and lterf (a :: q) = {...