By Alan Wiemann
ISBN-10: 0387717323
ISBN-13: 9780387717326
ISBN-10: 0387717331
ISBN-13: 9780387717333
The built-in Circuit (IC) has long gone and not using a standardized verification method for many years. This ebook defines a uniform, standardizable technique for verifying the logical habit of an built-in circuit, even if an I/O controller, a microprocessor, or a whole electronic method. This e-book can assist Engineers and bosses liable for IC improvement to convey a unmarried, standards-based method to their R & D efforts, slicing expenditures and bettering results.
Read or Download Standardized Functional Verification PDF
Similar nonfiction_3 books
's Large-scale scientific computing, 7 conf., LSSC 2009, PDF
This booklet constitutes the completely refereed post-conference lawsuits of the seventh overseas convention on Large-Scale clinical Computations, LSSC 2009, held in Sozopol, Bulgaria, in June 2009. The ninety three revised complete papers awarded including five plenary and invited papers have been conscientiously reviewed and chosen from a number of submissions for inclusion within the publication.
- Money and Debt: A Solution to the Global Crisis
- Metagenomics: Methods and Protocols
- On the interaction of morphological and syntactic ergativity : Lessons from Kurdish
- Global Youth?: Hybrid Identites, Plural Worlds
- The Bukidnon of Mindanao (Fieldiana, Anthropology, v.46)
Additional info for Standardized Functional Verification
Sample text
There is always one arbiter. The remaining three types of bus agent can appear in varying numbers, so there are standard variables of external connectivity defined for each. Note that ranges of two of the variables (num_proc and num_mem_ctrl) are independent and that the range of the third (num_io_ctrl) is dependent on the values chosen (generated) for the first two variables. In this simple example (and in the ones that will follow) we have merely illustrated how the concept of a standard variable of external connectivity is used in verification code.
External connectivity This paragraph defines three standard variables of external connectivy and also defines their ranges. This can be expressed in e as follows: External connectivity as described on page N: <’ unit processor { // Code not shown for purposes of this example. } unit mem_ctrl { 18 Chapter 2 – Analytical Foundation // Code not shown. } unit io_ctrl { // Code not shown. } unit arbiter { // Code not shown. 8]; // and its range. 4]; // and its range. num_io_ctrl: int; // And a third with its range.
1) n =1 Then, the number of function points Pk in the subspace of connectivity of our design is at most the product of these two products: Pk ≤ Pki ⋅ Pke . 2) Any dependencies between ranges of variables will reduce the overall number of possible instance-context pairs, so Pk may usually be less than this upper bound. To illustrate how these dependencies reduce the number of function points, consider the first example in previous chapter that described the standard variables of external connectivity.
Standardized Functional Verification by Alan Wiemann
by John
4.4