• No results found

Testing and Logic Optimization Techniques for Systems on Chip

N/A
N/A
Protected

Academic year: 2021

Share "Testing and Logic Optimization Techniques for Systems on Chip"

Copied!
2
0
0

Loading.... (view fulltext now)

Full text

(1)

Linköping Studies in Science and Technology Dissertations. No. 1490

Testing and Logic Optimization Techniques

for Systems on Chip

(2)

Linköping Studies in Science and Technology No. 1490, 2012 Department of Computer and Information Science

Linköping University

se-581 83 Linköping, Sweden

www.liu.se

Today it is possible to integrate more than one billion transistors onto a sin-gle chip. This has enabled implementation of complex functionality in hand held gadgets, but handling such complexity is far from trivial. The challenges of handling this complexity are mostly related to the design and testing of the digital components of these chips.

A number of well-researched disciplines must be employed in the efficient design of large and complex chips. These include utilization of several ab-straction levels, design of appropriate architectures, several different classes of optimization methods, and development of testing techniques. This thesis contributes mainly to the areas of design optimization and testing methods.

In the area of testing this thesis contributes methods for testing of on-chip links connecting different clock domains. This includes testing for de-fects that introduce unacceptable delay, lead to excessive crosstalk and cause glitches, which can produce errors. We show how pure digital components can be used to detect such defects and how the tests can be scheduled effi-ciently.

To manage increasing test complexity, another contribution proposes to raise the abstraction level of fault models from logic level to system level. A set of system level fault models for a NoC-switch is proposed and evaluated to demonstrate their potential.

In the area of design optimization, this thesis focuses primarily on logic optimization. Two contributions for Boolean decomposition are presented. The first one is a fast heuristic algorithm that finds non-disjoint decompo-sitions for Boolean functions. This algorithm operates on a Binary Decision Diagram. The other contribution is a fast algorithm for detecting whether a function is likely to benefit from optimization for architectures with a gate depth of three with an XOR-gate as the third gate.

References

Related documents

This algorithm is strong because there exists for most Boolean functions a variable order in which the ROBDD gets a minimal number of nodes and in which all subsets of

oxygen was done, as the surface kept its structure after PT. The results are seen at the end of Table. Even after 30 minutes of PT no damage to the surface was de- tected using

Possible sources of errors for the testing of the door handles that could explain the delayed response of the strain for the higher number of cycles, which can be

Three crucial thermal issues related to temperature variations, temperature gradients, and temperature cycling are addressed in this thesis.. Existing test scheduling techniques

variation in detector dose that exist in the clinical image that is to be dose reduced. As described above, this is accomplished using the relationship between the standard deviation

In order to thoroughly evaluate the performance of chest tomosynthesis in nodule detection, images containing nodules of different sizes and densities, located in different

It is well known that such resource sharing leads to complex temporal behaviors that degrades the quality of control, and more importantly, may even jeopardize stability in the

• Small area and power overhead. Since there is usually need of several RF detectors to be used on the same chip. Therefore, the area of one detector will be