Adaptive filters for sparse system identification

Sparse system identification has attracted much attention in the field of adaptive algorithms, and the adaptive filters for sparse system identification are studied. Firstly, a new family of proportionate normalized least mean square (PNLMS) adaptive algorithms that improve the performance of identifying block-sparse systems is proposed. The main proposed algorithm, called block-sparse PNLMS (BS-PNLMS), is based on the optimization of a mixed ℓ2,1 norm of the adaptive filter\u27s coefficients. A block-sparse improved PNLMS (BS-IPNLMS) is also derived for both sparse and dispersive impulse responses. Meanwhile, the proposed block-sparse proportionate idea has been extended to both the proportionate affine projection algorithm (PAPA) and the proportionate affine projection sign algorithm (PAPSA). Secondly, a generalized scheme for a family of proportionate algorithms is also presented based on convex optimization. Then a novel low-complexity reweighted PAPA is derived from this generalized scheme which could achieve both better performance and lower complexity than previous ones. The sparseness of the channel is taken into account to improve the performance for dispersive system identification. Meanwhile, the memory of the filter\u27s coefficients is combined with row action projections (RAP) to significantly reduce the computational complexity. Finally, two variable step-size zero-point attracting projection (VSS-ZAP) algorithms for sparse system identification are proposed. The proposed VSS-ZAPs are based on the approximations of the difference between the sparseness measure of current filter coefficients and the real channel, which could gain lower steady-state misalignment and also track the change in the sparse system --Abstract, page iv

The study on adaptive Cartesian grid methods for compressible flow and their applications

This research is mainly focused on the development of the adaptive Cartesian grid methods for compressibl  e flow. At first, the ghost cell method and its applications for inviscid compressible flow on adaptive tree Cartesian grid are developed. The proposed method is successfully used to evaluate various inviscid compressible flows around complex bodies. The mass conservation of the method is also studied by numerical analysis. The extension to three-dimensional flow is presented. Then, an h-adaptive Runge–Kutta discontinuous Galerkin (RKDG) method is presented in detail for the development of high accuracy numerical method under Cartesian grid. This method combined with the ghost cell immersed boundary method is also validated by well documented test problems involving both steady and unsteady compressible flows over complex bodies in a wide range of Mach numbers. In addition, in order to suppress the failure of preserving positivity of density or pressure, which may cause blow-ups of the high order numerical algorithms, a positivity-preserving limiter technique coupled with h-adaptive RKDG method is developed. Such a method has been successfully implemented to study flows with the large Mach number, strong shock/obstacle interactions and shock diffraction. The extension of the method to viscous flow under the adaptive Cartesian grid with hybrid overlapping bodyfitted grid is developed. The method is validated by benchmark problems and has been successfully implemented to study airfoil with ice accretion. Finally, based on an open source code, the detached eddy simulation (DES) is developed for massive separation flow, and it is used to perform the research on aerodynamic performance analysis over the wing with ice accretion

A novel traveling-wave-based method improved by unsupervised learning for fault location of power cables via sheath current monitoring

In order to improve the practice in maintenance of power cables, this paper proposes a novel traveling-wave-based fault location method improved by unsupervised learning. The improvement mainly lies in the identification of the arrival time of the traveling wave. The proposed approach consists of four steps: (1) The traveling wave associated with the sheath currents of the cables are grouped in a matrix; (2) the use of dimensionality reduction by t-SNE (t-distributed Stochastic Neighbor Embedding) to reconstruct the matrix features in a low dimension; (3) application of the DBSCAN (density-based spatial clustering of applications with noise) clustering to cluster the sample points by the closeness of the sample distribution; (4) the arrival time of the traveling wave can be identified by searching for the maximum slope point of the non-noise cluster with the fewest samples. Simulations and calculations have been carried out for both HV (high voltage) and MV (medium voltage) cables. Results indicate that the arrival time of the traveling wave can be identified for both HV cables and MV cables with/without noise, and the method is suitable with few random time errors of the recorded data. A lab-based experiment was carried out to validate the proposed method and helped to prove the effectiveness of the clustering and the fault location