1,721,075 research outputs found
Predicting the Complexity of Large Combinational Circuits ThroughSymbolic Spectral Analysis of their Functional Specifications
No full textThe use of symbolic data structures to store pseudo-Boolean (i.e. integer-valued) functions has proved to be extremely effective in handling both transform matrices and spectral representations of large Boolean functions. The authors propose a novel application of symbolic spectral analysis techniques to the prediction of the complexity of a combinational circuit. They present a symbolic formulation of the problem, and propose an implicit algorithm for its solution that performs well, in terms of both execution time and accuracy in the computation, on circuits that are sensibly larger than the ones usually handled by the tools currently available. Experimental results, collected on standard examples, are discussed to support this clai
Current-Controlled Battery Management Policies for Lifetime Extension of Portable Systems
No full text
Discharge Current Steering for Battery Lifetime Optimization
No full textPortable and wearable computers can be powered by different combinations of two or more battery packs to give the user the possibility of choosing an optimal compromise between lifetime and weight/size. Recent work on battery-driven power management has demonstrated that sequential discharge is suboptimal in multibattery systems and lifetime can be maximized by distributing (steering) the current load on the available batteries, thereby discharging them in a partially concurrent fashion. Based on these observations, we formulate multibattery lifetime maximization as a continuous, constrained optimization problem, which can be efficiently solved by nonlinear optimizers. We show that significant lifetime extensions can be obtained with respect to standard sequential discharge (up to 160 percent), as well to previously proposed battery scheduling algorithms (up to 12 percent)
VHDL Simulation: A Flexible Approach to Verification and Performance Analysis of Communication Protocols
No full textA communication protocol usually represents a system whose behavior can be specified through a finite state machine. Finite state machines are often used to model digital systems in the context of logic synthesis and formal hardware verification. Therefore, sophisticated and efficient tools (for example, hardware simulators) to analyze this type of systems do exist.In this paper, we propose an approach to the verification and performance evaluation of communication protocols and, in general, of entire computer networks based on VHDL modeling and simulation. The results we have obtained on a few case studies (some of which are reported in this paper) seem to indicate the feasibility of the method
- …
