Q1. Second solution is faster, as the list of primes is readily available Q3. Using post_randomize() would be faster, as addr is not declared as a rand variable Q4. bit [31:0] addr; rand bit [4:0] pos1, pos2; constraint addr_c { pos1 != (pos2+1); pos2 != (pos1+1); } function void post_randomize(); addr = (1
Q1. Second solution is faster, as the list of primes is readily available
Q3. Using post_randomize() would be faster, as addr is not declared as a rand variable
Q4. bit [31:0] addr;
rand bit [4:0] pos1, pos2;
constraint addr_c {
pos1 != (pos2+1);
pos2 != (pos1+1);
}
function void post_randomize();
addr = (1
your examples are very useful
Pls explain ABT assertion and coverage
Sir Can you please provide some other constraint assertions and coverage based examples with real time examples in interview point of view
Can you please explain the constraint for axis and ahb protocol based?
RV-Skills tutorials?