Active noise control has been shown to be a promising solution for reducing noise levels in turboprop aircraft. The first part of this paper shows the performance of a broadband active noise control system based upon ...
详细信息
Least squares error (LSE) method adopted recursively can be used to track the frequency and amplitude of signals in steady states and kinds of non-steady ones in power system. Taylor expansion is used to give another ...
详细信息
Least squares error (LSE) method adopted recursively can be used to track the frequency and amplitude of signals in steady states and kinds of non-steady ones in power system. Taylor expansion is used to give another version of this recursive LSE method. Aided by variable-windowed short-time discrete Fourier transform, recursive LSEs with and without Taylor expansion converge faster than the original ones in the circumstance of off-nominal input singles. Different versions of recursive LSE were analyzed under various states, such as signals of off-nominal frequency with harmonics, signals with step changes, signals modulated by a sine signal, signals with decaying DC offset and additive Gaussian white noise. Sampling rate and data window size are two main factors influencing the performance of method recursive LSE in transient states. recursive LSE is sensitive to step changes of signals, but it is in-sensitive to signals' modulation and singles with decaying DC offset and noise.
This paper presents an efficient recursive learning algorithm for improving generalization performance of radial basis function (RBF) neural networks. The approach combines the rival penalized competitive learning (PR...
详细信息
This paper presents an efficient recursive learning algorithm for improving generalization performance of radial basis function (RBF) neural networks. The approach combines the rival penalized competitive learning (PRCL) [Xu, L., Kizyzak, A. & Oja, E. (1993). Rival penalized competitive learning for clustering analysis, RBF net and curve detection, IEEE Transactions on Neural Networks, 4, 636-649] and the regularized least squares (RLS) to provide an efficient and powerful procedure for constructing a minimal RBF network that generalizes very well. The RPCL selects the number of hidden units of network and adjusts centers, while the RLS constructs the parsimonious network and estimates the connection weights. In the RLS we derived a simple recursive algorithm, which needs no matrix calculation, and so largely reduces the computational cost. This combined algorithm significantly enhances the generalization performance and the real-time capability of the RBF networks. Simulation results of three different problems demonstrate much better generalization performance of the present algorithm over other existing similar algorithms. (C) 2000 Elsevier Science Ltd. All rights reserved.
An adaptive kernel principal component analysis (AKPCA) method, which has the flexibility to accurately track the kernel principal components (KPC), is presented. The contribution of this paper may be divided into two...
详细信息
An adaptive kernel principal component analysis (AKPCA) method, which has the flexibility to accurately track the kernel principal components (KPC), is presented. The contribution of this paper may be divided into two parts. First, KPC are recursively formulated to overcome the batch nature of standard kernel principal component analysis (KPCA). This formulation is derived from the recursive eigendecomposition of kernel covariance matrix and indicates the KPC variation caused by the new data. Second, kernel covariance matrix is correctly updated to adapt to the changing characteristics of data. In this adaptive method, the KPC is adaptively adjusted without re-eigendecomposing the kernel Gram matrix. The proposed method not only maintains constant update speed and memory usage as the data-size increases, but also alleviates sub-optimality of the KPCA method for non-stationary data. Experiments for simulation data and real applications are detailed to assess the utility of the proposed method. The results demonstrate that our approach yields improvements in terms of both computational speed and approximation accuracy. Crown Copyright (C) 2009 Published by Elsevier B.V. All rights reserved.
The Nash model was used for application of the Kalman filter. The state vector of the rainfall-runoff system was constituted by the IUH (instantaneous unit hydrograph) estimated by the Nash model and the runoff estima...
详细信息
The Nash model was used for application of the Kalman filter. The state vector of the rainfall-runoff system was constituted by the IUH (instantaneous unit hydrograph) estimated by the Nash model and the runoff estimated by the Nash model using the Kalman filter. The initial values of the state vector were assumed as the average of 10% of the IUH peak values and the initial runoff estimated from the average IUH. The Nash model using the Kalman filter with a recursive algorithm accurately predicted runoff from a basin in Korea. The filter allowed the IUH to vary in time, increased the accuracy of the Nash model and reduced physical uncertainty of the rainfall-runoff process in the river basin. (C) 1998 John Wiley & Sons, Ltd.
In this letter, an efficient algorithm to determine the optimal delay in linear finite impulse response equalizers based on the minimum mean-square-error criterion is proposed. The algorithm uses the Levinson-Durbin (...
详细信息
In this letter, an efficient algorithm to determine the optimal delay in linear finite impulse response equalizers based on the minimum mean-square-error criterion is proposed. The algorithm uses the Levinson-Durbin (L-D) recursion as a starting point to find the values of the mean-square error for equalizers with all nontrivial delays. Despite the exhaustive search approach, the complexity of the proposed algorithm is only doubled when compared to the calculation of the equalizer with one prescribed delay. Such increase in complexity may be fully justified in practice because it yields globally optimal equalizer's design.
This paper presents a comparison design of comb decimators based on the non-recursive algorithm and the recursive algorithm. Compared with the recursive algorithm, the main advantage of the non-recursive algorithm is ...
详细信息
This paper presents a comparison design of comb decimators based on the non-recursive algorithm and the recursive algorithm. Compared with the recursive algorithm, the main advantage of the non-recursive algorithm is its abilities of reducing power consumption and increasing circuit speed especially when the decimation ratio and filter order are high. Based on the non-recursive algorithm, a decimator with programmable filter orders (3rd, 4th and 5th), decimation ratios (8, 16, 32 and 64) and input bits (1 and 2 bits) has been implemented in a 0.6 mu m 3.3 V CMOS process. Its measured core power consumption is 44 mW at the oversampling rate of 25 MHz and its highest input data rate is 110 MHz.
This paper considers the problem of identifiability and parameter estimation of single-input-single-output, linear, time-invariant, stable, continuous-time systems under irregular and random sampling schemes. Conditio...
详细信息
This paper considers the problem of identifiability and parameter estimation of single-input-single-output, linear, time-invariant, stable, continuous-time systems under irregular and random sampling schemes. Conditions for system identifiability are established under inputs of exponential polynomial types and a tight bound on sampling density. Identification algorithms of Gauss-Newton iterative types are developed to generate convergent estimates. When the sampled output is corrupted by observation noises, input design, sampling times, and convergent algorithms are intertwined. Persistent excitation (PE) conditions for strongly convergent algorithms are derived. Unlike the traditional identification, the PE conditions under irregular and random sampling involve both sampling times and input values. Under the given PE conditions, iterative and recursive algorithms are developed to estimate the original continuous-time system parameters. The corresponding convergence results are obtained. Several simulation examples are provided to verify the theoretical results. (C) 2015 Elsevier Ltd. All rights reserved.
An efficient numerical procedure for computing the scattering coefficients of a radially stratified tilted cylinder is discussed. Compared with the previous algorithms, computations for scattering field in our code ar...
详细信息
An efficient numerical procedure for computing the scattering coefficients of a radially stratified tilted cylinder is discussed. Compared with the previous algorithms, computations for scattering field in our code are extended to fairly large parameters, up to more than 10,000 and a few millions in number of layers, and computational time is only a few seconds. The capabilities of our code depend also on the memory of computer. The algorithm can also be used for absorbing or nonabsorbing cylinders in different electromagnetic wave bands. Compared with the known results, the algorithm is validated. At last, the algorithm is used to simulate the intensity distributions of two-layered cylinders with large size parameter and of graded-index polymer optical fiber (GI-POF) at tilted incidence, which supplies information on non-intrusive measurement on-line of refractive index profile by light scattering. (c) 2006 Elsevier B.V. All rights reserved.
A new algorithm is proposed that smoothly incorporates the nonlinear estimation of the attitude quaternion using Davenport's q-method and the estimation of nonattitude states through an extended Kalman filter. The...
详细信息
A new algorithm is proposed that smoothly incorporates the nonlinear estimation of the attitude quaternion using Davenport's q-method and the estimation of nonattitude states through an extended Kalman filter. The new algorithm is compared to an existing one and the various similarities and differences are discussed. The validity of the proposed approach is confirmed by numerical simulations.
暂无评论