作者：
Liu, Gong-XuShi, Ling-FengXidian Univ
Minist Educ Key Lab High Speed Circuit Design & EMC Xian 710071 Shaanxi Peoples R China Xidian Univ
Inst Elect CAD Xian 710071 Shaanxi Peoples R China
Magnetic data obtained from a magnetic sensor usually fluctuate in a certain range, which makes it difficult to estimate the magnetic heading accurately. In fact, magnetic heading information is usually submerged in n...
详细信息
Magnetic data obtained from a magnetic sensor usually fluctuate in a certain range, which makes it difficult to estimate the magnetic heading accurately. In fact, magnetic heading information is usually submerged in noise because of all kinds of electromagnetic interference and the diversity of the pedestrian's motion states. In order to solve this problem, a new adaptive algorithm based on the ( s heading information. First, a 3D indoor localization platform is set up based on MPU9250. Then, several groups of data are measured by changing the experimental environment and pedestrian's motion pace. The raw data from the attached inertial measurement unit are calibrated and arranged into a time-stamped array and written to a data file. Later, the data file is imported into MATLAB for processing and analysis using the proposed adaptive algorithm. Finally, the algorithm is verified by comparison with the existing algorithm. The experimental results show that the algorithm has strong robustness and good fault tolerance, which can detect the heading information accurately and in real-time.
A novel adaptation strategy is proposed for Acoustic Echo Cancellation (AEC). The new algorithm firstly partitions the adaptive filter into several blocks and the successive blocks with the maximum l(2) norm are consi...
详细信息
ISBN:
(纸本)9781538631423
A novel adaptation strategy is proposed for Acoustic Echo Cancellation (AEC). The new algorithm firstly partitions the adaptive filter into several blocks and the successive blocks with the maximum l(2) norm are considered to be the active blocks. Then the coefficients of the active blocks are adapted with large update probability to ensure the identification accuracy while the zero coefficients are adapted with small update probability to decrease the number of adapting coefficients. By excluding most of the zero coefficients from adaptation, the new algorithm improves its performance in terms of convergence and computation. The simulation performed in the context of AEC demonstrates the robustness and the advantages of the new algorithm.
In this paper,we presented the derivation of an adaptive algorithm for time-varying system and verified that it satisfied convergence *** on the concept of distance in parameter space,we proposed a robust identificati...
详细信息
ISBN:
(数字)9789881563934
ISBN:
(纸本)9781538629185
In this paper,we presented the derivation of an adaptive algorithm for time-varying system and verified that it satisfied convergence *** on the concept of distance in parameter space,we proposed a robust identification method which identified the smallest set of discrete transfer functions under the assumption that its parameters were time-varying and described derivation of an adaptive law based on verification and update algorithm of the identified model *** also described that the proposed algorithm satisfied the convergence properties through numerical simulation.
In this paper, we address the problem of speech enhancement by adaptive filtering algorithms. A particular attention has been paid to the backward blind source separation (BBSS) algorithm and its use in crosstalk resi...
详细信息
In this paper, we address the problem of speech enhancement by adaptive filtering algorithms. A particular attention has been paid to the backward blind source separation (BBSS) algorithm and its use in crosstalk resistant speech enhancement applications. In this paper, we propose to implement the BBSS algorithm in the wavelet-domain. The proposed backward wavelet BBSS (WBBSS) algorithm is then used in speech enhancement application when important crosstalk interferences are presents. The new WBBSS algorithm shows better performances in terms of convergence speed and steady state in comparison with the classical BBSS one. The performances properties of the proposed algorithm are evaluated in term of segmental SNR (SegSNR), segmental mean square error (SegMSE), and cepstral distance (CD) criteria. The obtained results have confirmed the best performance of the proposed WBBSS algorithm in a lot of situations when blind noisy observations are available.
An adaptive algorithm for speech enhancement is studied in this *** propose the adaptive Lyapunov speech enhancement algorithm for nonlinear speech enhancement system using FIR *** using the Lyapunov stability theory,...
详细信息
ISBN:
(纸本)9781509046584
An adaptive algorithm for speech enhancement is studied in this *** propose the adaptive Lyapunov speech enhancement algorithm for nonlinear speech enhancement system using FIR *** using the Lyapunov stability theory,the filter coefficients can adaptively adjust so that the error converges to zero *** adaptive algorithm ensures the speech enhancement system has a better performance than the traditional least mean square *** the case that the size,weight and power consumption,the design of a microphone array for hearing aids are serious hard to establish,the algorithm still *** last,an example of speech enhancement system result demonstrated the feasibility and effectiveness of the proposed adaptive algorithm.
Estimating phasors as quickly as possible while guaranteeing accuracy is important to ensure reliable fault detection and isolation in power systems. Window length is an important factor for phasor estimation. The con...
详细信息
Estimating phasors as quickly as possible while guaranteeing accuracy is important to ensure reliable fault detection and isolation in power systems. Window length is an important factor for phasor estimation. The conventional fixed window length cannot handle well the many and diverse fault voltage and current signals. By analysing the relationship between accuracy and window length of a phasor estimation using the matrix pencil method, a criterion is established to determine whether or not the estimated phasor is credible. Then, an adaptive algorithm to estimate the phasors using dynamic window length is proposed. Analytical and experimental investigations show that the proposed algorithm can accurately and timely estimate phasors and can enable reliable and quick relay operation.
This paper considers the problem of identifying continuous-time linear time-invariant systems in frequency domain. An adaptive identification is proposed in terms of continuous rational orthogonal bases, where one-by-...
详细信息
This paper considers the problem of identifying continuous-time linear time-invariant systems in frequency domain. An adaptive identification is proposed in terms of continuous rational orthogonal bases, where one-by-one selection of poles is performed for the basis functions. It is shown that the proposed algorithm achieves approximate optimality under these selections. The adaptivity of the proposed algorithm lies in that different poles are selected for basis functions for different systems. The effectiveness of the proposed adaptive algorithm is demonstrated by simulation results. (C) 2018, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.
An altered(1) adaptive genetic algorithm (AAGA) with crossover strategy and mutation strategy is proposed in this paper, in order to solve the problems of simple genetic algorithm (SGA) and adaptive genetic algorithm ...
详细信息
ISBN:
(纸本)9781450365123
An altered(1) adaptive genetic algorithm (AAGA) with crossover strategy and mutation strategy is proposed in this paper, in order to solve the problems of simple genetic algorithm (SGA) and adaptive genetic algorithm (AGA). The problems include the phenomenon of premature convergence and the trouble of local optimum. The proposed AAGA method compared with SGA and AGA by investigation and research on the production process of a tire manufacturer. The analysis results indicate that the average energy consumption and minimum value of AAGA is lower than that of the other two algorithms, and the convergence performance of the proposed algorithm is better. The new method can provide a more effective technical guidance to solve the problems of energy optimization in practical application.
This paper views the classical Chiu-Jain algorithm, originally proposed for congestion control of network links, as a decentralized algorithm for the fair allocation of a total of c units of a shared resource among n ...
详细信息
This paper views the classical Chiu-Jain algorithm, originally proposed for congestion control of network links, as a decentralized algorithm for the fair allocation of a total of c units of a shared resource among n users. A new analysis is given of the general case of additive increase and multiplicative decrease (AIMD) dynamics, from the perspective of virtual equilibria and variable structure systems, leading to a better understanding of the Chiu-Jain algorithm, which is one example of AIMD dynamics. It is shown that the variable structure discrete dynamical system that describes the evolution of the share of each individual, starting from an arbitrary initial allocation, always attains a neighbourhood of the fair share (c/n) for each user, under the assumption that the latter is known. Subsequently, a new adaptive version of the algorithm, called adaptive AIMD, is described, with the same property of converging to the fair share, without assuming that it is known. Simulations that show the behaviour and advantages of the proposed adaptive AIMD adaptive algorithm are given. Copyright (C) 2015 John Wiley & Sons, Ltd.
This paper proposes and analyzes an a posteriori error estimator for the finite element multi-scale discretization approximation of the Steklov eigenvalue problem. Based on the a posteriori error estimates, an adaptiv...
详细信息
This paper proposes and analyzes an a posteriori error estimator for the finite element multi-scale discretization approximation of the Steklov eigenvalue problem. Based on the a posteriori error estimates, an adaptive algorithm of shifted inverse iteration type is designed. Finally, numerical experiments comparing the performances of three kinds of different adaptive algorithms are provided, which illustrate the efficiency of the adaptive algorithm proposed here. (C) 2016 IMACS. Published by Elsevier B.V. All rights reserved.
暂无评论