a_1 : coverpoint a.b
a_2 : coverpoint a.a
.
.
.
c_1 : coverpoint c.b
a : cross a_1, a_2;
b: cross b_1, b_2;
c: cross c_1, c_2;
//How do i enable a bucket that is equal to the sum of a+b+c as a coverpoint?
total : cross (a+b+c);
endgroup
Without any explicit bins and a really big auto_bin_max, crossing two coverpoints is the same as a coverpoint of the concatenation of the two other coverpoint expressions
a : cross a_1, a_2;
// is the same as
a : coverpoint {a.b,a.a};
Summing a cross as in adding the occurrences of a,b and c.
if a,b and c have 36 combinations each. I want to be able to quantify a coverpoint that counts 108 combinations (a+b+c)
I believe if i cross a,b and c i will end up getting 36^3 combination buckets.
A_comb : cross A_type, A_feature; //All types * features of A
B_comb : cross B_type, B_feature; //All types * features of B
Ideally, I want to find all combinations of [A,B,C…Z][Number of types][Number of features]
But i’m unable to disassociate the data, i only have data in the form of A_type and A_feature.
Therefore i was looking for a way to group A_comb+B_comb