A Work Around for Communication Frame's Generation Solver Issue in Constrained Random Verification

摘要

In communication system especially in wireless communication system generating size constrained frames with different format header and different size of packet data carried usually are the most common task handled by the data path stimulus generator in a constrained random verification system. The main challenge for generator is to solve out the well distributed stimulus according to the complex constraint relationship. R99's CCTrCH frame's building set an example on such challenge. This paper presents a work around to handle such challenge. By using a method like truck loading, the direct stimulus solver problem is avoided. As complicated constraints can be changed to the condition to stop loading more, no solver failure is achieved. Leveraging the power of computer resource, this work around can also make a good distribution about the generated stimulus.