The Increasingly Hazardous World of FPGA Verification
October 26, 2010
Last week saw the publication of two interesting blog posts regarding the growing challenges of FPGA verification, first from my buddy Dave Orecchio over at GateRocket and then from my Cadence colleague Steve Leibson. Both posts made the point that FPGA developers are increasingly facing the same verification issues as developers of non-programmable devices. This trend has been evident for quite a few years, but the number of FPGA users affected has grown from a tiny fraction to an entire upper tier of developers whose design size and complexity rival or even surpass many ASIC and SoC projects.
To read the full article, click here
Related Semiconductor IP
- NFC wireless interface supporting ISO14443 A and B with EEPROM on SMIC 180nm
- DDR5 MRDIMM PHY and Controller
- RVA23, Multi-cluster, Hypervisor and Android
- ECC7 Elliptic Curve Processor for Prime NIST Curves
- HBM4E PHY and controller
Related Blogs
- The interface makes the FPGA
- Altera's intros 28nm Stratix V FPGA family
- Xilinx unleashes triad of low-power, 28nm FPGA families with very promising characteristics for memory interfacing
- Will verification challenges overwhelm FPGA design?
Latest Blogs
- The Evolution of AI and ML- Enhanced Advanced Driver Systems
- lowRISC Tackles Post-Quantum Cryptography Challenges through Research Collaborations
- How to Solve the Size, Weight, Power and Cooling Challenge in Radar & Radio Frequency Modulation Classification
- Programmable Hardware Delivers 10,000X Improvement in Verification Speed over Software for Forward Error Correction
- The Integrated Design Challenge: Developing Chip, Software, and System in Unison