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.
To read the full article, click here
Related Semiconductor IP
- Process/Voltage/Temperature Sensor with Self-calibration (Supply voltage 1.2V) - TSMC 3nm N3P
- USB 20Gbps Device Controller
- SM4 Cipher Engine
- Ultra-High-Speed Time-Interleaved 7-bit 64GSPS ADC on 3nm
- Fault Tolerant DDR2/DDR3/DDR4 Memory controller
Related White Papers
- What tamper detection IP brings to SoC designs
- Achieving Functional Verification Closure
- Multi-language Functional Verification Coverage for Multi-site Projects
- Functional Finite State Machine Paths Coverage using SystemVerilog
Latest White Papers
- Fault Injection in On-Chip Interconnects: A Comparative Study of Wishbone, AXI-Lite, and AXI
- eFPGA – Hidden Engine of Tomorrow’s High-Frequency Trading Systems
- aTENNuate: Optimized Real-time Speech Enhancement with Deep SSMs on RawAudio
- Combating the Memory Walls: Optimization Pathways for Long-Context Agentic LLM Inference
- Hardware Acceleration of Kolmogorov-Arnold Network (KAN) in Large-Scale Systems