NOTE: This item is not available outside the Texas A&M University network. Texas A&M affiliated users who are off campus can access the item through NetID and password authentication or by using TAMU VPN. Non-affiliated individuals should request a copy through their local library's interlibrary loan service.
Timing analysis of logic=level digital circuits using uncertainty intervals
dc.creator | Bell, Joshua Asher | |
dc.date.accessioned | 2012-06-07T22:43:46Z | |
dc.date.available | 2012-06-07T22:43:46Z | |
dc.date.created | 1996 | |
dc.date.issued | 1996 | |
dc.identifier.uri | https://hdl.handle.net/1969.1/ETD-TAMU-1996-THESIS-B45 | |
dc.description | Due to the character of the original source materials and the nature of batch digitization, quality control issues may be present in this document. Please report any quality issues you encounter to digital@library.tamu.edu, referencing the URI of the item. | en |
dc.description | Includes bibliographical references. | en |
dc.description | Issued also on microfiche from Lange Micrographics. | en |
dc.description.abstract | Timing Analysis of Logic-Level Digital Circuits Using Competitive design of modem digital circuits requires high performance at reduced cost and time-to-market. Timing analysis is increasingly used to deal with the more aggressive timing constraints inherent in high performance designs and the increased complexity of current VLSI technology. Reliance on synthesis and modular design to reduce cost and time-to-market has resulted in increased occurrence of non-functional paths which must be dealt with during timing analysis. In this work, an incremental timing analysis procedure is developed. Several techniques are introduced to improve the implicit trimming of false paths during path generation. The use of Recursive Learning to find indirect conflicts during the path building is studied. Dynamic dominators are introduced and used to prevent the checking of multiple paths with equivalent constraints. The technique of forward trimming is developed to discover blocked paths early and guide the search toward the true longest path. These techniques are shown to improve the search process during the path building phase of the incremental path generation routine. In addition, an improved dynamic sensitization criteria is presented which incorporates the actual delay of circuit elements. The delay of the circuit elements is dependent on the manufacturing process parameters. A min/max delay model is used to incorporate these variations of delay into the sensitization criteria. An uncertainty interval is used to represent transitions in the circuit since the exact time of the transition is unknown. The performance of the implicit path elimination techniques and the improved dynamic sensitization criteria is demonstrated through experimental results on some combinational benchmark circuits. | en |
dc.format.medium | electronic | en |
dc.format.mimetype | application/pdf | |
dc.language.iso | en_US | |
dc.publisher | Texas A&M University | |
dc.rights | This thesis was part of a retrospective digitization project authorized by the Texas A&M University Libraries in 2008. Copyright remains vested with the author(s). It is the user's responsibility to secure permission from the copyright holder(s) for re-use of the work beyond the provision of Fair Use. | en |
dc.subject | computer science. | en |
dc.subject | Major computer science. | en |
dc.title | Timing analysis of logic=level digital circuits using uncertainty intervals | en |
dc.type | Thesis | en |
thesis.degree.discipline | computer science | en |
thesis.degree.name | M.S. | en |
thesis.degree.level | Masters | en |
dc.type.genre | thesis | en |
dc.type.material | text | en |
dc.format.digitalOrigin | reformatted digital | en |
Files in this item
This item appears in the following Collection(s)
-
Digitized Theses and Dissertations (1922–2004)
Texas A&M University Theses and Dissertations (1922–2004)
Request Open Access
This item and its contents are restricted. If this is your thesis or dissertation, you can make it open-access. This will allow all visitors to view the contents of the thesis.