Communication ENgg
Communication ENgg
Communication ENgg
Output signal
Channel
Parameter DPCM DM
Number of Bits Bit can be more than one but It can use 4,8 or 16 bits per
less than PCM sample.
Levels,Step size Fixed numbers of levels are Step size is fixed and cannot
used . be varied.
Bandwidth of transmission Bandwidth required is less Lower Bandwidth is
channel than PCM. required.
21.What are the limitations of delta modulation?
The major limitations of delta modulation are Slope overload error, Granular noise
22.Why bit reduction is needed while coding of the speech signal?
Bit reduction is needed while coding because the channel bandwidth required for a standard PCM is
64kbps.But in certain applications the channel bandwidth is at premium, then the speech signal must
be coded at low bit rates without affecting the quality of reproduction.
26.Compare MPSK and MFSK modulation techniques with respect to their probability of
error and bandwidth. (May2014, May2016)
Sl.No. Parameter MPSK MFSK
1. Bit error rate(BET) BER increses as M BER decreses as
increases. M increases.
2. Voice signal reproduction Lossless reproduction at Not suited for
lower modulation order. lower modulation
order.
27.Why is VSB preferred for TV video transmission.(Nov 2014)
Vestigial Side Band modulation is used for the following reasons:
(i)Video signals exhibits large bandwidth and significant low frequency content which
suggests the use of VSB to conserve bandwidth.
(ii) The circuitry of the demodulation in the receiver should be simple and cheap .VSB
uses simple envelop detection.
28.Draw the block diagram of an Adaptive modulator. (Nov 2014)
Code the block of k message bits. Code each message bit individually.
Needs buffer to store message Does not need the buffer since the bits are
block. arriving in serial fashion.
8.An event has six possible outcomes with probabilities {1/2, 1/4,1/8,1/16,1/32,1/32}. Find the
entropy of the system. (Nov 2010).
6
H Pk . log 2 Pk
k 1
= (-3.32[1/2.log10(1/2)+1/4.log10(1/4)+1/8.log10(1/8)+1/16.log10(1/16)
+1/32.log10(1/32)+1/32.log10(1/32)])
H=1.936 bits/symbol
9.Find the hamming distance between the following code words
C1={ 1 0 0 0 1 1 1} and C2= { 0 0 0 1 0 1 1}.(Nov 2010).
Hamming distance d(c1,c2) is the no of locations in which the elements of 2 code vectors differ.
Hamming weight w(c) no of non zero elements in the code vector.
Hamming distance=3
10.Define entropy.(May 2012)
It is a measure of the average information content per source symbol.
11.What is information rate?(Nov 2011)
It is defined as the number of symbols emitted by the source per second.
12.List out the advantages and disadvantages of error control coding.
Advantages: Reduces the required transmitted power, Reduces the size of antennas, Reduces the
hardware cost.
Disadvantages: Increases the transmission bandwidth, Increases the complexity of decoder.
Give the types of error control codes and block codes.
Error control codes are Block codes, Convolutional codes. The types of block codes are linear block
codes and cyclic codes.
13.What is parity check matrix?
Parity check matrix H(n-k)xn is formed using the expression
H=[I(n-k)|PT(n-k)x k] and is used in decoding operation to generate syndrome.
14.State closure property.
Closure property states that the sum of any 2 code words is another code word in the code.
15.What is Hamming code?
Hamming codes are the important class of block codes.Hamming codes have the minimum distance
d min = 3.Hamming codes satisfy the condition t ( ( d min-1)).Hamming codes are single error
correcting code.
16.Define syndrome.
Syndrome contains information about the error pattern e and may therefore be used for error
detection . S is a 1 x (n-k) vector and is used to decode the vector C from the received vector r
S = r H T where r = C + e .
17.Give the properties of syndrome.
The syndrome depends only on the error pattern and not on the transmitted code word, All error
patterns that differ by a code word have the same syndrome. S = e H T
18.What is parity check matrix?
Parity check matrix H(n-k)xn is formed using the expression
H=[I(n-k)|PT(n-k)x k] and is used in decoding operation to generate syndrome.
19.Define: Cyclic codes
Cyclic codes is a sub-class of linear block codes .It poses a well defined mathematical structure and
which provides efficient decoding.
20.State cyclic property and linearity property.
Cyclic property states that any cyclic shift of a codeword in the code is also a codeword. Linearity
property states that the sum of any 2 code words in the code is also a code.
21.List
21.List the other cyclic codes?
(i)Cyclic redundancy codes(crc) (ii)Bose- chaudhuri- hocquenghem(bch) codes (iii)Reed-solomon (rs)
codes.
22.What
22.What is the need for convolutional coding?
Convolutional coding may be the preferred method in applications where the message bits come in
serially rather in large blocks in which case the use of buffer may be undesirable.
23.Define
23.Define constraint length?
The constraint length of a convolutional codes expressed in message bits is defined as the no of shifts
over which a single message bit can influence the encoder output for a m stage shift register .the
constraint length k=m+1.
25.A.source transmits messages Q1 to Q5 having probabilities 1/2,1/4,1/8,1/16,1/16 respectively.
Calculate the average information of the source?(May2014)
Given the probabilities .Find the entropy using the below formula
6
H Pk. log 2 Pk
k 1
= -( [1/2log10(1/2)+1/4log10(1/4)+1/8log(1/8)+1/16log(1/16)+1/16log(1/16)])
= -(-1/2-1/2-3/8-4/16-4/16)
=1.875bits/symbol.
26.Why is huffmann coding called as minimum redundancy coding?(May 2014)
Huffman coding finds the optimal way to take advantage of varying character frequencies in a
particular file. On average, using Huffman coding on standard files can shrink them anywhere from
10% to 30% depending to the character distribution. Hence the number of bits to represent any
character is reduced thus the huffmann coding is called minimum redundancy coding.
Briefly explain the multiple access techniques used in satellite link.(May 2011)
Frequency Division Multiple Access (FDMA)
FDMA channel-access scheme is based on the frequency-division multiplexing(FDM) scheme, which
provides different frequency bands to different data-streams
Time division multiple access (TDMA)
TDMA channel access scheme is based on the time-division multiplexing (TDM) scheme, which
provides different time-slots to different data-streams (in the TDMA case to different transmitters) in a
cyclically repetitive frame structure
Code division multiple access (CDMA)/Spread spectrum multiple access (SSMA)
CDMA scheme is based on spread spectrum, meaning that a wider radio spectrum in Hertz is used
than the data rate of each of the transferred bit streams, and several message signals are transferred
simultaneously over the same carrier frequency, utilizing different spreading codes.
Space division multiple access (SDMA)
SDMA transmits different information in different physical areas.
9.Mention the applications of multiple access techniques in wired communication.(May 2011)
It shares many users at same time 2. share a finite amount of radio spectrum 3. high performance 4.
duplexing generally required 5. It works in frequency domain 6. It also works in time domain
10.Draw the block diagram of a typical FDMA system.(NOV 2011)