Since this is a "homework" question, I'll only give a partial answer. You seem to be stuck on how to handle the fact that the two FFs have different clocks.
The two FFs are driven by clocks that have two different delays from a common clock. Start by drawing a timing diagram:
reference time
|________________ ________________
Clock ____/ \________________/ \_________
|
-->| |<-- Delay1(min)
-->| | |<--Delay1(max)
| |__|________________ ___________________
Clk(FF1) ____|_/__/ \__\_____________/__/ \__\____
|
-->| |<-- Delay2(min)
-->| | |<--Delay2(max)
|___|_________________ _____________________
Clk(FF2) _______/___/ \___\___________/___/ \___\_
As you can see, there is a considerable amount of potential clock skew between the two clocks.
You have to consider two extreme cases:
- Delay1 has its minimum value and Delay2 has its maximum value
- Delay1 has its maximum value and Delay2 has its minimum value
It can be easier if you use one of the FF clocks as the reference, which allows you to show the total skew between the two FFs directly. Here's what you get when you use Clk(FF1) as the reference:
reference time
|________________ ________________
Clk(FF1) _______/ \________________/ \______
|
-->| |<-- Delay1(min)
-->| | |<--Delay1(max)
|__|_|______________ ___________________
Clock __/__/ | \__\_____________/__/ \__\________
| | |
-->| |<-- Delay2(min)
-->| | |<--Delay2(max)
|_|____|________________ _______________________
Clk(FF2) _____/_|____/ \______\__________/______/ \_____\
| |
|<------ total path delay ------>|
from FF1 to FF2
Note that we show the minimum value of Delay2 relative to the earliest possible Clock edge, while we show the maximum value relative to the latest possible edge. This demonstrates that the total skew between the two FF clocks is equal to the sum of the skews (differences between min and max delays) for Delay1 and Delay2.
When considering the combinatorial path from FF1 to FF2, you need to account for the fact that the FF2 clock can occur Delay2(min)-Delay1(max) relative to the FF1 clock at the earliest, and your setup time for FF2 must be relative to that point in time. There is a corresponding relationship when considering the path from FF2 to FF1.
I hope this is enough to get you going.
Since you still seem to be stuck, here's more:
The general rule is that when considering the FF1→CL1→FF2 path, the clock at FF2 cannot come any earlier than the sum of the maximum delays starting with the clock at FF1, including the clock-to-out delay of FF1 and the setup time of FF2. The stuff I talked about above shows how to that total path delay relates to the clock period with the two delays.
When the clocks are identical, you can say:
Tper(min) ≥ TpdFF1(max) + TpdCL1(max) + TsuFF2(max)
When they are not, you need to use the more general formula:
Tclk(FF2) - Tclk(FF1) ≥ TpdFF1(max) + TpdCL1(max) + TsuFF2(max)
Knowing that the earliest Tclk(FF2) is:
Tclk(FF2) - Tclk(FF1) = Tper12(min) - Delay1(max) + Delay2(min)
You can combine these together to get:
Tper12(min) ≥ TpdFF1(max) + TpdCL1(max) + TsuFF2(max) + Delay1(max) - Delay2(min)
Similarly, when you consider the FF2→CL2→FF1 path, you get a similar formula:
Tper21(min) ≥ TpdFF2(max) + TpdCL2(max) + TsuFF1(max) + Delay2(max) - Delay1(min)
The final answer will be the larger of these two values.
