## Parity Control cs348 unit2new

• 0:01 - 0:05
Now we have modeled a pretty sophisticated packet model. We can randomize all
• 0:05 - 0:10
the fields, and now we even calculate our parity. Therefore, all the packets we
• 0:10 - 0:13
• 0:13 - 0:14
[SOUND].
• 0:14 - 0:23
That's very good, but we're not stressing our world efficiently. Sometimes, we
• 0:23 - 0:26
want to be able to receive some corrupted packets.
• 0:26 - 0:27
[SOUND].
• 0:27 - 0:32
Here's one. So now we're going to add controlability to generate traffic that
• 0:32 - 0:37
has some corrupted and some non-corrupted packets. In this exercise, we want to
• 0:37 - 0:41
• 0:41 - 0:46
generate good packets, and sometimes bad packets. So first step here is to
• 0:46 - 0:52
generate a new enumerated type called packet kind type, with these two values.
• 0:52 - 0:57
And then we declare a new field called packet kind of this type. And finally,
• 0:57 - 1:01
we adding a constraint that says whenever the packet kind is good, then we
• 1:01 - 1:06
want to calculate parity. And if it's not good, we don't want to calculate
• 1:06 - 1:11
parity. So you will use the implication constraint. Antecedent implies
• 1:11 - 1:16
consequence again. Where on the antecedence size, you will use packet kind. And
• 1:16 - 1:19
on the right hand side, you will basically determine whether the parity byte
• 1:19 - 1:25
should be calculated via the parity calculation method or not. You add your
• 1:25 - 1:29
enumerated type here, and then below after parity, you add your packet kind
• 1:29 - 1:35
field. And a constraint adjustment to make sure that the parity will only be
• 1:35 - 1:40
calculated when the packet kind is set to good.
タイトル：
Parity Control cs348 unit2new
Video Language:
English
Team:
Udacity
プロジェクト：
CS348 - Functional Hardware Verification
Duration:
01:41