With the continuous scaling of CMOS technologies, integrated circuits are becoming more sensitive to process variations and/or external factors such as temperature or background noise and, as a result, may operate unr...
详细信息
With the continuous scaling of CMOS technologies, integrated circuits are becoming more sensitive to process variations and/or external factors such as temperature or background noise and, as a result, may operate unreliably. Circuit reliability can, however, be improved by making some design changes, and this requires an efficient and accurate method for evaluation of the reliability during the design stage. Reliability of a circuit can be estimated using either simulation-based or analytical based methods. While simulation-based methods (such as Monte-Carlo Simulation) can produce near to perfect estimated values, it takes a long time to run and the run-time increases exponentially with circuit size. On the other hand, analytical methods are relatively fast, but their accuracy level could decrease significantly if signal correlations are not properly accounted for. In this thesis, a new method for calculating the signal reliability correlation coefficient is presented. The proposed method takes advantage of the local information available in the circuit. It is assumed that all signal probabilities of error-free circuits are already available. The proposed method to calculate the Correlation Coefficient was tested for its efficiency and accuracy by applying it on large circuits in comparison with the results produced by the Monte-Carlo Simulation. For circuits containing thousands of gates, their output reliability and probability can be calculated using the proposed method within minutes, as opposed to over 10 hours using Monte-Carlo Simulation. The average errors are as low as 1.67% when all gate reliability is set at 0.95. Throughout the thesis, various ISCAS85 benchmark circuits have been tested under different conditions such as different gate reliabilities, input signal probability and input signal reliabilities in comparison with Monte-Carlo Simulation in order to verify its validity.
By analyzing the structures of circuits,a novel approach for signal probability estimation of very large-scale integration(VLSI)based on the improved weighted averaging algorithm(IWAA)is *** the failure probability of...
详细信息
By analyzing the structures of circuits,a novel approach for signal probability estimation of very large-scale integration(VLSI)based on the improved weighted averaging algorithm(IWAA)is *** the failure probability of the gate,first,the first reconvergent fan-ins corresponding to the reconvergent fan-outs were identified to locate the important signal correlation nodes based on the principle of homologous signal ***,the reconvergent fan-in nodes of the multiple reconverging structure in the circuit were identified by the sensitization path to determine the interference sources to the signal probability ***,the weighted signal probability was calculated by combining the weighted average approach to correct the signal ***,the reconvergent fan-out was quantified by the mixed-calculation strategy of signal probability to reduce the impact of multiple reconvergent fan-outs on the *** results on ISCAS85 benchmarks circuits show that the proposed method has approximate linear time-space consumption with the increase in the number of the gate,and its accuracy is 4.2%higher than that of the IWAA.
EST (Equivalent STate hashing) algorithm, which reduces the search space form a different point of view from the conventional methods, was proposed for test generation by Giraldi and Bushnell. In this method the proce...
详细信息
EST (Equivalent STate hashing) algorithm, which reduces the search space form a different point of view from the conventional methods, was proposed for test generation by Giraldi and Bushnell. In this method the processes and results of the test pattern searches are stored and used to avoid fruitless searches to reduce the search space. In this paper the concept of search state equivalence, which is introduced for EST, is extended to that of search state dominance. Based on that concept an algorithm DST (Dominant STate hashing) is proposed. The search state dominance can prune the search space more effectively than the search state equivalence.
This paper addresses the problem of computing the area complexity of a multi-output combinationallogic circuit, given only its functional description, i.e., Boolean equations, where area complexity is measured in ter...
详细信息
This paper addresses the problem of computing the area complexity of a multi-output combinationallogic circuit, given only its functional description, i.e., Boolean equations, where area complexity is measured in terms of the number of gates required for an optimal multilevel implementation of the combinationallogic. The proposed area model is based on transforming the given, multi-output Boolean function description into an equivalent single-output function. The model, is empirical, and results demonstrating its feasibility and utility are presented. Also, a methodology for converting the gate count estimates, obtained from the area model, into capacitance estimates is presented. High-level power estimates based on the total capacitance estimates and average activity estimates are also presented.
In this paper, we propose a method to estimate fault efficiency for path delay faults based on untestable path analysis. In path delay fault testing, fault coverage of test patterns is usually, very low, because logic...
详细信息
In this paper, we propose a method to estimate fault efficiency for path delay faults based on untestable path analysis. In path delay fault testing, fault coverage of test patterns is usually, very low, because logiccircuits often have huge number of paths including many untestable paths. Hence we should compute fault efficiency rather than fault coverage, but it is too difficult to compute exact fault efficiency in a short time, because there is no method to compute total number of untestable paths quickly. The proposed method statistically estimate the number of untestable paths based on untestable path analysis, and compute fault efficiency. Experimental results show that the proposed method can accurately estimate fault efficiency of given test patterns in a reasonable time.
The implications of the observation that the probability of the occurrence of a transition on a wire of a circuit affects both the average power dissipation and the random pattern testability of a circuit are investig...
详细信息
The implications of the observation that the probability of the occurrence of a transition on a wire of a circuit affects both the average power dissipation and the random pattern testability of a circuit are investigated. It is shown that restructuring a logic circuit can significantly affect its average power dissipation. Various methods for the synthesis of combinationallogic networks are presented and the effect of different algorithms on the power dissipation of the circuit is demonstrated. The dual problem of improving the random pattern testability of logiccircuits is emphasized. It is shown that modifying the signal probabilities can significantly affect the random pattern testability of a circuit.< >
An approach to cultivating a test for combinational and sequential VLSI circuits described hierarchically at the transistor, gate, and higher levels is discussed. The approach is based on continuous mutation of a give...
详细信息
An approach to cultivating a test for combinational and sequential VLSI circuits described hierarchically at the transistor, gate, and higher levels is discussed. The approach is based on continuous mutation of a given input sequence and on analyzing the mutated vectors for selecting the test set. The approach uses a hierarchical simulation technique in the analysis to drastically reduce the memory requirement, thus allowing the test generation for large VLSI circuits. The algorithms are at the switch level so that general MOS digital designs can be handled, and both stuck-at and transistor faults are handled accurately. The approach was implemented in a hierarchical test generation system, CRIS, that runs under UNIX on SPARC workstations. CRIS was used successfully to generate tests with high fault coverage for large combinational and sequential circuits.< >
The work described in this paper began some time ago as an investigation into two problems associated with logic minimisation or optimisation. These are respectively, the state assignment problem in the design of fini...
详细信息
The work described in this paper began some time ago as an investigation into two problems associated with logic minimisation or optimisation. These are respectively, the state assignment problem in the design of finite state machines, and the optimisation of combinational logic circuits using Reed-Muller (RM) techniques. When faced with such designs, the use of FPGAs to implement circuits is clearly appropriate. However, because of the limited resources available on FPGA parts, in terms of the number of available CLBs, and the increased difficulty that place and route software will experience in the layout of increasingly complex designs, it is felt that some form of optimisation of the design before implementation is still a necessary stage in the design process. This paper describes the implementation of algorithms which attempt to provide this type of optimisation for the two previously mentioned problems. The resultant software uses genetic algorithms to select, breed and test the fitness of potential solutions, and thereby recommend a near-optimal solution. In practice, these recommended solutions represent a considerable saving (in terms of gate count) on many circuit implementations, as experimental results demonstrate.< >
In this paper we are presenting a test methodology for performing module-bused mixed level fault simulation and test generation on System-on-Chip (SOC) combinational Intellectual Property (IP) cores for which both a p...
详细信息
In this paper we are presenting a test methodology for performing module-bused mixed level fault simulation and test generation on System-on-Chip (SOC) combinational Intellectual Property (IP) cores for which both a pre-synthesis behavioral description and a post-synthesis netlist is available but in an analyzer output intermediate format not readable by core integraters. We use the Verilog Procedural Interface (VPI) to access and perform serial fault simulation on a pre-compiled core available as a mixed behavioral structural level design. We also use VPI to prepare a testbench environment for performing random pattern test generation. The simulation time results of applying this VPI-based test methodology on ISCAS85 Verilog benchmarks are also presented and compared to the flat (non-mixed level) version the proposed VPI-based environment.
Capacitive crosstalk can give rise to slowdown of signals that can propagate to a circuit output and create a functional error A test generation methodology, called XGEN, was developed to generate tests for such failu...
详细信息
Capacitive crosstalk can give rise to slowdown of signals that can propagate to a circuit output and create a functional error A test generation methodology, called XGEN, was developed to generate tests for such failures. Two drawbacks of XGEN are: (i) it is not complete because of restricted propagation conditions, and (ii) a constrained logic value system is used. In this paper, we relax the propagation conditions to increase the solution space. This increases the likelihood of finding a test. We also present a nine-valued algebra that distinguishes between hazardous values and non-hazardous values. Finally, we use the relation between arrival time and required time ranges to selectively turn off the timing computation procedure which is computationally expensive. Other drawbacks of previous versions of XGEN are: (i) a simplified pin-to-pin delay model was used, and (ii) crosstalk computation could not handle timing ranges. We have addressed both of those issues.
暂无评论