Scribd
Upload
369 views

Network Exercise

This document contains 5 questions regarding digital communication techniques: 1. It asks to show NRZ, Manchester, and NRZI encodings for a given bit pattern. 2. It asks to show 4B/5B encoding and NRZI encoding for two bit sequences. 3. It asks what sequence of bytes would be transmitted prior to CRC for a BISYNC framed data transmission containing DLE and ETX. 4. It asks about clock accuracy requirements for correct SONET reception and frame forwarding. 5. It discusses how two-dimensional parity allows detection of all 3-bit errors but asks for an example of an undetectable 4-bit error.

Uploaded by

Sundari Muthu
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
369 views

Network Exercise

This document contains 5 questions regarding digital communication techniques: 1. It asks to show NRZ, Manchester, and NRZI encodings for a given bit pattern. 2. It asks to show 4B/5B encoding and NRZI encoding for two bit sequences. 3. It asks what sequence of bytes would be transmitted prior to CRC for a BISYNC framed data transmission containing DLE and ETX. 4. It asks about clock accuracy requirements for correct SONET reception and frame forwarding. 5. It discusses how two-dimensional parity allows detection of all 3-bit errors but asks for an example of an undetectable 4-bit error.

Uploaded by

Sundari Muthu
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

1.

Show the NRZ, Manchester, and NRZI encodings for the bit pattern shown in
Figure 2.36. Assume that the NRZI signal starts out low.

2. Show the 4B/5B encoding, and the resulting NRZI signal, for the following bit
sequence:
a) 1110 0101 0000 0011

b) 1101 1110 1010 1101 1011 1110 1110 1111

Assuming a framing protocol that uses bit stuffing, show the bit sequence
transmitted over the link when the frame contains the following bit
sequence:
a) 110101111101011111101011111110
1101 0111 1100 1011 1110 1010 1111 1011 0
b) Mark the stuffed bits.

3. Suppose you want to send some data using the BISYNC framing protocol and
the last 2 bytes of your data are DLE and ETX. What sequence of bytes would
be transmitted immediately prior to the CRC?
..., DLE, DLE, DLE, ETX, ETX
4. Assume that a SONET receiver resynchronizes its clock whenever a 1 bit
appears; otherwise, the receiver samples the signal in the middle of what it
believes is the bits time slot.
a) What relative accuracy of the senders and receivers clocks is required in
order to receive correctly 48 zero bytes (one ATM cells worth) in a row?
After 488=384 bits we can be off by no more than 1/2 bit, which is
about 1 part in 800.
b) Consider a forwarding station A on a SONET STS-1 line, receiving frames
from the downstream end B and retransmitting them upstream. What
relative accuracy of As and Bs clocks is required to keep A from
accumulating more than one extra frame per minute?
One frame is 810 bytes; at STS-1 51.8Mbps speed we are sending
51.8106/(8810) = about 8000 frames/sec, or about 480,000
frames/minute. Thus, if station Bs clock ran faster than station As by
one part in 480,000, A would accumulate about one extra frame per
minute.

5. Show that two-dimensional parity allows detection of all 3-bit errors.


Suppose an undetectable three-bit error occurs. The three bad bits must
be spread among one, two, or three rows. If these bits occupy two or
three rows, then some row must have exactly one bad bit, which would
be detected by the parity bit for that row. But if the three bits are all in
one row, then that row must again have a parity error (as must each of
the three columns containing the bad bits).

Give an example of a 4-bit error that would not be detected by twodimensional parity, as illustrated in Figure 2.14. What is the general set of
circumstances under which 4-bit errors will be undetected?
If we flip the bits corresponding to the corners of a rectangle in the 2-D
layout of the data, then all parity bits will still be correct. Furthermore, if

four bits change and no error is detected, then the bad bits must form a
rectangle: in order for the error to go undetected, each row and column
must have no errors or exactly two errors.

You might also like