SOLVED EXERCISES CHAPTER IV

1) Determine the BCS for the following data and CRC generator polynomials
data ( =) +7 + 5 + 4 + 2+ 1 0 o 10110111
CRC ( ) = +5 +4 + 1 0 or 110011
Solution:
First, G(x) is multiplied by the number of bits in the CRC code, which is 5.
5( 7 5
+ + +4 +2 + 1
= 0)
+ +12 + 10
+ 9 7 5

= 1011011100000

Next, the result is divided by P(x).

The CRC is added to the data to produce the following transmitted data stream.

( ) = 183
= 01001

At the receiver, the transmitted data is divided again among P(x).

Residuo = 0
There was no error
2) Determine the VRC and LRC for the following message encoded in ASCII:
THE CAT. Use odd parity for VRC and even parity for LRC.
Solution:

Character T H E sp C A T LRC
Hex 54 48 45 20 43 41 54 2F
ASCII Code 0 0 0 1 0 1 1 0 1
LSB 1 0 0 0 0 1 0 0 1
2 1 0 1 0 0 0 1 1
3 0 1 0 0 0 0 0 1
4 1 0 0 0 0 0 1 0
5 0 0 0 1 0 0 0 1
MSB 6 1 1 1 0 1 1 1 0
VRC 7 0 1 0 0 0 1 0 0

3) For the 12-bit data string 101100010010, calculate the amount of bits of
Necessary Hamming, embed those bits arbitrarily in the string of
data, determine the condition of each Hamming bit, assume an error
arbitrary one-bit transmission, and demonstrate that the Hamming code
detect the error.
Solution
According to the equation2 ≥ + + 1the amount of Hamming bits is:
For n= 4,

24= 16≥ + + 1= 12+ 4+ 1= 17

Since 16 < 17, four Hamming bits are insufficient.
For n= 5,

25= 32≥ + + 1= 12+ 5+ 1= 18

32 > 18, y, consequently, five Hamming bits are sufficient to satisfy the
criterion of the equation2 ≥ + + 1Thus, the data stream will be formed by a
a total of 12+5=17 bits.

Five Hamming bits are placed arbitrarily in the data stream.

17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1
H 1 0 1 H 1 0 0 H H 0 1 0 H 0 1 0

To determine the logical condition of the Hamming bits, all are expressed
bit positions that contain a one as a five-bit binary number, and are combined
between each other with XOR.
 17= 1, 13= 0, 9= 1, 8= 1, 4= 0
The data stream encoded in 17 bits is transformed into:

H H H H H
1101 0100 1 1010 0010
It is supposed that during the transmission an error occurs in the bit at position 14. The
the received data stream is:
11000100110100010
In the receiver, to determine the position of the erroneous bit, the Hamming bits are extracted.
and XOR is compared with the binary code for each bit position that contains a 1.

The bit 14 was received incorrectly. To correct it, only that bit is complemented.

4) How many Hamming bits are needed for a single ASCII character?
Solution:
A total of 3 parity bits will be needed for Hamming coding. At the moment
to decode, the parity bits (P) along with the information bits (I) are arranged in
so that the parity bits must be positioned such that their position is a power of
from 2.
5) If odd parity is used for error detection in ASCII, the number of
zeros for each 8-bit symbol is ________
a) for
b) odd
c) indefinite
d) 42

6) What are the conditions for the polynomial to be used in a CRC generator?

The conditions of the polynomial to be used as a CRC generator are:

It should not be divisible by x.
It should be divisible by (x + 1).

7) A PCM-TDM system multiplexes 24 voice band channels. Each sample is

It is encoded in 7 bits and a synchronization bit is added to each frame. The frequency of
sampling is 9000 samples/second. The line format is BPRZ encoding.
AMI. Calculate the following:
a) Line speed in bits per second.
b) Minimum Nyquist bandwidth.
Solution:
24 channels 9000 treads 8
a) = 1728 kbps
b) =
2
=2

8) A PCM-TDM system multiplexes 32 voice band channels, each with a

bandwidth of 0 kHz, in 4 kHz. Each sample is encoded with a PCM key.
of 8 bits. UPNRZ encoding is used. Calculate:
a) Minimum sampling frequency.
b) Line speed in bits per second.
c) Minimum Nyquist bandwidth.
Solution:
a) =2
= 2 (4 ) = 8KHz

3 channels 4000 traces 8

b) = 1024
c) =4
4
= = =2
2 2
9) For the following bit sequence, draw the timing diagram for
UPRZ, UPNRZ, BPRZ, BPNRZ and BPRZ-AMI coding.

bit stream: 1 1 1 0 0 1 0 1 0 1 1 0 0
Solution:

10) Encode the following data stream in BPRZ-AMI, with B6ZS and B3ZS.

+-0000+-+0-00000+-00+

Solution:

In B6ZS:
+ −0 0 0 0 + − + 0− 0 00 0 0+ − 0 0+

In B3ZS:
+ −0 0 0 0 + − + 0− 0 0 00 0 + − 0 0+
Bibliography

W. Tomasi, Electronic Communications Systems, Mexico: PEARSON

EDUCATION, 2003.