Bug hunting SoC designs to achieve full functional coverage closure
Vijeta Marwah and Saurabh Mishra, Freescale India
Embedded.com (August 31, 2014)
The intent of verifying a System on chip (SoC) is to ensure that the design is an accurate representation of the specification. Achieving fully verified SoC is an arduous task, yet verifying the SoC by using both directed verification and constrained random verification (CRV) can result in a 100% verified design.
Constraints help to reach coverage goals by shaping the random stimulus to push the design under test into interesting corner cases and avoid hitting invalid/illegal scenarios.
Using CRV, corner cases in the design can be exercised and system behavior under stress can be observed. Stress can be induced in the system by generating random traffic in the SoC. ‘Random traffic’ implies initiation of transactions from random selection of master to randomly selected slaves with any transaction type, size of data, and latency of transactions.
This paper describes how to use constrained random verification to uncover bugs that are difficult to find using traditional directed verification.
Related Semiconductor IP
- AES GCM IP Core
- High Speed Ethernet Quad 10G to 100G PCS
- High Speed Ethernet Gen-2 Quad 100G PCS IP
- High Speed Ethernet 4/2/1-Lane 100G PCS
- High Speed Ethernet 2/4/8-Lane 200G/400G PCS
Related White Papers
- Achieving Functional Verification Closure
- Multi-language Functional Verification Coverage for Multi-site Projects
- Functional Finite State Machine Paths Coverage using SystemVerilog
- Automatic shape-based routing to achieve parasitic constraint closure in custom design
Latest White Papers
- New Realities Demand a New Approach to System Verification and Validation
- How silicon and circuit optimizations help FPGAs offer lower size, power and cost in video bridging applications
- Sustainable Hardware Specialization
- PCIe IP With Enhanced Security For The Automotive Market
- Top 5 Reasons why CPU is the Best Processor for AI Inference