Scribd
Upload
9 views4 pages

Full EN

Uploaded by

lhduong2506
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
9 views4 pages

Full EN

Uploaded by

lhduong2506
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

CHAPTER 7: INTRODUCTION TO INFORMATION THEORY

Prob 1. A source emits four equiprobable messages randomly with baud rate of 10 symbol/s.
Calculate the minimum bit rate to transmit the source.

Prob 2. A source emits four messages A, B, C, D with probabilities 1/2, 1/6, 1/6, and 1/6,
respectively. The baud rate is 10 symbol/s. Calculate the minimum bit rate to transmit the
source.

Prob 3. Obtain a Shannon-Fano code with the first extension of the source as shown below
Message A B C D E F
Probability 0.3 0.01 0.09 0.3 0.2 0.1

Determine the average length of the codeword and the efficiency of the code.

Prob 4. The capacity of channel is 2 Mbps. A binary source generates digits 1 and 0 randomly
with probabilities 0.8 and 0.2, respectively. The bit rate of the source is 2.1 Mbps.
a. Can we transmit the binary source through the channel.
b. Chose a method for encoding a binary source
c. Determine the efficiency of the code of part (b).

Prob 5. Obtain a Huffman code with the first extension of the source as shown below
Message A B C D E F
Probability 0.3 0.01 0.09 0.3 0.2 0.1

Determine the average length of the codeword, the efficiency of the code.

Prob 6. A message source generates one of four messages randomly every microsecond. The
probabilities of these messages are 0.4, 0.3, 0.2, and 0.1. Each emitted message is
independent of the other messages in the sequence.
a. What is the source entropy?
b. What is the rate of information generated by this source (in bits per second)?
Prob 7. A source emits seven messages with probabilities 1/2, 1/4, 1/8, 1/16, 1/32, 1/64, and 1/64,
respectively. Find the entropy of the source. Obtain the Huffman binary code and find the
average length of the codeword. Determine the efficiency of the code.

Prob 8. A source emits one of four messages randomly every microsecond. The probabilities of
these messages are 0.5, 0.3, 0. 1, and 0.1. Messages are generated independently.
a. What is the source entropy?
b. Obtain a compact binary code and determine the average length of the codeword, and
the efficiency of the code.
Prob 9. A source emits three equiprobable messages randomly and independently.
a. Find the source entropy.
b. Find a compact binary code, the average length of the codeword and the code
efficiency.
c. To improve the efficiency of a binary code, we now code the second extension of the
source. Find a compact binary code, the average length of the codeword and the code
efficiency.
CHAPTER 8: ERROR CORRECTING CODES

Prob 1. Consider a generator matrix G for a nonsystematic (6, 3) code:

 V1  1 1 01 0 0 
G   V2   01 1 01 0 
 V3  1 01 0 01 

a. Given the transmitting data is 101, determine the codeword U.


b. Given the received codeword is r=110100, check if the data is correct or not. Correct
it if it is wrong.
c. Given the received codeword is r=110110, check if the data is correct or not. Correct
it if it is wrong.

Prob 2. Given the transmitting data is M  MSB 10010011 with generator polynomial of G  1001
. Using the CRC for error detection
a. Determine the codeword.
b. Assume the error patent is M  MSB 00001010000 . Prove that the receiver can detect the
presence of an error.

Prob 3: Consider a convolutional encoder of structure (2, 1, 2) with (7, 5) generator polynomials.
Given the transmitting data of 10101110, determine the codeword U.

Prob 4. Consider a convolutional encoder of structure (2, 1, 2) with (7, 5) generator polynomials.
Given the transmitting data is 10101110, determine the codeword U using state diagram
and trellis

Prob 5: Consider a convolutional encoder of structure (2, 1, 2) with (7, 5) generator polynomials.
Use Viterbi’s algorithm to decode the following received sequences r=(00,11,11,11). Using
trellis to report the result.
M  MSB 101110001
Prob 6: Using the CRC for the transmitting data of with generator
polynomial of G  1001 .
a. Determine the codeword
b. If the received word is r  MSB 101110011000 . Check if the data is correct or not

Prob 7. Given the communication system as follows:


Source -> CRC encoder> QPSK modulator-> Channel-> demodulator-> CRC decoder->
Sink
The transmitting data is 10110. The bit rate is 100 Kbps. Using the CRC with
MSB
generator polynomial of G  1001 .

a. Determine the codeword after CRC encoder


b. Determine the bit rate after CRC encoder
c. Determine the transmission bandwidth if Nyquist criterion pulses with a roll-off factor
r  0.2 are used to transmit data.
d. The constellation receiver is assumed [0.2+0.2i; 0.3-0.4i;-1.2-i; -0.2+2i;].
Determine the sink.

Bài 8: Given the communication system as follows: Analog signal-> 8-bit ADC -
1kHz sampling rate-> linear block code -> QPSK modulator. The generator matrix is
given as:
 V1  1 1 01 0 0 
G   V2   01 1 01 0 
 V3  1 01 0 01 
Assume that the analog signal is 1 V with Vref-=0V and Vref+=5V.
a. Determine the transmitting data and the bit rate after the ADC. The rule of transmission:
The data is being sent with the most significant bit (MSB) first and appending zeros until
enough k bit.
b. Determine the codeword after the encoder.
c. Determine the transmitting constellation symbols.
d. Determine the transmission bandwidth if Nyquist criterion pulses with a roll-off factor
r  0.3 are used to transmit data.

You might also like