Optimal sizing of CMOS analog circuits using gravitational search algorithm with particle swarm optimization

Optimized Design of a Self-Biased Amplifier for Seizure Detection Supplied by Piezoelectric Nanogenerator: Metaheuristic Algorithms versus ANN-Assisted Goal Attainment Method

This work is dedicated to parameter optimization for a self-biased amplifier to be used in preamplifiers for the diagnosis of seizures in neuro-diseases such as epilepsy. For the sake of maximum compactness, which is obligatory for all implantable devices, power is to be supplied by a piezoelectric nanogenerator (PENG). Several meta-heuristic optimization algorithms and an ANN (artificial neural network)-assisted goal attainment method were applied to the circuit, aiming to provide us with the set of optimal design parameters which ensure the minimal overall area of the preamplifier. These parameters are the slew rate, load capacitor, gain–bandwidth product, maximal input voltage, minimal input voltage, input voltage, reference voltage, and dissipation power. The results are re-evaluated and compared in the Cadence 180 nm SCL environment. It has been observed that, among the metaheuristic algorithms, the whale optimization technique reached the best values at low computational cost, decreased complexity, and the highest convergence speed. However, all metaheuristic algorithms were outperformed by the ANN-assisted goal attainment method, which produced a roughly 50% smaller overall area of the preamplifier. All the techniques described here are applicable to the design and optimization of wearable or implantable circuits.

Particle Swarm Optimization Algorithm with Mutation Operator for Particle Filter Noise Reduction in Mechanical Fault Diagnosis

In this paper, a new particle swarm optimization particle filter (NPSO-PF) algorithm is proposed, which is called particle cluster optimization particle filter algorithm with mutation operator, and is used for real-time filtering and noise reduction of nonlinear vibration signals. Because of its introduction of mutation operator, this algorithm overcomes the problem where by particle swarm optimization (PSO) algorithm easily falls into local optimal value, with a low calculation accuracy. At the same time, the distribution and diversity of particles in the sampling process are improved through the mutation operation. The defect of particle filter (PF) algorithm where the particles are poor and the utilization rate is not high is also solved. The mutation control function makes the particle set optimization process happen in the early and late stages, and improves the convergence speed of the particle set, which greatly reduces the running time of the whole algorithm. Simulation experiments show that compared with PF and PSO-PF algorithms, the proposed NPSO-PF algorithm has lower root mean square error, shorter running time, higher signal-to-noise ratio and more stable filtering performance. It is proved that the algorithm is suitable for real-time filtering and noise reduction processing of nonlinear signals.