Abstract: We present a family of data-reusing and affine
projection algorithms. For identification of a noisy linear finite
impulse response channel, a partial knowledge of a channel,
especially noise, can be used to improve the performance of
the adaptive filter. Motivated by this fact, the proposed scheme
incorporates an estimate of a knowledge of noise. A constraint, called
the adaptive noise constraint, estimates an unknown information of
noise. By imposing this constraint on a cost function of data-reusing
and affine projection algorithms, a cost function based on the adaptive
noise constraint and Lagrange multiplier is defined. Minimizing the
new cost function leads to the adaptive noise constrained (ANC)
data-reusing and affine projection algorithms. Experimental results
comparing the proposed schemes to standard data-reusing and affine
projection algorithms clearly indicate their superior performance.
Abstract: In order to provide accurate heart rate variability
indices of sympathetic and parasympathetic activity, the low
frequency and high frequency components of an RR heart rate signal
must be adequately separated. This is not always possible by just
applying spectral analysis, as power from the high and low frequency
components often leak into their adjacent bands. Furthermore,
without the respiratory spectra it is not obvious that the low
frequency component is not another respiratory component, which
can appear in the lower band. This paper describes an adaptive filter,
which aids the separation of the low frequency sympathetic and high
frequency parasympathetic components from an ECG R-R interval
signal, enabling the attainment of more accurate heart rate variability
measures. The algorithm is applied to simulated signals and heart rate
and respiratory signals acquired from an ambulatory monitor
incorporating single lead ECG and inductive plethysmography
sensors embedded in a garment. The results show an improvement
over standard heart rate variability spectral measurements.
Abstract: In this paper an efficient incomplete factorization preconditioner is proposed for the Least Mean Squares (LMS) adaptive filter. The proposed preconditioner is approximated from a priori knowledge of the factors of input correlation matrix with an incomplete strategy, motivated by the sparsity patter of the upper triangular factor in the QRD-RLS algorithm. The convergence properties of IPLMS algorithm are comparable with those of transform domain LMS(TDLMS) algorithm. Simulation results show efficiency and robustness of the proposed algorithm with reduced computational complexity.