0% found this document useful (0 votes)
270 views2 pages

BEC613A Activity 1 Questions A

This document outlines an academic activity for a Multimedia Communication course, presenting eight questions that cover various topics such as interactive television applications, propagation delay calculations, circuit and packet modes in multimedia networks, bit rate derivations for speech and music signals, and Huffman coding for character transmission. Students are required to answer any five questions, which involve theoretical explanations, calculations, and derivations related to multimedia communication systems. The questions also address encoding algorithms and their efficiency in data transmission.

Uploaded by

gpurvi911
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
0% found this document useful (0 votes)
270 views2 pages

BEC613A Activity 1 Questions A

This document outlines an academic activity for a Multimedia Communication course, presenting eight questions that cover various topics such as interactive television applications, propagation delay calculations, circuit and packet modes in multimedia networks, bit rate derivations for speech and music signals, and Huffman coding for character transmission. Students are required to answer any five questions, which involve theoretical explanations, calculations, and derivations related to multimedia communication systems. The questions also address encoding algorithms and their efficiency in data transmission.

Uploaded by

gpurvi911
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/ 2

DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING

ACADEMIC YEAR:2024-25
BEC613A-MULTIMEDIA COMMUNICATION-ACTIVITY 1-QUESTIONS
(Answer ANY 5)

1. Explain with neat diagram, the Interactive television Application for both cable
and satellite network.

2. Develop the propagation delay associated with the following communication


channels given velocity of propagation for case (i) and (ii) as 2*10 8 m/s and (iii)
3*108 m/s.
i. A connection through a private telephone network of 1 km.
ii. A connection through a PSTN of 200km. A connection over a satellite
channel of 50000km.

3. Explain Circuit and packet mode of operation in Multimedia networks.

4. Assuming the B/W of a speech is from 50 Hz through to 10kHz and that of a music
signal is from 15Hz through to 20kHz, derive the bit rate that is generated by the
digitization procedure in each case assuming that Nyquist sampling rate is used
with 12 bits/sample for the speech signal and 16 bits/sample for the music signal.
Derive the memory required to store a 10 minute passage of stereophonic music

5. Derive the bit rate and the memory requirements to store each frame that
result from the digitization of both a 525 and 625 -line system assuring a 4:2:2
format. Also find the total memory required to store a 1.5 hour movie/video.

6. Derive the time to transmit the following digital images at both 64Kbps and
1.5Mbps.
A 640X480X8 VGA- compatible image.
A 1024X768X24 SVGA-compatible image

7. A series of messages is to be transferred between two computers over a PSTN. The


messages comprise just the characters A through H, analysis has shown that the
relative frequency of occurrence of each character is as follows: A and B = 0.25, C and
D =0.14, E,F,G and H=0.055.
i. Develop codeword set using Huffman coding Tree.
ii. Derive the minimum average number of bits per character.
iii. Derive ethe average number of bits per character for your codeset and
compare with Entropy and Fixed Length Binary Codeword and 7 bit ASCII
codewords.

8 A statistical encoding algorithm is being considered for the transmission of a large


number of long text files over a public network. Analysis of the file contents has
shown that each file comprises only 6 different characters M, F,Y,N,0 and 1 each
of which occurs with a relative frequency of occurrence of
0.25,0.25,0.125,0.125,0.125 and 0.125 respectively. If the encoding algorithm
under consideration uses the following set of codewords:
M=10,F=11,Y=010,N=011,0=000,1=001. Compute:

i. the average number of bits per codeword with the algorithm.


ii. entropy of the source
iii. the minimum number of bits required assuming fixed-length codewords

You might also like