Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.09273

A Single-Inductor N:1 Resonant Switched-Capacitor Ladder Converter with Efficient Continuous Voltage Conversion Capability

Sandeep Reddy Kukunuru·M Mahmudul Hasan Sajeeb·Rohit Reddy Karnaty·Loai G. Salem
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper presents an N:1 resonant switched-capacitor (ReSC) ladder converter of an output voltage that can be regulated continuously below the native N:1 resonant ratio while maintaining high efficiency. The topology can be generalized to any N-to-1 dc-dc conversion application while requiring only a single inductor. Efficient wide-range voltage regulation is realized by operating the bottom stack of the ReSC switches as diodes to maintain their switching always in phase with the inductor current, and hence, circumvent circulating currents that increase the inductor RMS current and ohmic losses under frequency control. A theoretical model has been developed to predict the output voltage and efficiency of the converter, with simulation results confirming its accuracy for N = 1, 2, and 4. A hardware prototype on a printed circuit board is developed to validate the performance of the proposed frequency-controlled regulation scheme. The prototype achieves a peak efficiency of 97% (94.3%) with a load of 30Ohms (resp. 6Ohms) and an efficiency >90% while generating a 9V USB-compatible voltage from a 40V-to-60V input. The measurement results match the model predictions within 0.63% accuracy.

Explore related subjects

eess.SYcs.SY

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sandeep Reddy Kukunuru, M Mahmudul Hasan Sajeeb, Rohit Reddy Karnaty, Loai G. Salem. 2026-10-07. A Single-Inductor N:1 Resonant Switched-Capacitor Ladder Converter with Efficient Continuous Voltage Conversion Capability. https://arxiv.org/abs/2610.09273

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Graphon Particle Systems, Part I: Spatio-Temporal Approximation and Law of Large Numbers

We study a class of graphon particle systems with time-varying random coefficients. In a graphon particle system, the interactions among particles are characterized by the coupled mean field terms through an underlying graphon and the randomness of the coefficients comes from exogenous stochastic processes. By constructing two-level approximated sequences converging in 2-Wasserstein distance, we prove the existence and uniqueness of the solution to the system. Besides, by constructing two-level approximated functions converging to the graphon mean field terms, we establish the law of large numbers, which reveals that if the number of particles tends to infinity and the discretization step tends to zero, then the discrete-time interacting particle system over a large-scale network converges to the graphon particle system. As a byproduct, we discover that the graphon particle system can describe the limiting dynamics of the distributed stochastic gradient descent algorithm over the large-scale network and prove that if the gradients of the local cost functions are Lipschitz continuous, then the graphon particle system can be regarded as the spatio-temporal approximation of the discrete-time distributed stochastic gradient descent algorithm as the number of network nodes tends to infinity and the algorithm step size tends to zero.

eess.SY↗
arXiv2026

The Role of Information Incompleteness in Defending Against Stealth Attacks

The effectiveness of Data Injection Attacks (DIAs) critically depends on the completeness of the system information accessible to adversaries. This relationship positions information incompleteness enhancement as a vital defense strategy for degrading DIA performance. In this paper, we focus on information-theoretic stealth attacks, where the attacker encounters a fundamental tradeoff between the attack stealthiness and destructiveness. Specifically, we systematically characterize how incomplete admittance information impacts these dual objectives. In particular, we establish sufficient conditions for two distinct operational regimes: (i) stealthiness intensifies while destructive potential diminishes and (ii) destructiveness increases while stealth capability weakens. For scenarios beyond these regimes, we propose a maximal incompleteness strategy to optimally degrade stealth capability. To solve the associated optimization problem, the feasible region is reduced without excluding the optimal solution, and a heuristic algorithm is then introduced to effectively identify the near-optimal solutions within the reduced region. Furthermore, we extend our theoretical analysis to broader scenarios in which the initial sufficient conditions are not met, introducing exact diagnostic indices to evaluate instance-wise performance shifts. Numerical simulations are conducted on IEEE test systems to validate the findings.

eess.SY↗
arXiv2026

Exact Decomposition of Value Functions for Two-Player Games in Hamilton-Jacobi Reachability

Hamilton-Jacobi reachability (HJR) is an important framework in safe control theory. HJR provides theoretical tools and numerical methods to obtain value-functions for tasks involving target-reaching and obstacle-avoidance. A recent work proposed an algebraic framework to scale to complex, composite tasks via decomposing the value functions of the composite tasks into value functions for the fundamental tasks traditionally studied in HJR, all in the one-player setting. Many of these decomposition results, however, do not directly translate to the two-player setting. In this technical note, we nevertheless show that one of the previous work's key results for analyzing various tasks involving reaching multiple targets while obeying constraints still holds in the two-player setting, so long as a critical monotonicity assumption is satisfied. In particular, we detail the analogous result and its proof (which structurally differs from the one-player case), we show via a counter-example what can go wrong if this monotonicity assumption is not satisfied, and we show how the analysis of a variety of tasks can be performed using this result. Such tasks include sequential and any-order multi-target-reaching tasks under constraints. We note that, whereas the prior work considered discrete-time, infinite-horizon tasks, which are more standard in reinforcement learning, we here consider continuous-time, finite-horizon tasks, which are more standard in HJR.

eess.SY↗