15.08.2013 Views

DESIGN OF A CUSTOM ASIC INCORPORATING CAN™ AND 1 ...

DESIGN OF A CUSTOM ASIC INCORPORATING CAN™ AND 1 ...

DESIGN OF A CUSTOM ASIC INCORPORATING CAN™ AND 1 ...

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

348sm <br />

Cm 47 8 smbit<br />

11-bit header<br />

4 <br />

<br />

100<br />

<br />

548sm <br />

Cm 67 8 smbit<br />

29-bit header<br />

4 <br />

<br />

<br />

The term sm denotes the bounded size of message m in bytes. The term bit is the bit time of the<br />

bus (on a bus running at 1 Mbps this is 1µs). The 34 (11-bit) term in the numerator comes from<br />

the sum of the S<strong>OF</strong>, Arbitration, ACK, CRC, and Interframe Space bit fields whose values are 1,<br />

12, 2, 16, and 3 respectively. For a 29-bit header, this value is 54 (sum of 1, 32, 2, 16, and 3).<br />

The value of 47 (11-bit) in Equation 4.2 comes from the previous sum of 34 and the Control and<br />

E<strong>OF</strong> bit fields whose values are 6 and 7 respectively. For a 29-bit header, the value is 67 (the<br />

sum of 54 and the Control and E<strong>OF</strong> bit fields).<br />

Equation 4.3 represents the queuing delay and is given by:<br />

(4.2)<br />

wm J j <br />

bit<br />

wm Bm Cj<br />

(4.3)<br />

j hpm Tj<br />

<br />

The set hp(m) is the set of messages in the system of higher priority than m. Tj is the period of a<br />

given message j, and Jj is the queuing jitter of the message. Bm is the longest time that the given<br />

message m can be delayed by lower priority messages (this is equal to the time taken to transmit<br />

the largest lower priority message), and can be defined by:<br />

<br />

<br />

max B C<br />

(4.4)<br />

m k<br />

k lp m<br />

where lp(m) is the set of lower priority messages.<br />

In Equation 4.3, the term wm appears on both sides of the equation, thus the equation<br />

cannot be rewritten in terms of wm. A simple solution is possible by forming a recurrence<br />

relationship:

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!