1,444 research outputs found
Mixed-Signal Testability Analysis for Data-Converter IPs
In this paper, a new procedure to derive testability measures is presented. Digital testability can be calculated by means of probability, while in analog it is possible to calculate testability using impedance values. Although attempts have been made to reach compatibility, matching was somewhat arbitrary and therefore not necessarily compatible. The concept of the new approach is that digital and analog can be integrated in a more consistent way. More realistic testability figures are obtained, which makes testability of true mixed-signal systems and circuits feasible. To verify the results, our method is compared with a sensitivity analysis, for a simple 3-bit ADC
Preventing and masking Trojan Circuits triggering out of working area
Inserting malicious sub-circuits that may cause
Optimal Piezoelectric Actuators and Sensors Configuration for Vibration Suppression of Aircraft Framework Using Particle Swarm Algorithm
Numbers and locations of sensors and actuators play an important role in cost and control performance for active vibration control system of piezoelectric smart structure. This may lead to a diverse control system if sensors and actuators were not configured properly. An optimal location method of piezoelectric actuators and sensors is proposed in this paper based on particle swarm algorithm (PSA). Due to the complexity of the frame structure, it can be taken as a combination of many piezoelectric intelligent beams and L-type structures. Firstly, an optimal criterion of sensors and actuators is proposed with an optimal objective function. Secondly, each order natural frequency and modal strain are calculated and substituted into the optimal objective function. Preliminary optimal allocation is done using the particle swarm algorithm, based on the similar optimization method and the combination of the vibration stress and strain distribution at the lower modal frequency. Finally, the optimal location is given. An experimental platform was established and the experimental results indirectly verified the feasibility and effectiveness of the proposed method
Recommended from our members
Scalable algorithms for software based self test using formal methods
textTransistor scaling has kept up with Moore's law with a doubling of the number of transistors on a chip. More logic on a chip means more opportunities for manufacturing defects to slip in. This, in turn, has made processor testing after manufacturing a significant challenge. At-speed functional testing, being completely non-intrusive, has been seen as the ideal way of testing chips. However for processor testing, generating instruction level tests for covering all faults is a challenge given the issue of scalability. Data-path faults are relatively easier to control and observe compared to control-path faults. In this research we present a novel method to generate instruction level tests for hard to detect control-path faults in a processor. We initially map the gate level stuck-at fault to the Register Transfer Level (RTL) and build an equivalent faulty RTL model. The fault activation and propagation constraints are captured using Control and Data Flow Graphs of the RTL as a Liner Temporal Logic (LTL) property. This LTL property is then negated and given to a Bounded Model Checker based on a Bit-Vector Satisfiability Module Theories (SMT) solver. From the counter-example to the property we can extract a sequence of instructions that activates the gate level fault and propagates the fault effect to one of the observable points in the design. Other than the user supplying instruction constraints, this approach is completely automatic and does not require any manual intervention. Not all the design behaviors are required to generate a test for a fault. We use this insight to scale our previous methodology further. Underapproximations are design abstractions that only capture a subset of the original design behaviors. The use of RTL for test generation affords us two types of under-approximations: bit-width reduction and operator approximation. These are abstractions that perform reductions based on semantics of the RTL design. We also explore structural reductions of the RTL, called path based search, where we search through error propagation paths incrementally. This approach increases the size of the test generation problem step by step. In this way the SMT solver searches through the state space piecewise rather than doing the entire search at once. Experimental results show that our methods are robust and scalable for generating functional tests for hard to detect faults.Electrical and Computer Engineerin
Observability of dynamical networks from graphic and symbolic approaches
A dynamical network, a graph whose nodes are dynamical systems, is usually
characterized by a large dimensional space which is not always accesible due to
the impossibility of measuring all the variables spanning the state space.
Therefore, it is of the utmost importance to determine a reduced set of
variables providing all the required information for non-ambiguously
distinguish its different states. Inherited from control theory, one possible
approach is based on the use of the observability matrix defined as the
Jacobian matrix of the change of coordinates between the original state space
and the space reconstructed from the measured variables. The observability of a
given system can be accurately assessed by symbolically computing the
complexity of the determinant of the observability matrix and quantified by
symbolic observability coefficients. In this work, we extend the symbolic
observability, previously developed for dynamical systems, to networks made of
coupled -dimensional node dynamics (). From the observability of the
node dynamics, the coupling function between the nodes, and the adjacency
matrix, it is indeed possible to construct the observability of a large network
with an arbitrary topology.Comment: 12 pages, 4 figures made from 12 eps file
Modelling & analysis of hybrid dynamic systems using a bond graph approach
Hybrid models are those containing continuous and discontinuous behaviour. In constructing dynamic systems models, it is frequently desirable to abstract rapidly changing, highly nonlinear behaviour to a discontinuity. Bond graphs lend themselves to systems modelling by being multi-disciplinary and reflecting the physics of the system. One advantage is that they can produce a mathematical model in a form that simulates quickly and efficiently. Hybrid bond graphs are a logical development which could further improve speed and efficiency. A range of hybrid bond graph forms have been proposed which are suitable for either simulation or further analysis, but not both. None have reached common usage.
A Hybrid bond graph method is proposed here which is suitable for simulation as well as providing engineering insight through analysis. This new method features a distinction between structural and parametric switching. The controlled junction is used for the former, and gives rise to dynamic causality. A controlled element is developed for the latter. Dynamic causality is unconstrained so as to aid insight, and a new notation is proposed.
The junction structure matrix for the hybrid bond graph features Boolean terms to reflect the controlled junctions in the graph structure. This hybrid JSM is used to generate a mixed-Boolean state equation. When storage elements are in dynamic causality, the resulting system equation is implicit.
The focus of this thesis is the exploitation of the model. The implicit form enables application of matrix-rank criteria from control theory, and control properties can be seen in the structure and causal assignment. An impulsive mode may occur when storage elements are in dynamic causality, but otherwise there are no energy losses associated with commutation because this method dictates the way discontinuities are abstracted.
The main contribution is therefore a Hybrid Bond Graph which reflects the physics of commutating systems and offers engineering insight through the choice of controlled elements and dynamic causality. It generates a unique, implicit, mixed-Boolean system equation, describing all modes of operation. This form is suitable for both simulation and analysis
- …