Suppose we wanted to add an OAI gate, OAI(A, B,C) = not [(A + B) ⋅C], to the target gate library for our synthesizer. If the synthesizer uses the Directed Acyclic Graph (DAG) covering method for mapping equations to gates, what would be the appropriate primitive DAG (i.e., an equivalent circuit which uses only inverters and 2-input NANDs) for this new gate?
Hello Everyone, This is My first blog ever. I have created this blog to discuss about various topics in the field of ASIC. You'll find lot of useful information about verification. Keep visiting this site for more updates.
Search This Blog
About Me
Categories
- Digital (18)
- Specman Tutorial (12)
- Verification (10)
- Verilog (8)
- Learn C (6)
- Timing (6)
- Synthesis (5)
- General (4)
- SOC (4)
- Specman (4)
- State Machine (4)
- DFT (3)
- RTL (3)
- FPGA (2)
- Gate level simulation (2)
- Low power (2)
- VHDL (2)
- VLSI (2)
- AMS (1)
- CMOS (1)
- Clock divider (1)
- FIFO (1)
- Reset (1)
Archives
-
▼
2008
(86)
-
▼
Apr
(15)
- Guidelines for improving the performance of synthesis
- SOC Verification 3
- Will we ever get a handle on SoC verification cost?
- SOC Verification 2
- SOC Verification 1
- Sequence Detector - Solution
- Sequence Detector
- Mod - 10 counter
- DAG
- Counter design using FSM
- FSM Problem
- Clock Tree Synthesis
- State Diagram
- Depth of the Asynchronous FIFO
- Functional Coverage vs Code Coverage
-
▼
Apr
(15)
BlogRoll
No comments:
Post a Comment