Angular CMA: A modified Constant Modulus Algorithm providing steering angle updates

Conventional blind beamforming algorithms have no direct notion of the physical Direction of Arrival angle of an impinging signal. These blind adaptive algorithms operate by adjusting the complex steering vector in the case of changing signal conditions and directions. This paper presents Angular CMA, a blind beamforming method that calculates steering angle updates (instead of weight vector updates) to keep track of the desired signal. Angular CMA and its respective steering angle updates are particularly useful in the context of mixed-signal hierarchical arrays as means to find and distribute steering parameters. Simulations of Angular CMA show promising convergence behaviour, while having a lower complexity than alternative methods (e.g., MUSIC)

Experimental comparison of parameter estimation methods in adaptive robot control

In the literature on adaptive robot control a large variety of parameter estimation methods have been proposed, ranging from tracking-error-driven gradient methods to combined tracking- and prediction-error-driven least-squares type adaptation methods. This paper presents experimental data from a comparative study between these adaptation methods, performed on a two-degrees-of-freedom robot manipulator. Our results show that the prediction error concept is sensitive to unavoidable model uncertainties. We also demonstrate empirically the fast convergence properties of least-squares adaptation relative to gradient approaches. However, in view of the noise sensitivity of the least-squares method, the marginal performance benefits, and the computational burden, we (cautiously) conclude that the tracking-error driven gradient method is preferred for parameter adaptation in robotic applications

Evolving stochastic learning algorithm based on Tsallis entropic index

In this paper, inspired from our previous algorithm, which was based on the theory of Tsallis statistical mechanics, we develop a new evolving stochastic learning algorithm for neural networks. The new algorithm combines deterministic and stochastic search steps by employing a different adaptive stepsize for each network weight, and applies a form of noise that is characterized by the nonextensive entropic index q, regulated by a weight decay term. The behavior of the learning algorithm can be made more stochastic or deterministic depending on the trade off between the temperature T and the q values. This is achieved by introducing a formula that defines a time-dependent relationship between these two important learning parameters. Our experimental study verifies that there are indeed improvements in the convergence speed of this new evolving stochastic learning algorithm, which makes learning faster than using the original Hybrid Learning Scheme (HLS). In addition, experiments are conducted to explore the influence of the entropic index q and temperature T on the convergence speed and stability of the proposed method

A Robust Zero-point Attraction LMS Algorithm on Near Sparse System Identification

The newly proposed $l_1$ norm constraint zero-point attraction Least Mean Square algorithm (ZA-LMS) demonstrates excellent performance on exact sparse system identification. However, ZA-LMS has less advantage against standard LMS when the system is near sparse. Thus, in this paper, firstly the near sparse system modeling by Generalized Gaussian Distribution is recommended, where the sparsity is defined accordingly. Secondly, two modifications to the ZA-LMS algorithm have been made. The $l_1$ norm penalty is replaced by a partial $l_1$ norm in the cost function, enhancing robustness without increasing the computational complexity. Moreover, the zero-point attraction item is weighted by the magnitude of estimation error which adjusts the zero-point attraction force dynamically. By combining the two improvements, Dynamic Windowing ZA-LMS (DWZA-LMS) algorithm is further proposed, which shows better performance on near sparse system identification. In addition, the mean square performance of DWZA-LMS algorithm is analyzed. Finally, computer simulations demonstrate the effectiveness of the proposed algorithm and verify the result of theoretical analysis.Comment: 20 pages, 11 figure

Numerical product design: Springback prediction, compensation and optimization

Numerical simulations are being deployed widely for product design. However, the accuracy of the numerical tools is not yet always sufficiently accurate and reliable. This article focuses on the current state and recent developments in different stages of product design: springback prediction, springback compensation and optimization by finite element (FE) analysis. To improve the springback prediction by FE analysis, guidelines regarding the mesh discretization are provided and a new through-thickness integration scheme for shell elements is launched. In the next stage of virtual product design the product is compensated for springback. Currently, deformations due to springback are manually compensated in the industry. Here, a procedure to automatically compensate the tool geometry, including the CAD description, is presented and it is successfully applied to an industrial automotive part. The last stage in virtual product design comprises optimization. This article presents an optimization scheme which is capable of designing optimal and robust metal forming processes efficiently