18 September 2006 in IEEE Signal Processing Letters
The aim of a variable step size normalized least-mean-square (VSS-NLMS) algorithm is to try to solve the conflicting requirement of fast convergence and low misadjustment of the NLMS algorithm. Numerous VSS-NLMS algorithms can be found in the literature with a common point for most of them: they may not work very reliably since they depend on several parameters that are not simple to tune in practice. The objective of this letter is twofold. First, we explain a simple and elegant way to derive VSS-NLMS-type algorithms. Second, a new nonparametric VSS-NLMS is proposed that is easy to control and gives good performances in the context of acoustic echo cancellation
15 April 2008 in IEEE Transactions on Signal Processing
A new framework for designing robust adaptive filters is introduced. It is based on the optimization of a certain cost function subject to a time-dependent constraint on the norm of the filter update. Particularly, we present a robust variable step-size NLMS algorithm which optimizes the square of the a posteriori error. We also show the link between the proposed algorithm and another one derived using a robust statistics approach. In addition, a theoretical model for predicting the transient and steady-state behavior and a proof of almost sure filter convergence are provided. The algorithm is then tested in different environments for system identification and acoustic echo cancelation applications.
6 May 2015 in IEEE Transactions on Wireless Communications
This paper studies the gains, in terms of served requests, attainable through out-of-band device-to-device (D2D) video exchanges in large cellular networks. A stochastic framework, in which users are clustered to exchange videos, is introduced, considering several aspects of this problem, i.e., the video caching policy, user matching for exchanges, and aspects regarding scheduling and transmissions. A family of admissible protocols is introduced: in each protocol the users are clustered by means of a hard-core point process and, within the clusters, video exchanges take place. Two metrics, quantifying the “local” and “global” fractions of video requests served through D2D are defined, and relevant trade-off regions involving these metrics, as well as quality-of-service constraints, are identified. A simple communication strategy is proposed and analyzed to obtain inner bounds to the trade-off regions and to draw conclusions on the performance attainable through D2D. To this end, the analysis of the time-varying interference that the nodes experience and the tight approximations of its Laplace transform are derived.
23 April 2007 in IEEE Transactions on Signal Processing
A variable regularized affine projection algorithm (VR-APA) is introduced, without requiring the classical step size. Its use is supported from different points of view. First, it has the property of being Hinfin optimal and it satisfies certain error energy bounds. Second, the time-varying regularization parameter is obtained by maximizing the speed of convergence of the algorithm. Although we first derive the VR-APA for a linear time invariant (LTI) system, we show that the same expression holds if we consider a time-varying system following a first-order Markov model. We also find expressions for the power of the steady-state error vector for the VR-APA and the standard APA with no regularization parameter. Particularly, we obtain quite different results with and without using the independence assumption between the a priori error vector and the measurement noise vector. Simulation results are presented to test the performance of the proposed algorithm and to compare it with other schemes under different situations. An important conclusion is that the former independence assumption can lead to very inaccurate steady-state results, especially when high values of the projection order are used
9 December 2008 in IEEE Transactions on Signal Processing
We present a fast robust recursive least-squares (FRRLS) algorithm based on a recently introduced new framework for designing robust adaptive filters. The algorithm is the result of minimizing a cost function subject to a time-dependent constraint on the norm of the filter update. Although the characteristics of the exact solution to this problem are known, there is no closed-form solution in general. However, the approximate solution we propose is very close to the optimal one. We also present some theoretical results regarding the asymptotic behavior of the algorithm. The FRRLS is then tested in different environments for system identification and acoustic echo cancellation applications.
30 December 2016 in IEEE Transactions on Instrumentation and Measurement
A novel modular positive-sequence estimation algorithm for phasor measurement units (PMUs) is described in this paper with a focus on the restrictions imposed by the IEEE C37.118.1-2011 standard. The first stage consists in a three-phase demodulator which allows us to separate the positive-sequence from the negative-sequence signal in the frequency domain and to eliminate the zero-sequence signal. The second stage is a prefilter that mitigates noise and interference, thus relaxing the filtering requirements of the following stage. The suitability of a linear-phase FIR filter is shown and a comparison of single and multistage designs is presented. On the third stage, a digital state-space-based extension of a synchronous reference frame-phase-locked loop is used for tracking of amplitude, phase, frequency, and rate of change of frequency. It is shown that a phase predictor inside the loop is required. The fourth stage is a compensation algorithm which takes into account the narrowband nature of the input signal to perform an accurate compensation of the filter effects on the signal of interest. Analytical properties of the system are then presented, providing insight into the main factors that affect global performance. Finally, a strict evaluation of the system is presented for both M and P class PMU.