Reweighted Error Minimization Algorithm to Enhance Current Following Adaptability in a Multiobjective EV Charging Architecture

Author(s):  
Debasish Mishra ◽  
Bhim Singh ◽  
B.K. Panigrahi
2018 ◽  
Vol 27 (10) ◽  
pp. 1850164 ◽  
Author(s):  
Nimet Korkmaz ◽  
İsmail Öztürk ◽  
Adem Kalinli ◽  
Recai Kiliç

In the literature, the parabolic function of the Izhikevich Neuron Model (IzNM) is transformed to the Piecewise Linear (PWL) functions in order to make digital hardware implementations easier. The coefficients in this PWL functions are identified by utilizing the error-prone classical step size method. In this paper, it is aimed to determine the coefficients of the PWL functions in the modified IzNM by using the stochastic optimization methods. In order to obtain more accurate results, Genetic Algorithm and Artificial Bee Colony Algorithm (GA and ABC) are used as alternative estimation methods, and amplitude and phase errors between the original and the modified IzNMs are specified with a newly introduced error minimization algorithm, which is based on the exponential forms of the complex numbers. In accordance with this purpose, GA and ABC algorithms are run 30 times for each of the 20 behaviors of a neuron. The statistical results of these runs are given in the tables in order to compare the performance of three parameter-search methods and especially to see the effectiveness of the newly introduced error minimization algorithm. Additionally, two basic dynamical neuronal behaviors of the original and the modified IzNMs are realized with a digital programmable device, namely FPGA, by using new coefficients identified by GA and ABC algorithms. Thus, the efficiency of the GA and ABC algorithm for determining the nonlinear function parameters of the modified IzNM are also verified experimentally.


2019 ◽  
Vol 14 (1) ◽  
pp. 1
Author(s):  
Toni Simolin ◽  
Antti Rautiainen ◽  
Juha Koskela ◽  
Pertti Järventausta
Keyword(s):  

Author(s):  
Maryam Alibeigi ◽  
Shahriar S. Moghaddam

Background & Objective: This paper considers a multi-pair wireless network, which communicates peer-to-peer using some multi-antenna amplify-and-forward relays. Maximizing the throughput supposing that the total relay nodes’ power consumption is constrained, is the main objective of this investigation. We prove that finding the beamforming matrix is not a convex problem. Methods: Therefore, by using a semidefinite relaxation technique we find a semidefinite programming problem. Moreover, we propose a novel algorithm for maximizing the total signal to the total leakage ratio. Numerical analyses show the effectiveness of the proposed algorithm which offers higher throughput compared to the existing total leakage minimization algorithm, with much less complexity. Results and Conclusion: Furthermore, the effect of different parameters such as, the number of relays, the number of antennas in each relay, the number of transmitter/receiver pairs and uplink and downlink channel gains are investigated.


Sign in / Sign up

Export Citation Format

Share Document