Skip to main content

1991 | Buch

Integrating Functional and Temporal Domains in Logic Design

The False Path Problem and Its Implications

verfasst von: Patrick C. McGeer, Robert K. Brayton

Verlag: Springer US

Buchreihe : The International Series in Engineering and Computer Science

insite
SUCHEN

Über dieses Buch

This book is an extension of one author's doctoral thesis on the false path problem. The work was begun with the idea of systematizing the various solutions to the false path problem that had been proposed in the literature, with a view to determining the computational expense of each versus the gain in accuracy. However, it became clear that some of the proposed approaches in the literature were wrong in that they under­ estimated the critical delay of some circuits under reasonable conditions. Further, some other approaches were vague and so of questionable accu­ racy. The focus of the research therefore shifted to establishing a theory (the viability theory) and algorithms which could be guaranteed correct, and then using this theory to justify (or not) existing approaches. Our quest was successful enough to justify presenting the full details in a book. After it was discovered that some existing approaches were wrong, it became apparent that the root of the difficulties lay in the attempts to balance computational efficiency and accuracy by separating the tempo­ ral and logical (or functional) behaviour of combinational circuits. This separation is the fruit of several unstated assumptions; first, that one can ignore the logical relationships of wires in a network when considering timing behaviour, and, second, that one can ignore timing considerations when attempting to discover the values of wires in a circuit.

Inhaltsverzeichnis

Frontmatter
Chapter 1. Introduction
Abstract
The two classic parameters of integrated circuit design are speed and area. The cost of an integrated circuit is linearly related to the yield (that is, to the percentage of instances of the circuit which function correctly). In turn, yield is inversely related to the probability of a fatal defect in the material substrate, which is exponentially related to active area of the circuit. Hence, to a first approximation, the cost of an integrated circuit is a function of the area of the circuit.
Patrick C. McGeer, Robert K. Brayton
Chapter 2. The False Path Problem
Abstract
In this chapter the false path problem is formally treated as a theoretical problem in combinational logic circuits. We begin by reviewing briefly the genesis and practical import of the problem.
Patrick C. McGeer, Robert K. Brayton
Chapter 3. False Path Detection Algorithms
Abstract
Once a correct, robust sensitization criterion has been found, there remains the task of incorporating this criterion in an algorithm which finds the longest path satisfying this criterion; such a path is often called a longest true path. The development of such an algorithm is the subject of this chapter and the argument that is to be made is twofold. First, the methods that have appeared in the literature thus far which claim to solve this problem may be viewed as different parameterizations of a single algorithm, and, second, that this algorithm can be modified to compute the viability procedure corresponding to the viability criterion devised in the last chapter.
Patrick C. McGeer, Robert K. Brayton
Chapter 4. System Considerations and Approximations
Abstract
The theory and algorithms described to this point capture the nature of the problem. Nevertheless, the viability procedure is theoretically expensive; the inner loop of the procedure is a general satisfiability problem, and hence is strongly suspected to be of exponential complexity. Further, there is some bookkeeping associated with the computation of the viability function. In general, some applications may prefer a faster answer and a poorer approximation to the longest viable path, so long as the assurance is given that such an approximation will not underestimate the length of the longest viable path. In this section we explore such performance/quality tradeoffs, and end by giving a polynomial approximation to viability.
Patrick C. McGeer, Robert K. Brayton
Chapter 5. Hazard Prevention in Combinational Circuits
Abstract
Previous research into timing properties of circuits has led to considering the problem of hazards or glitches in combinational circuits. One can demonstrate that in the absence of hazards, a variety of strong properties hold which are not valid in the general case: in particular, in the next chapter we will show that timing analysis can obtain tight bounds on the critical path of a circuit, which was shown to be impossible for a hazardous circuit.
Patrick C. McGeer, Robert K. Brayton
Chapter 6. Timing Analysis in Hazard-Free Networks
Abstract
Chapters 2 and 3 centered around algorithms which found the longest path down which an event could propagate in a combinational network. Such a path is called the true critical path, and is of great interest in timing verification.
Patrick C. McGeer, Robert K. Brayton
Backmatter
Metadaten
Titel
Integrating Functional and Temporal Domains in Logic Design
verfasst von
Patrick C. McGeer
Robert K. Brayton
Copyright-Jahr
1991
Verlag
Springer US
Electronic ISBN
978-1-4615-3960-5
Print ISBN
978-1-4613-6768-0
DOI
https://doi.org/10.1007/978-1-4615-3960-5