An efficient pseudo-random number generator algorithm for UVM random testing
Random verification in UVM verification methodology generally follows the random test generation mechanism in SystemVerilog,which can meet the basic requirements of random verification.However,with the increasing of verification scale,its execution efficiency will decrease and the randomness of the generated random number sequence will become worse.The random number sequence with good randomness is very important for the convergence of verification coverage,and it is necessary to improve the algorithm of pseudo-random number generator.In this paper,an improved pseudo-random number generator algorithm based on Mersenne twister algorithm is proposed.The Mersenne twister algorithm is applied to the generation of basic random sequences after abandoning the Mersenne rotation chain with high time and space complexity.After simulation test,combining with 16-interval Chi-square frequency analysis method and Monte Carlo method evaluation,the results show that,for UVM random verification,the algorithm can effectively improve the randomness of the pseudo-random number generator to generate random number sequence,and improve its execution efficiency to a certain extent.
UVMrandom testingpseudo-random number generatorrandomnessmersenne twister algo-rithm
NETL
NSTL
万方数据
