Big memory Coverage

Hi:

I have a question on coverage of address space. I have 32 bit address port, but making a coverage model with 2^32 bins is huge and not efficient. What would be the appropriate method of implementing address space coverage.

One of the approach I think of is to partition bins in three range i.e. low,med,high. But this way, in the coverage report even if one bin in low range hits, it will show up as a hit bin.

Can you please help me with the alternate approach for above solution.

Thanks,
Karma

In reply to Karmapanchal:

The basic idea is that you need to split to multiple ranges of address. You can’t cover them all. However, I hightly recommend: you need to cover speical addresses as well that you think they possibly generate design bugs such as 0x00000000, 0x7fffffff, 0x80000000, 0x7fffffff => 0x80000000, 0xffffffff, 0xffffffff => 0x00000000; special byte alignment of address: 0xXXXXXXX0, 0xXXXXXXX1, 0xXXXXXXX2, etc…