The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper we investigate a combination of two LMS adaptive algorithms, one with large and another one with small step size. Large step size of one of the filters allows fast initial convergence and small step size of the other filter allows a small steady state mean square error. The outputs of the two filters are combined together via a combination parameter λ. We compute this parameter using...
In order to improve the global search ability and the convergence speed of the Artificial Fish Swarm Algorithm (AFSA), a novel Quantum Artificial Fish Swarm Algorithm (QAFSA) which is based on the concepts and principles of quantum computing, such as the quantum bit and quantum gate is proposed in this paper. The position of the Artificial Fish (AF) is encoded by the angle in [0, 2π] based on the...
Consider a group of peers, an ideal random peer sampling service should return a peer, which is an unbiased independent random sample of the group. This paper focuses on peer sampling service based on view shuffling (aka gossip-based peer sampling), where each peer is equipped with a local view of size c. This view should correspond to a uniform random sample of size c of the whole system in order...
This paper derives an adaptation algorithm named least mean modulus-Newton (LMM-Newton) algorithm that combines least mean modulus (LMM) algorithm with simple recurrent calculation of the inverse covariance matrix of the filter input using the Newton's method. The LMM-Newton algorithm achieves significant improvement in the convergence speed of complex-domain adaptive filters with a strongly correlated...
Inversion for seismic impedance is an ill-posed and nonlinear problem. Hence inversion results are non-unique and unstable, and low and high frequency components of inversion results are missed. Combining regularization with fast simulated annealing (FSA) can help to alleviate these problems. To achieve this, we developed an inversion method by constructing a new objective function including the edge-preserving...
In this paper, a modified Differential Evolution (MDE) is proposed for solving the Integer Programming problems. In order to increase the probability of each parent to generate a better offspring, each solution is allowed to generate more than one offspring through six different mutation operators. A migration operator is designed to overcome premature convergence of DE. In practical applications,...
Echo path estimation in echo canceling for teleconference system is a problem in double-talk condition. The correlation function based algorithms were defined by the authors to solve this problem. In this paper, in order to improve the convergence speed of correlation function based algorithm, we propose a new modified proportionate step-size adaptation method, and then implement it into frequency...
The interference cancellation ratio (ICR) is influenced by the zero offsets of the devices in the weight branches. The gains in weight branches are moved to error feedback loop to guarantee ICR without influencing the convergence speed. The limiter is used to protect the multipliers thus the system becomes a nonlinear system. Through the describing function method and simulation, the stability, dynamic...
This paper presents a hybrid algorithm for parameter estimation of synchronous generator. For large-residual problems (i.e., f(x) is large or f(x) is severely nonlinear), the performance of the Gauss-Newton method and Levenberg-Marquardt method is usually poor, and the slow convergence even causes iteration emergence divergence. The Quasi-Newton method can superlinearly converge, but it is not robust...
Largely overlooked insights into the convergence behavior of the (N)LMS algorithm focusing on its worst and best case performance is presented. These insights motivate the use of the multigrid paradigm, well known from the numerical solution of partial differential equations, as an important tool in achieving improved convergence speed in (N)LMS-type adaptive filters. We present such a multigrid adaptive...
Recently, the capacity region of the Gaussian broadcast channel has been characterized. For a given transmit power constraint, those points on the boundary of the capacity region can be regarded as the set of optimal operational points. The present work addresses the problem of selecting the point within this set that satisfies given constraints on the ratios between rates achieved by the different...
In this paper, a new fast convergence adaptive algorithm with variable step size is proposed for FIR adaptive filter. This new proposed algorithm is derived based on the quasi-Newton family. Simulation results are presented to compare the convergence of the proposed algorithm with least mean square (LMS) algorithm and RLS algorithm. It shows that the proposed new algorithm has comparable convergence...
The authors present an algorithm for a standard filter design problem, the design of an FIR (finite impulse response) filter that best approximates, in the Chebyshev sense, a desired complex-valued frequency response. The algorithm is iterative and stable, and exhibits good convergence speed. Both complex and real-valued impulse responses can be designed with it. Examples are given for both cases...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.