Hard Math -- Easy UVM: Pragmatic solutions for verifying hardware algorithms using UVM

Mark Litterick, Aleksandar Ivankovic, Bojan Arsov, Aman Kumar
12/6/2024
cs.AIcs.ARcs.LO

No confident code implementation found for this paper.

Abstract

This paper presents pragmatic solutions for verifying complex mathematical algorithms implemented in hardware in an efficient and effective manner. Maximizing leverage of a known-answer-test strategy, based on predefined data scenarios combined with design-for-verification modes, we demonstrate how to find and isolate concept and design bugs early in the flow. The solutions presented are based on real project experience with single chip radar sensors for a variety of applications. The verification environments supporting the presented strategies are based on SystemVerilog and the Universal Verification Methodology.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{litterick2024hard,
  title  = {Hard Math -- Easy UVM: Pragmatic solutions for verifying hardware algorithms using UVM},
  author = {Mark Litterick and Aleksandar Ivankovic and Bojan Arsov and Aman Kumar},
  year   = {2024},
  eprint = {2412.04919},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2412.04919v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2412.04919.svg)](https://codeofpaper.com/paper/2412.04919)

Discussion