Hechmi Khaterchi

dblp:360/2316 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2025
0009-0003-8099-9415ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 2 · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 since 2021
YearPublicationVenuePosition
2025 Characterization of Coils in an Inductive Link for Wireless Power Transfer to Implantable Medical Devices
abstract
Wireless power transfer (WPT) based on inductive coupling has gained increasing interest in scientific research, particularly in the field of implantable medical devices (IMDs). The efficiency of a WPT system primarily depends on the operating frequency, the quality factors (Q1 and Q2) of the coils, and significantly on the coupling coefficient (k) between the two coils forming the link. This efficiency can be enhanced by optimizing the geometric parameters of the coils or adjusting the operating frequency. In this paper, we characterize the coil parameters constituting the inductive link to demonstrate the impact of their variation on the energy transfer efficiency. Furthermore, we address the design considerations of the coils for wireless power transfer applications in IMDs.
Jaouher Chrouta, Hechmi Khaterchi, Achraf Jabeur Telmoudi, Abderrahmen Zaafouri
CoDIT2
2023 Comparative Study of MPPT Algorithms: P&O, INC, and PSO for PV System Optimization
abstract
This work compares three MPPT (maximum power point tracking) algorithms for solar panels: Perturb and Observe (P&O), Incremental Conductance (INC), and Particle Swarm Optimization (PSO). Despite the fact that each algorithm seeks to optimize output power by adjusting tension and charge current, they differ in method and complexity. The P&O algorithm is simple to implement, but it can be unstable. The INC algorithm is more effective in managing several sites of operation, but the PSO method is more difficult yet effective. As a result, the choice of algorithm is determined by the ultimate application and the required complexity.
Houssine El Hammedi, Jaouher Chrouta, Hechmi Khaterchi, Abderrahmen Zaafouri
CoDIT3