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
@gokulp68783 жыл бұрын
your examples are very useful
@gokulp68783 жыл бұрын
Can you please explain the constraint for axis and ahb protocol based?
@meenakshi5362 Жыл бұрын
RV-Skills tutorials?
@punithapg42613 жыл бұрын
Pls explain ABT assertion and coverage
@SanthoshKumar-tg1nm2 жыл бұрын
Sir Can you please provide some other constraint assertions and coverage based examples with real time examples in interview point of view