(AIC) Communication Notes

T.Y. Diploma : Sem.
V
[ET/EN/EJ/EX/ED/EI]
Digital Communication
Time: 3 Hrs.] Prelim Question Paper [Marks
rks : 100
Q.1(a) Attempt any THREE of the following : [12]

[1
mmunication.
Q.1(a) (i) Give the advantages and disadvantages of digital communication. ation. [4]
r
(A) Advantages of digital communication
i) Noise immunity is more than analog communication. n.
ii) Digital communication supports error detection and correction
rection techniques.
iii) It is easy to regenerate the digital signal than
an analog.
han
pulate.
iv) Digital signals are easy to store and manipulate.
v) Digital communication is computable e withh advance data p process
processing
cess image
technique like digital technique process age processing.
stem is low.
vi) Cost of digital communication system
Disadvantages
i) The data rate of digital communication
ommunication
ication is very high.
high
ii) Loss of information.
Q.1(a) (ii) List and explain variouss properties of Hamming

Ha Codes. [4]
(A) Properties of Hamming
mming Code
i) Hamming codesodes are linear.
equ to n = 2q 1
ii) Number of bits in codeword is equal
wheree q = number
er of extra bit
eg. if Q = 3 then n = ?
o 23 1
? n=7
iii) Number of message bit K sshould be always equal to 2q 1 q
iv) For the hamming code theth minimum distance dmin = 3.
v) Hamming codes can g generate systematic as well as non – systematic code
words
words.
vi) Hamming codes are used to detect burst error.
What is companding? Draw the companding curves for PCM [4]

Q.1(a) (iii) W
system
system.
(A) Companding
Compand
By keeping
kee step size constant we can perform non uniform quantization. This
can be achieved by amplifying low level signals and alternating high level
signal is called as compression at the receiver side, the signal is alternated
at low level and amplified at high level is called as expansion.
1114/TY/Pre_Pap/Elec/2014/CP/Class/DC 1
Vidyalankar : T.Y. Diploma DC
Alternated
The compression of signal at
transmitter and expansion at
receiver is combinely called as Expansion at
companding. receiver
Vinn
r
Compression
at transmitter
ka
Q.1(a) (iv) Draw the waveforms of ASK, FSK, PSK
SK for binary input [4]
101101110.
(A) Given bit stream = 101101110
1 0 1 1 0 1 1 1 0
an VC
al
VASK
dy
VAS
ASK 1 0 1 1 0 1 1 1 0
with
th
arr VC
carr
1
VFSK fH fL fH fL fH
Vi
with carr
ith car
VC & VC
1 2
VPS
PSK
with carr
VC
1
2 0714/TY/Pre_Pap/Elec/2014/CP/Class/DC
Q.1(b) Attempt any ONE of the following : [6]

Q.1(b) (i) Discuss ASCII codes with suitable examples. [6]
(A) ASCII Code : (American standard code for information interchange)
Number of bits used to represent every symbol is 7. Number of different
ff
bit patterns = 128.
30H 0 0110000
31H 1 0110001
32H 2 0110010
r
:
:
ka
39H 9 0111001
41H A 1000001
42H B 1000010
: :
: :
an5A Z 1011010
61H a 1100001
62H b 1100010
:
:
7AH z 1111010
al
Example BABA
ABA
1000010 1000001 1000010 1000001
Co 1000011
dy
1 0 0 0 0 1 1
Bipolar +A
NRZ A
Vi
Q.1(b) (ii) Draw

D the block
b diagram for the generation of PAM. State the [6]
f
function of each block.
(A)) Block diagram
diag for the generation of PAM
Pulse amplitude
a modulation is an analog to digital technique were the
amplitude variations at input analog signal are converted into corresponding
amp
output digital signal. Hence here we make use of sampling, the block diagram
is as shown below :
r
Q.2 Attempt any FOUR of the following : [16]
[16]
ka
Q.2(a) List various properties required for line codes. [4]
(A) Properties of line codes
i) DC content
ii) Signal power
i) For a good line code DC content should
hould be possible. Split phase
e as low as possib
an Manchester consist of very low omponent where as NRZ L and
w DC component
unipolar NRZ consists of large DC contents.
ntents.
If there is channel is less noisy then we use split p Manchester.
phase Ma
ii) For a good line code signal
gnal power should be as high as possible so that
noise required to corruptpt the large. NRZ
rrupt N L and un
unipolar NRZ has high
signal power than split phasee Manchester an and RZ.
al
Q.2(b) Discuss Multiplexing
exing and
nd its types
types. [4]
(A) Multiplexing and itss type
Multiplexing
ng is the technique whic
which allows the simultaneous transmission of
multiple signal data link.
Multiplexing
plexing
exing device is a pphysical line or a medium or a into logical segment
dy
called
led as channels.
Example cable
ble TV
TV.
D
M E
U M
X U
X
Vi
Common communication Link

Multiplexing
analog digital
TDM
FDM WDM
Synchronous TDM Asynchronous TDM
Q.2(c) What is need for delta modulation? Give its advantages & [4]
disadvantages and applications.
(A) Delta Modulation (DM)
Need :
x In PCM ‘N’ number of bits are transmitted per quantized sample mple which
whi
asks for large channel Bandwidth and signaling rate.
x This disadvantage can be overcome by using DM.
x DM transmits only one bit per sample instead of f ‘N’ therefore it
r
extensively reduces signaling rate and channel Bandwidth.
width.
Advantages
ka
i) One bit codeword for output.
ii) Simplicity of design for transmitter and receiver.
eceiver.
ver.
iii) Low signaling rate
iv) Low channel Bandwidth
Disadvantage
an i) Slope overload present
ii) Granular Noise
Application
i) Satellite transmission
n System
ystem
ii) Digital Communication
tion
Q.2(d) Write bandwidthh requirement

rement for DPSK,
DPSK QAM, QPSK, BPSK. [4]
al
(A) Bandwidth requirement
quirement
ent of
(i) DPSK
Symbol
bol duration = Ts = 2Tb
2T
1 2
=
dy
Fs fb
fb
fs =
2 fb/2 +fb/2
§ fb § fb · ·
? Bandwidth = ¨ ¨ ¸ ¸ = fb
© 2 © 2 ¹¹
Band
Bandwidth = fb
Vi
(ii) QAM
Bandwidth
B = fs (fs) = 2fs
2
=
Ts
2fs fs 0 +fs +2fs
2
=
N.Tb 2fs
2Fb
? Bandwidth =
N
(iii) QPSK
Bandwidth = fb/2 (fb/2)
bandwidth = fb
fb/2 fb/2
(iv) BPSK
Bandwidth = (f0 + fb) (f0 fb)
= f0 + fb f0 + fb
r
Babdwidth = 2fb
ka
an (f0 fb) f0
Q.2(e) Compare QPSK and QASK

(f0 + fb)
SK (4 points).
b) (f0 fb) f0 (f0 + fb)
[4]
(A) Comparison between QPSK andd QASK
QAS
Parameters
ters QPSK QASK
al
i) Type of Modulation n Quadrature Phase
Ph Quadrature Phase and
Modulation Amplitude Modulation
ii) Location
ation of signal
nal On the circumference
circumf
c of Equally spaced and
oints
points l
circle placed symmetrical
dy
about origin.
iii) Distance
istance between d = 2 Eb for N = 2 d = 2 0.4Eb for N = 4 or
the
he signal points
N = 16
iv) Noise immunit
immunity Better than QASK More than QPSK
v) Probability of error
erro Less than QASK More than QPSK
vi) Type oof Synchronous Synchronous
Vi
Demodulatio
Demodulation
vii) System co
complexity Less complex than More complex than
QASK QPSK

Q.3(a) Explain the unipolar, polar and bipolar line codes. [4]
(A) Unipolar Format
This is also known as on-off signaling. In this, symbol 1 is represented
nt by
switching off the pulse. When the pulse occupies the full duration symbol
n of symb
mb
the unipolar format is said to be of the non-return to zero (NRZ)
Z) type.
e.
When it occupies onehalf of the symbol duration, it is said to be of the
r
returntozero (RZ) type. When it occupies onehalf of the symbol
duration, it is said to be of the returntozero (RZ) type.
ka
Binary
0 0 1 1 0 0 1
+1
an 0
ers simplicity of implement

The unipolar format offers implementation.
t
Polar Format
al
In this, a positive
ve pulse
e is transmitted f
for sym
symbol 1 and negative pulse for
symbol 0. It can be e of the NRZ or RRZ type. A polar wave form has no dc
component,, provideded that the 0s and 1s in the input data occur in equal
ion.
proportion.
dy
0 0 1 1 0 0 1 0 1 1
+1
t
Vi
1
Bipolar Format
Fo
This is also known as pseudoternary signaling. In this positive and negative
pulses are used alternately for the transmission of 1s, and no pulses for
pulse
transmission of 0s. It can be of RZ or NRZ type.
* Important feature of bipolar format is that, in the absence of a dc

component, even though the input binary data may contain long strings of
0s and 1s.
* The pulse alternation property of bipolar format provides a capacity cit for
in service performance monitoring such that, any isolated error rror which
whi
causes the deletion or creation of a pulse, will violet this property.
operty.
* Bipolar format eliminates the ambiguity that may arise rise because
ause of
o
polarity inversion during the course of transmission.
r
For these reasons, the bipolar format is used in the he T1 carrier systems
for digital telephony.
ka
0 0 1 1 0 0 1 0 1 1
+1
0 t
an
1
Q.3(b) Discuss Shannon’s theoremem in brief. [4]

al
(A) Shannon’s Theorem
rem
x Also knownwn as source
ource coding theorem.
theore
x Statementent í Given a discrete memor
memoryless source of entropy H, the
average
rage code word length for any source
sou coding is bounded as L t H.
x Explanation
xplanation
planation : For any source
s encod
encoder, code efficiency is given as
dy
H
K = 100%%
L
M
H o entropy, H= ¦ pi log2 1
i 1 pi
M
L o averag
average code word length, L = ¦ pi Ai
Vi
i 1
A i is length of the code in bits
As such if L t H, minimum value of L i.e. Lmin. = H. Under such

A
circu
circumstances, efficiency will be maximum. To increase efficiency
variable length coding is done.
va
eg. Huffman code.
Q.3(c) Describe WDM in detail. [4]

(A) Wavelength Division Multiplexing (WDM)
Fiber 1 Fiber 2 Fiber 3

Spectrum Spectrum Spectrum
Power
Power
Power
r
O O O
ka
Fiber 1
Shared fiber Fiber
er 3
Fiber 2 Fiber
F 4
an (i) Channels having different frequency
fiber.
(ii) The only difference
ency ranges can be
b multiplexed
multipl on a long
e with electrical FDM iis that optical system is

completely passive.
e.
(iii) Reason WDM iss popular
ular is that the ene
energy on a signal factor is a few
al
gigahertz width
dth because impossible to convert.
cause it is impossib co
(iv) Hence wavelength
velength
th division multiplexing
multiplex is e
explained.
Q.3(d) Compare
e between FHSS and DSS
DSSS (4 points). [4]
(A) arison
rison between DSSS
Comparison DSS and FHSS
FHS
dy
Parameters DSSS FHSS

i) Definition PN sequ
sequence
se of large Data bits are transmitted
bandwidth
bandw
ndw is multiplied in different frequency
with
wit narrow band data slots which are changed by
signal. PN sequence.
Vi
1
ii) Chip rate It is fixed, Rc = Rc = max (Rh, Rs)
Tc
iii) Modulation
Modulat BPSK M-ary FSK
tech
technique
Tb
iiv)
v) Processing gain PG = =N PG = 2t
Tc
Error 1 Eb 1 rb
v) Pe = erfc Pe = e Rc / 2
probability 2 JTc 2
vi) Acquisition time Long Short
vii) Effect of This system is distance Effect of distance
e is le
less.
distance relative.
Q.3(e) Explain multiplexing hierarchy (AT&T) for FDM system. [4]
r
(A) Multiplexing Hierarchy in FDM
x Consider example at telephony in which each voice channel iss having range of
ka
300Hz to 3.4 KHz.
x Here we need to multiplex such ‘n’ no of voice
oice
ice channel by modulatin
modulating it
with different subcarriers.
x Multiplexing hierarchy goes as follows..
Level 1 : Basic Group : [12 voice channels

nnels multiplied
ultiplied together]
an Level 2 : Super Group : [Upto 5 B.G
Level 3 : Master Group : [Upto
Level 4 : Jumbo Group : [Upto
4 KHz
G mux together
her i.e.: upto 12u5 = 60 channels]
togethe i.e. upto 600 V.C.]
to 10 S.Cr mux together
to 6 M.G. maximum together
togeth i.e. upto
u 3600 V.C.]
2u4 = 48 KHz
KH
S1 1
F p
B Group
S1 2 48 = 240 K
48u5
12 rc
al
D G
SG
# M 1 F
240 u 10 = 2400K
S1 12 2 D
1 F MG
# M 2400 u 6 =
5 2 D 14.400K
dy
# M 1 F
JG 3600
5 2 D channel
# M
5
(a) Attempt an
Q.4(a) any THREE o of the following : [12]
Vi
Q.4(a)) (i) List and explain different types of errors in data communication. [4]
(A) Types of error :
Typ
i) SSingle bit error or one bit error
e
ii) Burst error
Singl bit error : if only 1 bit in transmitted bit sequence is changed

Single
because of noise then it is called as single bit error.
transmitted C 1 0 0 0 0 1 1
symbol
+A
A
Received bit seq. 1 0 0 1 0 1 1 z code of C
r
Burst error : If 2 or more than 2 bits are changed because
cause of noise then it
is called as Burst error.
Q.4(a) (ii) Explain Baudot code with suitable example.

e. [4]
(A) Baudot code
In baudot coding every symbol is represented
nted by using 5 binary bits.
bits
2 special codes are used :
i) figure shift code. 1 1 1 1 1
ii) letter shift code 1 1 0 1 1
By using 5 bit code we can

n generate only 32 differ binary bit sequence
different bin
but the number of characters
rs in English text are more
acters m than
t 32 SO 2 special
codes are used. Now codes
odes attached
ached like this :
A 11000
B ? 10011
: 11111
: 11111
Z ” 10001
dy
Example
xample A B?
11011 11000 11111 11000
11011 10011 11111 10011
Letter
ter shift
sh Figure shift
Vi
special co
code code
Q.4(a)
a) (iii) D
Define sampling theorem. List types of sampling techniques. [4]
Draw the naturally sampled signal.
(A) Sampling
Sampli Theorem
"A
Ab bandlimited signal can be reconstructed exactly if it is sampled at a rate
atleast twice the maximum frequency component in it."
There are two types of sampling technique :

(1) Natural sampling
(2) Flat top sampling
Natural Sampled
output
Q.4(a) (iv) Explain cyclic redundenry check with suitable diagram. Explain Expl [4]
[4
CRC for data 100100 to be transmitted tted with division 1101.
(A) Cyclic redundancy cheek technique iss more powerful than p parity ch
check &
check sum error detection.
x It is based on binary division.
x A sequence of redundant called CRC or CRC remainder remain is appended
ap at the
end of data unit such ass byte.
by
x The resulting data unitt after adding CRC remainder re
remainde becomes exactly
divisible by anotherer predetermined
ermined binary no.
n
x At the receiver, r, this data unit is divided by the same binary no.
x There is no error if f this division does not yield
yie any remainder.
x But a non-zerozero remainder
emainder indicates p presence of error in received data unit
x Such an n erroneous
ous bit is then rejected.
r
Procedure
dure
ure :
x Dividede the data unit by predete
predetermined divisor
x Obtain
btain the remainder which
wh is ‘CRC’
x CRCRC should have exactly bit
b less than divisor
x Append the CR CRC to th
the end n bit
of the data unit and then Data 00 ….. 0
divide predetermined
vide it with pre
divisor.
r
Divisor
CRC
n bit
code word
Data CRC
Data : 100100
Divisor : 1101 ? n = no. of divisor bits 1
=41=3
? divided = 100100000
Divisor = 1101
111101
1101 100100000
r
1101
1000
1101
ka
1010
1101
1110
1101
100
1101
001
an ? CRC = 001
? Code word = Data (+) CRC
= 1001000011
Q.4(b) Attempt any ONE of the following ng : [6]

Q.4(b) (i) Discuss Frequency
uency Hopping (FH) sprspread spec
spectrum. [6]
al
(A) Frequency Hopping H) spread spectrum is a F
ping (FH) FM or FSK technique while DS
spread spectrum,
rum, described
escribed in sec.2, is an AM (or PSK) technique. The signal
to be frequency pped is usually a BFSK ssignal although M-ary FSK, MSK or
quency hopped
TFM canan be employed. Conside
Considering ththat BFSK is used, we have that the
original
nal signal, before spread
spre spectrum
spectru is applied, is
dy
s(t)) = 2Ps cos (Z0 t d(t

d(t) :t T)
where d(t) is the data to be ttransmitted. The FH modulation is then applied
by varying the carrier frequency
freq so that the resulting FH spread spectrum is
v(t) = 2Ps cos (Z0 t d(t) :t T)
Here the FH signal has a carrier frequency fi = Zi/2S which changes at the
Vi
hopping rate fH, i.e.,

hop i the carrier frequency fi changes each TH seconds. The
frequency cho
frequ chosen each TH is selected in a pseudo-random manner from a
specified se
speci set of frequencies. Typically 32-500 different frequencies are used
to form this
t set.
The
he primary advantage of FH is that it enables the transmitter to change its
carrier frequency and thereby avoid an otherwise in-band interfering signal.
For example, consider that the FH signal spends an equal time at each of 1000
frequencies f1, f2, …… , f1000. Also assume that BFSK is employed. Then if the
bit rate of the data is fb, the bandwidth used by the signal, at any carrier
frequency fi, is B = 4fb. Now assume that there is an interfering signal having a
bandwidth B = 4fb and a fixed center frequency fj. If frequency hopping ing were
not employed and the interference were located at the transmitted ted signal's
signa
gna
carrier frequency, i.e., j = i, then if the interfering signal powerr were we
sufficiently large the probability of error would be Pe = 0.5 since
nce under
er these
the
circumstances we could do no better than to guess. (In a military y system, the
r
interferer determines the signal's carrier frequency and purposelyely transmits at
loying FH and using
that frequency to block or jam the communications.) By employing
ka
say 1000 frequencies, the probability of the same interferer
nterferer causing an error is
4
reduced to Pe = 1/2000 = 5 u 10 (note that thermal
ermal
mal noise is ignored since it is
considered to be a second-order effect when "jamming" g" is present).
Q.4(b) (ii) Explain the properties of Hamming ng Code.

e. [6]
an Define : (1) Hamming distance. ce.
ance.
(2) Minimum distance.
(3) Weight of code words.
etection capacity.
(4) Error detection
(5) Errorr correction
rrection capacity.
(A) Properties of Hamming ng Code
i) Hamming codes are linear.near.
t n = 2q 1
al
ii) Number of bits in codeword
odeword is equal to
where q = numberer of extra bit
eg. if Q = 3 then n = ?
o 23 1
?n = 7
dy
iii)) Number shoul be always equal to 2q 1 q

ber of message bit K should
iv) Forr the hamming code the th minimum
m distance dmin = 3.
v) Hamming codes can gene generate
gener systematic as well as non – systematic code
words.
vi) Hamming codes
code are used to detect burst error.
Vi
i) Hammin
Hamming Distance
Dist (d) : It is defined as the number of bits in which 2
valid codewords
codew differ from each other.
e
e.g. X1 = 1 0 1 1 0 0 1
X2 = 1 1 0 1 0 1 1
?d = 3.
ii) Minimum distance (dmin) : It is smallest hamming distance between any 2

valid codewords.
iii) Weight of codewords (W) : It is number of man zero elements of

codeword provided. Codeword is not all zero codeword.
dmin = Min [W(x)]
where X z 0 0 0 0 ……0.
Error detection Capability : It is calculated by this, dmin t S + 1
Where dmin = Minimum distance.
S = Number of bits in error that can be detected. ed.
r
e.g. dmin = 3
3 t S+1
ka
? 3 1 t S
? S d 2
upto 2 bits in the error can be detected.
Error correction capability : it is calculated
ated by
y this expression.
expressi
dmin t 2t + 1
anwhere t = number of bits in error that
hat can be corrected.
eg. dmin = 3
3 t 2t + 1
3 1 t 2t
2 t 2t
t t 1
ique can
this coding technique an correct upto 1 b
bit.
al
Q.5 Attempt any y FOUR of the following : [16]
Q.5(a) Draw the e waveforms
ms for 101001
1010011 for : [4]
plit
it phase monchester.
(i) Split monchest
dy
erential monchester
(ii) Differential monchest line cocode formats
(A) For
or 1010011
10011
1 0 1 0 0 1 1
Split phase
+ve manchester
Vi
t
0
ve
differential
+ve manchester
t
0
ve
Q.5(b) What do you understand by channel capacity? How can it be [4]

increased?
(A) Channel Capacity
Data Rate
R = n.fs
Where, n = Number of bits/sample.
fs = Number of sample/sec.
Channel capacity is defined as maximum possible data rate is with which
r
ror.
information can be convey on channel with minimum error.
ka
Q.5(c) List the different error detecting methods.
s.. Describe checksum [4]
method with suitable example.
(A) Different error detection schemes
x Repetition codes
x Parity bits
anx Checksums
x Cyclic redundancy checks (CRCs)
CRCs)
x Cryptographic hash functions
tions
Checksums
Most of error detection ion techniques
niques uses a process
pr known
k as checksum to
detection
generate an error-detection ion character. The charact
c
character results from summing
all the bytes of a messageM
sageM together, d discardin
discarding and carry over from the
al
addition. Again,in, the
e process is repeated
repe at the receiver and the two
a
checksums are compared.
ompared. A match mat be
between receiver checksum and
transmittedted checksum
um indicates g good ddata. A mismatch indicates an error
ccurred.
curred. This method,
has occurred. meth like CR
CRC, is capable of detecting single or
dy
multiple message. The major advantage of checksum is that it

ltiple errors in the mess
is simple
ple to implement in eithe
e
either hardware or software. The drawback to
checksum is that, unless you y use a fairly large checksum (16- or 32-bit
instead
nstead of 8-bit), there are several data-bit patterns that could produce the
same
me checksum re result, thereby
t decreasing its effectiveness. It is possible
that if enough
enou errors occur in a message that a checksum could be produced
Vi
that would be the same as a good message. This is why both checksum and
CRC error-detection
error-dete methods do not catch 100% of the errors that could
occur, they b
occur both come pretty close.
Example : What is the checksum value for the extended ASCII message
“Help!”?
“Help!”
Solution :
The checksum value is found by adding up the bytes representing the Help!
characters:
01001000 H
01100101 e
01101100 l
01110000 p
00100001 !
00010000 Checksum
checksum error-detection process that uses the sum of the e data stream
ream iin
bytes. The hardware solution relies once more on exclusiveive ORR gates, which
r
perform binary-bit addition. Each 8-bits of data are exclusivee ORed with the
xclusive
accumulated total of all previous 8-bit groups. The final accumulated
ccumulated total is
ka
the checksum character.
Q.5(d) Explain FDMA system with schematic diagram. gram. Compare

ompare FDMA and a [4]
[4
TDMA.
(A) FDMA (Frequency division multiple access)
ccess)
anx This technique is based an FDM M tech
x In FDMA available bandwidth h is shared
ared by all the station
stat
x Each station is allocated with
th a particular
articular frequency band to send its data.
Example
Guard
ard Bands
nds
al
Station Station Station Station
1 2 3 4
freq
f0 f1 f2 f3 f4 f5
dy
Available B.W.
Availa
x In above diagram frequenc

frequency
frequen band f0 to f1 is reserved for station 1, f2, to f3
is reserved for s2 etc.
x Guard bands a are als
also provided in between the adjacent frequency slot to
avoid
oid crosstalk.
cr
Vi
Features
Fea
x O Overall channel
ch band width is shared by multiple users therefore no of
users ca
u can transmit their information simultaneously.
x Guar
Guard band are provides because :
i) To avoid cross talk
ii) Impossible to achieve ideal filtering to separate different users
x Power efficiency different users.
x Synchronization is not required
Advantages :
x All stations can operate continuously and simultaneously.
x Power required for transmission depends on the no of channels being
transmitted.
x SNR is improved because of Fm
x Synchronization is not required.
Disadvantages :
x Each channel on earth station can used only a part of totall satellite B.W.
x Inspite having guard bands adjacent channel interference
erference
nce is present.
x Because of the use of Fm, Bw required & therefore
erefore less no of channe
channels
can be accommodated in available Bandwidth.
h.
k
Parameter FDMA TDMA
Technique Sharing of overall B.W. of Sharing of ove
overall time os
an satellite transponder
onder satellite
ite transponder
transponde
tr
Syndrome Not required Required
Req
Code word Not required
red Not required
r
Power Less F
Ful
Full
ull power n is poss
efficiency
Guard time & Guard
uard band required Guard time required
Guard band
al
Q.5(e) Describe working
rking of DSSS system in detail.
detail [4]
(A) tem (Direction
DSSS system ection Sequence (DS) Spread
S Spectrum)
A Direct
ct Sequence (DS) spread sspectrum
spectru signal is one in which the amplitude
of an
n already
lready modulated signal
s amplitude modulated by a very high rate
is am
dy
NRZ
RZ binary
nary stream of digits Thus, if the original signal is s(t),
digits. Thus
where s (t) = 2Ps d(t)
(t) co
cos Z0t … (1)
a binary PSK signal),

(a signa the DS
D spread spectrum signal is
v (t) = g(t) s(t) = 2Ps g(t) d(t) cos Z0t … (2)
where g(t) is a pseudo-random

pse noise (PN) binary sequence having the values r1.
characteristics of g(t) are extremely interesting and are discussed in

The charact
some det
detail in Ranging using DS spread spectrum. Here we merely assume
that gg(t) is a binary sequence as is the data d(t). The sequence g(t) is
generated
en in a deterministic manner and is repetitive. However, the
sequence length before repetition is usually extremely long and to all intents
and purposes, and without serious error, we can assume that the sequence is
truly random, i.e., there is no correlation at all between the value of a

particular bit and the value of any other bits. Furthermore, the bit rate fc
of g(t) is usually much greater than the bit rate fb of d(t). As a matter of
fact the rate of g(t) is usually so much greater than fb, we say that ha g(t)
"chops the bits of data into chips", and we call the rate of g(t) the rate
e chip ra
fc, retaining the words, bit rate, to represent fb.
To see that multiplying the BPSK sequence s(t) by g(t) spreads

reads the spectrum
r
we refer to figure 1 which shows a data sequence d(t), a pseudo-random
(often called a pseudo-noise or PN) sequence g(t) and nd the product sequence
ka
g(t) d(t). Note that (as is standard practice) the e edges of g(t) and d(t) aare
aligned, that is, each transition in d(t) coincides
des
es with a transition on g(t).
The product sequence is seen to be similar to g(t) indeed if g(t) we were truly
random, the product sequence would be another other random seque
sequence g g'(t)
having the same chip rate fc as g(t). Since
ince thee bandwidth of ththe BPSK signal
an s(t) is nominally 2fb the bandwidth of the BPSK spread spectrum
sp ssignal v(t)
is 2fc and the spectrum has been n spread
d by the ratio
rat fc/f fb. Since
Sinc the power
transmitted by s(t) and v(t) iss the same, i.e., Ps, the power spectral
sp density
Gs(t) is reduced by the factor
tor fb/fc.
al
dy
Fig. 1 : (a
(a) The waveform of the data but stream d(t).
Vi
(b) The chipping waveform g(t).

(c) The waveform of the product g(t) d(t).
To recover
re tthe DS spread spectrum signal, the receiver shown in figure 2 first
multiplies the incoming signal with the waveform g(t) and then by the carrier
2 c
cos Z0t. The resulting waveform is then integrated for the bit duration and
the output of the integrator is sampled, yielding the data d(kTb). We note that
at the receiver it is necessary to- regenerate both the sinusoidal carrier of
frequency Z0 and also to regenerate the PN waveform g(t).
r
Fig. 2 : A BPSK communication system incorporating a spread
ad spectr
spectrum
technique.
ka
Q.6(a) Explain BPSK, draw its waveforms. [4]
(A) BPSK : Binary phase shift keying
In the BPSK phase of a carrier is modified
ied according
cording to value of
o the sym
symbol.
an b(t) b(t) phase shift transmitted

ransmitted
ted signal
s
1 +1 0o 2P
P cos . (2Sfct)
0 1 180o 2P cos . (2Sfct 18
180D )
+V Tb
0o
al
V
180o
dy
In
n general transmitted BPSK signal is.
transmitt BPS
S(t) = b(t) . 2
b 2P . cos(2Sfc t)
Vi
b(t)
Binary
Bipolar
bit
Seq. NRZ s(t)
encoder
2P cos(2Sfc t)
Working of transmitter of BPSK
Bipolar NRZ encoder : given information signal will consists of binary bits 1 &
0 this binary bit sequence is converted into bipolar NRZ signal by this block
output of bipolar NRZ encoder is b(t).
Where, b(t) = +1 when bit = 1
b(t) = 1 when bit = 0
Modulator : bipolar b(t) is used as modulating signal and 2P cos (2Sfc t) is

al to generate BPSK
used as carrier. The modulator multiplies 2 input signal
r
signal S(t) = b(t) . 2P . cos (2Sfct)
ka
BPSK waveforms :
Binary bit 1 0 1 1 0 1
+1
an b(t) t
0
1
2P (2Sfct) t
0
al
BPSK
al
signal t
s(t)
t)
o o
80o 1
1o 180 0o 180 0
o
dy
Q.6(b)
b) Draw the block diagram of M-ary
M FSK transmitter and receiver. [4]
(A)) Mary Frequency Shift KeKeying (MFSK)
In MFSK, we use group
g of
o N bits, which gives rise to M different symbols.
N
M=2
Vi
Each symbol
symbo duration
durat is TS = N Tb
uses different frequency, hence, MFSK uses frequencies f1, f2, … fM.
Each symbol u
The probability
pr of error is minimized of the frequencies f1, f2, … fM are
selec
selected so that M signals are mutually orthogonal. One commonly used
arrangement simply provides that the carrier frequency be successive even
harmonics of the symbol frequency fS = 1/TS.
Thus we have,
f1 K fS
f2 K 2 fS
#
f3 K 2M 2 fS
Now we can write equation of MFSK signal as
VMFSK t P1 t 2PS cos Z1t P2 t 2PS cos Z2t ... Pm t 2PS coss ZMt
r
where P1(t), P2(t), … Pm(t) are NRZ unipolar signals outt of which
ch only one is +1
ka
for every TS (= NTb) sec.
Transmitter
1
b (t)
Serial to 2 Nbit Vm Frequency
parallel : DAC Modulator VMFSK (t)
an converter N m = 1, 2, .. M
In the figure, when N bitss of b(t) enter into seria

serial to pa
parallel converter,
they appear simultaneously
ly at the output of serial to
t parallel
para converter.
These bits are given AC which generates an analog

n to DAC ana voltage Vm where m =
1, 2, … M. That is, the e output of DAC may have
hav M different levels. This
al
voltage Vm is applied to frequency modulator
mod w
which generates a sine wave of
constaint amplitude
mplitudee but the frequency
freque dependent on input voltage Vm.
is de
ver
er
Receiver
dy
BPF
B Envel
Envelope
Z1 de
detector b1
b2
BPF Envelope Nbit
Select
VMFSK(t) Z2 detector
output .
largest
Vi
. . .
. . output (ADC) .
. .
Envelope bN
BPF
ZM detector
PSD of MFSK signal
VMFSK(t) = P1 t 2PS cos Z1t P2 t cos Z2t ... Pm t 2PS cos Zm t
PS
? GMFSK(t) =
8 ¬
^
ª G f f1 G f f1 º ... ª G f fM G f fM º
¼ ¬ ¼ `
NPSTb
+
8
^
ªSa2 S f f1 NTb Sa2 S f f1 NTb º ....
¬ ¼
r
ªSa2 S f fM NTb Sa2 S f fM NTb º
¬ ¼
ka
GMFSK(f)
PS
8
NPSTb
8
an f1
f1 fb / N
f f fM
fM + fb / N
f
fb
B W M 2
N
al
Q.6(c) Draw the block ck diagram
gram of ADM transmitter.
transmitte
tra Describe its working [4]
orms.
with waveforms.
(A) Adaptive e delta modulation
ulation (ADM)
In the
e adaptive delta mod
modulator if the
there is the rate of change of input signal
dy
igh we will increa

is very high l
increase the level. And if the rate of change of input
signal is low then we will dec
decreas
decrease the level.
Step size
calculation
x (kts)
Vi
+ e (nts)
Quantizer
6
(kt )
x s +
+
6
accumulator
delay ts
G
2G G
G
amplitude
2G G >G <GG
r
2G
ka
G
G
time
tim
0 1 2 3 4 5 6 7 8 9 10 11 12 13
ADM Receiver
an Receivers sign
Step size
calculation
+
+
6
delay
dela ts
LPF
Advantages :
i) It reduces slopp overload
load error by increasing
incr st
step size.
al
ii) It reduces granular noise by decreasing
decreasi step size.
Disadvantages
ges
i) ADM transmitterer receiver are complex
comple and
ost
st of ADM is high.
ii) Cost
dy
Q.6(d) State applications of s.s. modulation

modu
m (any four). [4]
(A) Applications of Spread Spectrum
Spect
Spe Techniques
(i) For combining the inten
intentional interference.
(ii) For reducing the
t unintentional
unin interference.
(iii) For sup the interference due to the multipath interference.
suppressing th
Vi
(iv) In the lo probability of intercept application as explained in section.

low prob
(v) Due to large bandwidth of a spread spectrum signal can be recognized
only by th
o the authorised user. All other receiver consider this as noise.
Q.6(e)
6(e) Explain quantization in detail. [4]
(A) Quant
Quantization Process
x It is a process of approximation or rounding off.
x It converts sampled signal into approximate quantized signal which
consists of finite no. of pre-decided voltage levels.
x Each sample value at input of quantizer is approximated to nearest

predicted voltage level. These standard levels are called quantization levels.
Amplitude Quantization Quantized signal xq(t)

noise (t)
Input signal x(t)
s q7
s q6
r
s q5
s q4
ka
s q3
s q2
s q1
s q0
VL
an Time
x ed to have peak-peak swing

Input signal x(t) is assumed s of VL to VH volts.
ge has been divided into Q equal intervals each of
This entire voltage range
size 'S'.
x ze
S is called step size
V VL
S = H
al
Q
i.e. Q = 8 for nw
x At thee center of these ranges the qua quantization levels q0, q1, q2, }} , q7
are placed.
x xq (t) is quantized ver
version of x(t
x(t) which is available at the output of q
dy
quantizer.
ntizer.
x When range of '0, the corresponding to any value of x(t)
hen x(t) is in the rang
the wil be equal to 'q0'. Similarly for all the values of
e quantizer output will
x(t) in '1, the q
quantize
quantizer output is q1.
x Thus in each range from '0 to '7 signal x(t) is rounded off to nearest
quantization
ntiza leve
level and quantized signal is produced.
Vi
x In PCM,
PCM code
coded no. is transmitted for each level sampled in modulating
s
signal.
x If we do not use quantizer block in PCM then this will need a large no. of
I
bits per
p word which will increase bit rate and finally bandwidth.
x Qu
Quantization has effect of reducing this infinite no. of levels to
relatively small nos. which can be transmitted without difficulty.

(AIC) Communication Notes

Caricato da

Informazioni sul documento

Copyright

Formati disponibili

Condividi questo documento

Condividi o incorpora il documento

Opzioni di condivisione

Hai trovato utile questo documento?

Questo contenuto è inappropriato?

Copyright:

Formati disponibili

(AIC) Communication Notes

Caricato da

Copyright:

Formati disponibili

T.Y. Diploma : Sem.

Q.1(a) Attempt any THREE of the following : [12]

Q.1(a) (ii) List and explain variouss properties of Hamming

What is companding? Draw the companding curves for PCM [4]

Q.1(b) Attempt any ONE of the following : [6]

Q.1(b) (ii) Draw

Common communication Link

Synchronous TDM Asynchronous TDM

Q.2(d) Write bandwidthh requirement

Q.2(e) Compare QPSK and QASK

Q.3 Attempt any FOUR of the following : [16]

When it occupies onehalf of the symbol duration, it is said to be of the

ers simplicity of implement

* Important feature of bipolar format is that, in the absence of a dc

Q.3(b) Discuss Shannon’s theoremem in brief. [4]

A i is length of the code in bits

As such if L t H, minimum value of L i.e. Lmin. = H. Under such

Q.3(c) Describe WDM in detail. [4]

Fiber 1 Fiber 2 Fiber 3

e with electrical FDM iis that optical system is

Parameters DSSS FHSS

Q.3(e) Explain multiplexing hierarchy (AT&T) for FDM system. [4]

Level 1 : Basic Group : [12 voice channels

Singl bit error : if only 1 bit in transmitted bit sequence is changed

Received bit seq. 1 0 0 1 0 1 1 z code of C

Q.4(a) (ii) Explain Baudot code with suitable example.

By using 5 bit code we can

11011 11000 11111 11000

11011 10011 11111 10011

There are two types of sampling technique :

Q.4(b) Attempt any ONE of the following ng : [6]

s(t)) = 2Ps cos (Z0 t  d(t

hopping rate fH, i.e.,

Q.4(b) (ii) Explain the properties of Hamming ng Code.

iii)) Number shoul be always equal to 2q  1   q

ii) Minimum distance (dmin) : It is smallest hamming distance between any 2

iii) Weight of codewords (W) : It is number of man zero elements of

Q.5(b) What do you understand by channel capacity? How can it be [4]

Channel capacity is defined as maximum possible data rate is with which

multiple message. The major advantage of checksum is that it

Q.5(d) Explain FDMA system with schematic diagram. gram. Compare

x In above diagram frequenc

a binary PSK signal),

v (t) = g(t) s(t) = 2Ps g(t) d(t) cos Z0t … (2)

where g(t) is a pseudo-random

characteristics of g(t) are extremely interesting and are discussed in

truly random, i.e., there is no correlation at all between the value of a

To see that multiplying the BPSK sequence s(t) by g(t) spreads

(b) The chipping waveform g(t).

an b(t) b(t) phase shift transmitted

Working of transmitter of BPSK

Modulator : bipolar b(t) is used as modulating signal and 2P cos (2Sfc t) is

Now we can write equation of MFSK signal as

In the figure, when N bitss of b(t) enter into seria

These bits are given AC which generates an analog

PSD of MFSK signal

VMFSK(t) = P1 t 2PS cos Z1t  P2 t  cos Z2t  ...  Pm t  2PS cos Zm t

igh we will increa

Q.6(d) State applications of s.s. modulation

(iv) In the lo probability of intercept application as explained in section.

x Each sample value at input of quantizer is approximated to nearest

Amplitude Quantization Quantized signal xq(t)

x ed to have peak-peak swing

Potrebbero piacerti anche

When it occupies onehalf of the symbol duration, it is said to be of the

s(t)) = 2Ps cos (Z0 t d(t

iii)) Number shoul be always equal to 2q 1 q

VMFSK(t) = P1 t 2PS cos Z1t P2 t cos Z2t ... Pm t 2PS cos Zm t