Sökning: id:"swepub:oai:DiVA.org:hh-20517" >
Checking and derivi...
Checking and deriving module paths in Verilog cell library descriptions
-
- Raffelsieper, M. (författare)
- CS Dept., TU/Eindhoven, Eindhoven, Netherlands
-
- Mousavi, Mohammad Reza (författare)
- CS Dept., TU/Eindhoven, Eindhoven, Netherlands
-
- Strolenberg, C. (författare)
- Fenix, Eindhoven, Netherlands
-
CS Dept, TU/Eindhoven, Eindhoven, Netherlands Fenix, Eindhoven, Netherlands (creator_code:org_t)
- Los Alamitos, Calif. IEEE Computer Society, 2010
- 2010
- Engelska.
-
Ingår i: Design, Automation and Test in Europe Conference & Exhibition 2010 (DATE’10, Dresden, Germany, March 8-12, 2010). - Los Alamitos, Calif. : IEEE Computer Society. - 9783981080162 ; , s. 1506-1511
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- Module paths are often used to specify the delays of cells in a Verilog cell library description, which define the propagation delay for an event from an input to an output. Specifying such paths manually is an error prone task; a forgotten path is interpreted as a zero delay, which can cause further flaws in the subsequent design steps. Moreover, one can specify superfluous module paths, i.e., module paths that can never occur in any practical run of the model and hence, make excessive restrictions on the subsequent design decision. This paper presents a method to check whether the given module paths are reflected in the functional implementation. Complementing this check, we also present a method to derive module paths from a functional description of a cell. © 2010 EDAA.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences (hsv//eng)
Nyckelord
- Cell library
- Design decisions
- Design steps
- Error prone tasks
- Propagation delays
- Verilog
- Zero delay
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)
Hitta via bibliotek
Till lärosätets databas