How to check back to back transaction coverage for any interface?

Hi,

I have done back to back transaction coverage by calculating clock time between two transactions.
Any other method?

Regards,
M

In reply to mann_verif:

Why is the clock time/number of clock cycles of interest for functional coverage?
What do you mean with ‘transaction coverage’?

In reply to chr_sue:

Hi chr_sue,

A transaction is qualified to be valid at the interface by valid bit, I’m checking if each valid arrives at each clock cycle- 2ns then assert b2b_received and pass it to coverage sampling. Query I have is is there any other method this can be done?
-M

In reply to mann_verif:

I guess the valid bit belongs to the transaction. Could you please explain why?
A transaction should be valid. What is the value of counting the valid transactions?

In reply to chr_sue:

In reply to mann_verif:
I guess the valid bit belongs to the transaction. Could you please explain why?
A transaction should be valid. What is the value of counting the valid transactions?

Need this for coverage, every transaction is qualified by valid bit, that is the structure of transaction.

In reply to mann_verif:

Sorry, but I do not understand what you are saying.
Could you please show your tansaction?

In reply to chr_sue:

I need to check back to back transaction coverage for following interface:
input logic crqm_notif_valid;
input logic crqm_bus_t crqm_notif_bus;

I keep on pushing currenttime to queue, check the difference of next queue item(qualified by crqm_notif_valid) , if difference = clk_time , b2b_received =1 which is passed to sampling.

This method works, but I have such many interfaces so was wondering if I can have a better generic method.

In reply to mann_verif:

If you do not explain what you want to do nobody can help you. ‘back to back transaction coverage’ is not precise enough.