scholarly journals Use the Adaptive Algorithm to Estimate the Reverse Motive Force, Position and Speed of the Motor (BLDC) and Compare with the Gradient Estimation Method based on Parametric Modeling

2021 ◽  
Vol 183 (3) ◽  
pp. 57-64
Author(s):  
Reem Toumi ◽  
D. Marwan Jabra Labbad
Author(s):  
Namyong Kim ◽  
Mingoo Kang

Blind algorithms based on the Euclidean distance (ED) between the output distribution function and a set of Dirac delta functions have a heavy computational burden of  due to some double summation operations for the sample size and symbol points. In this paper, a recursive approach to the estimation of the ED and its gradient is proposed to reduce the computational complexity for efficient implementation of the algorithm. The ED of the algorithm is comprised of information potentials (IPs), and the IPs at the next iteration can be calculated recursively based on the currently obtained IPs. Utilizing the recursively estimated IPs, the next step gradient for the weight update of the algorithm can be estimated recursively with the present gradient. With this recursive approach, the computational complexity of gradient calculation has only . The simulation results show that the proposed gradient estimation method holds significantly reduced computational complexity keeping the same performance as the block processing method


2017 ◽  
Vol 141 (5) ◽  
pp. 3796-3796
Author(s):  
Kelli Succo ◽  
Scott D. Sommerfeldt ◽  
Kent L. Gee ◽  
Tracianne B. Neilsen

Sign in / Sign up

Export Citation Format

Share Document