EC6501 DIGITAL COMMUNICATION

UNIT 1

1. Define time limited and time unlimited signals. (Apr-May 2011)

A time limited signal is one that is non-zero only for a finite length time interval
and time unlimited signal is one which is non-zero for infinite length time interval. A
signal that is band limited is not time-limited and vice-versa.

2. Give an advantage and disadvantage of digital communication. (Apr-May 2011)

Circuitry becomes simpler than analog communication.

Highly resistive to noise as binary signals are dealt.

Highly secure.

Can travel long distances and can store data for long time.

3. Which parameter is called figure of merit of a digital communication system

and why? (Nov-Dec 2010)

Eb
The ratio of bit energy to noise power spectral density is called as the figure

N
0

of merit of a digital communication system. This is because in digital

communication system a symbol is transmitted and received by using a
transmission window within a symbol tree. Since power goes to zero, symbol
energy is a more useful parameter.So a energy related parameter in terms of bit
level is required to compare different systems.

4. What is meant by distortionless transmission? (Nov-Dec 2010)

If the overall system response has constant magnitude and if its phase shift is
linear with frequency then that is said to be distortionless transmission.

5. Draw the basic block diagram of digital communication system.(Nov-Dec 2011)

6. Define Half power bandwidth. (Nov-Dec 2011)

This is the bandwidth where power spectral density drops to half (3db) of the
maximum value. It is also called 3 db bandwidth.

7. Define PWM.

PWM is basically pulse width modulation. Width of the pulse changes according
to amplitude of the modulating signal. It also referred as pulse duration
modulation or PDM

8. How is PDM wave converted into PPM message?(Apr-May 97)

The PDM is signal is clock signal to monostable multivibrator. The multivibraor

triggers on falling edge. Hence a PPM pulse of fixed width is produced after
falling edge of PDM pulse. PDM represents the input signal amplitude in the
form of width of the pulse. A PPM pulse is produced after the width of PDM
pulse. In other words, the position of the PPM pulse depends upon input signal
amplitude.

9. State Dimensionality theorem.

The dimensionality theorem states that, a real waveform can be completely

specified by N independent pieces of information where N is given by,

N = 2BT0

Where N = Dimension of the waveform in signal space

B = Bandwidth of the signal

T0= Time over which the waveform is described (period).

10. What are the applications of dimensionality theorem?

i) Dimensionality theorem is used to calculate storage space required to store digital

signal.

ii) It is used to estimate bandwidth of the signal.

11. Define measure of information. ( Apr-May 2012)

H(y) is called entropy. It is a measure of average information content per source

symbol.
k 1

Pk I (S k )
k 0

H(y) = E[I(Sk)] = k 1 1

P log
k 2

P
k 0 k

12. What is meant by symmetric channel? (Apr-May 2012)

It is the special case of discrete memory less channel. Its transition

probabilities are given as

y y
0 1

P P P

x x
0 1
y y
1 0
P P 1P

x
1

x
0

The channel is said to be symmetric if the probability of receiving a 0 when 1 is

transmitted and probability of receiving a 1 when 0 is transmitted is same.

13. What is the function of formatter in digital communication system?

 It converts electrical signals at the output of the transducer into a sequence of
digital signals.

14. How is the performance of digital communication system evaluated?

The performance of digital communication system is evaluated depending upon

i) Spectral efficiency ii) Bit error rate (BER).

15. Why are the signals represented geometrically?

The signals are represented geometrically so that

23 The probability of error in transmission can be studied.

24 Distance or separation between individual messages can be determined

UNIT II

1. Define Nyquist rate.

Let the signal be bandlimited to W Hz. Then Nyquist rate is given as,

Nyquist rate = 2W samples/sec

Aliasing will not take place if sampling rate is greater than Nyquist rate.

2. What is meant by aliasing effect?

Aliasing effect takes place when sampling frequency is less than Nyquist rate.

Under such condition, the spectrum of the sampled signal overlaps with itself. Hence
higher frequencies take the form of lower frequencies. This interference of the
frequency components is called as aliasing effect.

3. What is meant by temporal waveform coding? (Nov-Dec 2011)

Temporal waveform coding is a scheme in which time domain waveform is

encoded. Bit allocation depends upon time domain features. Bit rate is high compared
to signal bandwidth and reconstruction is perfect.

4. Compare uniform and non-uniform quantization. (Nov-Dec 2011)

In uniform quantization, the stepsize or the difference between two quantization

levels remain constant over the complete amplitude range.

In non-uniform quantization stepsize varies.

5. State Sampling theorem. (May-June 2012)

A bandlimited signal of finite energy, which has no frequency components higher

than W Hz, may be completely recovered from the knowledge of its samples taken at
the rate of 2W samples per second.

23 Mention the merits of DPCM.

23 Bandwidth requirement of DPCM is less compared to PCM.

24 Quantization error is reduced because of prediction filter

 25 Numbers of bits used to represent one sample value are also reduced compared
to PCM.

24 What is the main difference in DPCM and DM?

DM encodes the input sample by one bit. It sends the information about + or -, ie
step rise or fall. DPCM can have more than one bit of encoding the sample. It sends
the information about difference between actual sample value and the predicted
sample value.

23 What are the two types of quantization that occur in delta modulation? (Apr-

May 2010)

23 Slope overload distortion and ii) Granular noise.

24Write an expression for bandwidth of binary PCM with N messages each with a
maximum frequency of fm Hz.

If v number of bits are used to code each input sample, then bandwidth of PCM
is given as, BT N.v.fm , Here v. fm is the bandwidth required by one message.

10. Mention the use of adaptive quantizer in adaptive digital waveform coding
schemes.

Adaptive quantizer changes its step size according variance of the input signal.

Hence quantization error is significantly reduced due to the adaptive quantization.

ADPCM uses adaptive quantization. The bit rate of such schemes is reduced due to
adaptive quantization.

11. What do you understand from adaptive coding?

In adaptive coding, the quantization step size and prediction filter coefficients are
changed as per properties of input signal. This reduces the quantization error and
number of bits to represent the sample value. Adaptive coding is used for speech
coding at low bits rates.

12. What is meant by quantization? (May-June 2012)

While converting the signal value from analog to digital, quantization is

performed. The analog value is assigned to nearest digital value. This is called
quantization. The quantized value is then converted into equivalent binary value. The
quantization levels are fixed depending upon the number of bits. Quantization is
performed in every Analog to Digital Conversion.

13. The signal to quantization noise ratio in a PCM system depends on what
criteria?

The signal to quantisation noise ratio in PCM is given

as, (S/N)db (4.8+6v)dB

Here v is the number of bits used to represent samples in PCM. Hence signal to
quantization noise ratio in PCM depends upon the number of bits or quantization
levels.

23 What is meant by adaptive delta modulation?

In adaptive delta modulation, the step size is adjusted as per the slope of the

input signal. Step size is made high if slope of the input signal is high. This avoids
slope overload distortion.

15. What is the advantage of delta modulation over pulse modulation schemes?

Delta modulation encodes one bit per samples. Hence signalling rate is reduced
in DM.

16. What should be the minimum bandwidth required to transmit a PCM

channel?

The minimum transmission bandwidth in PCM is given as, BT = vW

Here v is the number of bits used to represent one pulse. W is the maximum signal
frequency.

17. What is the advantage of delta modulation over PCM?

 Delta modulation uses one bit to encode on sample. Hence bit rate of delta
modulation is low compared to PCM.

23 What are the two limitations of delta modulation?

23 Slope of overload distortion.

24 Granular noise.

How does Granular noise occurs?

It occurs due to large step size and very small amplitude variation in the input

signal.

What are the advantages of the Delta modulation?

23 Delta modulation transmits only one bit for one sample. Thus the
signaling rate and transmission channel bandwidth is quite small

for delta modulation.

24 The transmitter and receiver implementation is very much simple for delta
modulation. There is no analog to digital converter involved in delta
modulation.
24 Why is prefiltering done before sampling? (Apr-May 2011)

f
Prefiltering is done so that the new maximum frequency is reduced to 2s or less.
Thus there will be no aliased components.

22. State the advantage of adaptive delta modulation over delta modulation?

(Nov-Dec 2010)

23 If the successive errors are of opposite polarity then the delta modulator is
operated in its granular mode, in this case it may be advantageous to reduce the step
size.

If successive errors are of same polarity then the delta modulator is operated in its
slope overload mode, in this case the step size should be increased
UNIT III

1. What is hamming distance?(Apr-May 2008, Nov-Dec 2009,Nov-Dec 2010)

The hamming distance between two code vectors is equal to the number of
elements in which they differ. For example, let the two code words be,

X = (101) and Y= (110)

These two code words differ in second and third bits. Therefore the hamming distance
between X and Y is two.

2. Define code efficiency.

The code efficiency is the ratio of message bits in a block to the transmitted bits
for that block by the encoder i.e.,Code efficiency= (k/n) k=message bits n=transmitted
bits.

3. Draw the RZ-Bipolar line code format for the information {01101001).

(Nov-Dec 2011)

3. What is meant by systematic and non-systematic codes?

 In a Systematic block code, message bits appear first and then check bits. In the
non-systematic code, message and check bits cannot be identified in the code vector.

4. What is meant by linear code?(Nov-Dec 2007)

A code is linear if modulo-2 sum of any two code vectors produces another code
vector. This means any code vector can be expressed as linear combination of other
code vectors.

23 What are the error detection and correction capabilities of hamming codes?
(Apr-May 2008, May-June 2009)

The minimum distance (dmin) of hamming codes is 3. Hence it can be used to

detect double errors or correct single errors. Hamming codes are basically linear block
codes with dmin =3.

23 To detect up to s errors per word, dmin S+1

24 To correct up to t errors per word, dmin 2t +1

24
25 What is meant by cyclic codes? Mention its properties.(Nov-Dec 2011)

Cyclic codes are the subclasses of linear block codes. They have the property that a
cyclic shift of one codeword produces another code word.

Properties : i) Linearity: The sum, of any 2 code words in the code is also a code word.
ii)Cyclic property: Any cyclic shift of a code word in the code is also a code word.If X =

(xn-1, xn-2, x1, x0) Then X = (xn-2, xn-3 , x1, x0, xn-1) which is another code vector.X

= (xn-3, xn-4., x1, x0, xn-1, xn-2) which is a valid code vector.

7. How syndrome is calculated in Hamming codes and cyclic codes?

T
In hamming codes the syndrome is calculated as, S=YH
T
Here Y is the received and H is the transpose of parity check matrix.
8. What is BCH code?(May-June 2006)

BCH codes are most extensive and powerful error correcting cyclic codes. The decoding of
BCH codes is comparatively simpler. For any positive integer m and t

m-1
(where t<2 )there exists a BCH code with following parameters:
m-1
Block length: n= 2
Number of parity check bits : n-k<=mt

Minimum distance: dmin>=2t+1

9. What is RS code?(Apr-May 2005)

These are non binary BCH codes. The encoder for RS code operates on multiple
bits simultaneously. The (n, k) RS code takes the groups of m- bit symbols of incoming
binary data stream. It takes such k number of symbols in one block. Then the
encoder acts (n k) redundant symbols to form the code word of n symbols.

RS code has:

m
Block Length : n=2 -1 symbols
Message size: K symbols

Parity check size: n-k= 2t symbols

Minimum distance: dmin=2t+1 symbols

23
24
25 What is difference between block codes and convolutional codes?(Nov-Dec
2005, May-June 2012, May-June 2009)

Block codes takes k number of bits simultaneously form n bit code vector. This
code vector is also called block. Convolutional code takes one message bits at a time
and generates two or more encoded bits. Thus convolutional codes generate a string of
encoded bits for input message string.

26 Define constraint length in convolutional code?(Nov-Dec 2007)

Constraint length is the number of shifts over which the single message bit can
influence the encoder output. It is expressed in terms of message bits.

12. Define free distance and coding gain.(Nov-Dec 2005)

Free distance is the minimum distance between code vectors. It is also equal to
minimum weight of the code vectors.

Coding gain is used as a basis of comparison for different coding methods. To achieve
the same bit error rate the coding gain is defined as,

A (Eb / N o )Encoded
 (Eb / N o )coded

For convolutional coding, the coding gain is given as,

A = rdf /2

Here r is the code rate

And df is the free distance.

13. What is convolution code?(May-June 2012)

Convolutional codes are generated by convolution between message sequence

and generating sequence. Each message bit is encoded separately. For every message
bit, two or more encoded bits are generated (i.e) coding is bit by bit.

14. What is meant by syndrome of linear block code?(Apr-May 2004)

T
The non zero output of the produce YH is called syndrome & it is used to detect

T
errors in y. Syndrome is denoted by S & given as,S=YH

15. What are the advantages of convolutional codes?

Advantages:i)The decoding delay is small in convolutional codes since they operate

on smaller blocks of data. ii)The storage hardware required by convolutional decoder
is less since the block sizes are smaller.

Disadvantages:i)Convolutional codes are difficult to analyze since their analysis is

complex. ii)Convolutional codes are not developed much as compared to block codes.

16. Define states of encoder?

The constraint length of the given convolutional encoder is K=2. Its rate is
means for single message bit input, two bits x1 and x2 are encoded at the output. S1

represents the input message bit and S2 stores the previous message bit. Since only
one previous message bit is stored, this encoder can have states depending upon this
stored message bit. Lets represent,

S2 = 0 state a

and S2 = 1 state b

17. Compare between code tree and trellis diagram?

S.No
Code tree Trellis diagram

Trellis diagram indicates

Code tree indicates flow of the transitions

1 coded signal along the nodes of from current to next states.

the tree.

Code tree is lengthy way of Code trellis diagram is shorter or

23 representing coding process.compact way of representing

coding process.

18. Write the features of BCH Codes?

BCH codes are most extensive and powerful error correcting cyclic codes. The
decoding of BCH codes is comparatively simpler.

The decoding schemes of BCH codes can be implemented on digital computer.

Because of software implementation of decoding schemes they are quite flexible
compared to hardware implementation of other schemes.

19. What is Golay codes?

Golay code is the (23,12) cyclic code whose generating polynomial is,
11 9 7 6 5
G(p) = p +p +p +p +p +p+1

This code has minimum distance of dmin = 7. This code can correct upto 3 errors. But

Golay code cannot be generalized to other combinations of n and k.

20.Define Hamming weight and Minimum Hamming distance. (Nov-Dec 2010)

Hamming weight of a code vector is defined as the number of non-zero

elements in the code word or it is the distance between the code vector and all zero
code vector.

Hamming distance is defined as the number of locations in which their

respective elements differ or the minimum distance is defined as the smallest
Hamming distance between any pair of codevectors in the code or the minimum
distance is defined as the smallest Hamming weight of the non-zero code vectors in
the code.

21. What is Manchester Code? (May-June 2012)

Here every symbol is transmitted with positive as well as negative amplitude.

There is no possibility of DC component in the signal.

23 Give the special features of Trellis codes.(Nov-Dec 2007)

23 Code Trellis is more compact representation of code tree.

24 Decoding is little complex.

25 It is simpler to implement.

26 It shows the transition from current to next states.

24 What is meant by transparency with respect to line codes.(Apr-May 2011)

A line code should be so designed that the receiver does not go out of
synchronization for any sequence of data symbols. A code is not transparent if for
some sequence of symbols, the clock is lost.
UNIT IV

1. What is intersymbol interference? (Nov-Dec 2009)

In baseband binary PAM, symbols are transmitted one after another. These
symbols are separated by sufficient time durations. The transmitter, channel and
receiver acts as a filter to this baseband data. Because of the filtering characteristics,
transmitted PAM pulses spread in time. The presence of outputs due to other bits
interference with the output of required bit . This effect is called ISI. The receiving
filter output y(t) sampled at time ti=iTb of a baseband system is

y(ti ) ak P(iTb kTb )

k

ai ak P(iTb kTb )

1 i k

th
The first term ai is produced by the i transmitted bit. The second term represents

th
the residual effect of all other transmitted bits on the decoding of i bit, this residual
effect is called intersymbol interference.

In the absence of ISI, y(ti ) ai .

2. What is correlative coding? (Nov-Dec 2007,Nov-Dec 2009)

Correlative level coding is used to transmit a baseband signal with the signalling
rate of 2Bo over the channel of bandwidth Bo. This is made physically possible by
allowing ISI in the transmitted in controlled manner. This ISI is known to receiver. The
correlative coding is implemented by duobinary signalling and modified duobinary
signalling.

3. What is meant by matched filter? (May-June 2009)

Matched filter is a filter which is used for detection of signals in baseband and
passband transmission. The shape of the impulse response of the matched filter is
similar or matched to the shape of the input signal x(t). Hence it is called matched
filter.
4. What are eye patterns?(Nov-Dec 97)

Eye pattern is used to study the effect of ISI in baseband transmission.

1 Width of eye opening defines the interval over which the received wave can be
sampled without error from ISI.

2 The sensitivity of the system to timing error is determined by the rate of closure of
the eye as the sampling time is varied.

3 Height of the eye opening at sampling time is called margin over noise.

5. How is eye pattern obtained on the CRO?(May-June 2009)

Eye pattern can be obtained on CRO by applying the signal to one of the input
channels and given an external trigger of 1/Tb Hz. This makes one sweep of beam
equal to Tb seconds.

Why do you need adaptive equalization in a switched telephone network.(Nov-

Dec 2005)

In switched telephone network the distortion depends upon

1 Transmission characteristics of individual links.

2 Number of links in connection.

Hence fixed pair of transmit and receive filters will not serve the equalization problem.

The transmission characteristics keep on changing. Therefore adaptive equalization is

used.

7. Define the principle of adaptive equalization?

The filters adapt themselves to the dispersive effects of the channel that is the
cofficients of the filters are changed contineously according to the received data. The
filter cofficients are changed in such a way that the distortion in the data is reduced.

8. Define duobinary encoding?

 Duobinary encoding reduces the maximum frequency of the base band signal
the word duo means to the double transmission capacity of the binary system.

9. Write a note on correlative level coding?(Nov-Dec 2007)

Correlative level coding allows the signal scaling rate of 2Bo in the channel of
bandwidth Bo. This is made physically possible by allowing ISI in the transmitted
signal in controlled manner, this ISI is known to the receiver.

10. What is an ideal Nyquist channel?(Nov-Dec 2006, Nov-Dec 2009)

For an ideal Nyquist channel, the transmission bandwidth (B 0) is given by half

the bit rate (Rb).

The frequency function P(f) occupying the narrowest band is

1 f

P( f ) rect

2B 2B

0 0

1 What are the properties of matched filter?(May-June 2012)

1 The S/N ratio depend only upon the ratio of signal energy to the
PSD of white noise at filter output.

2 The maximum signal component occurs at t=T and has

magnitude E,(i.e) energy of the signal x(t).

1 The output signal is proportional to the shifted version of the

auto-correlation function of the input signal to which the
filter is matched.

2 What is the necessity of equalization?(May-June 2007)

When the signal is passed through the channel distortion is introduced in

terms of 1) amplitude 2) delay this distortion creates problem of ISI. The detection of
the signal also become difficult this distraction can be compensated with the help of
equalizer.
 13. What is raised cosine spectrum?

In the raised cosine spectrum, the frequency response P(f) decreases towards
zero gradually That is there is no abrupt transition).

14. What are the information that can be obtained from eye pattern regarding
the signal quality? (May-June 2012)

1 The width of eye opening define the interval over which the received wave can be
sampled without error from ISI.

2 The sensitivity of the system to tuning error is determined by the rate of closure of
eye as the sampling time is varied.

3 The height of eye opening, at specified sampling time is called margin over noise.

15. State Nyquist criterion for zero ISI.(Nov-Dec 2007, Nov-Dec 2011)

1 f ori
Time domain : p[(i-k)Tb] =

0 f ori

Frequency domain : P( f nfb ) Tb

n

This is Nyquist criterion for perfect reception in the absence of noise.

16. Write the performance of data transmission system using eye pattern
technique?

The width of the eye opening defines the interval over which the received wave
can can be sampled without error from inter symbol interference .

The sensitivity of the system to timing error is determined by the rate of closure of the
eye as the sampling time is varied.
17. Define Duobinary baseband PAM system.

Duobinary encoding reduces the maximum frequency of the baseband

signal.The word duo means to double the transmission capacity of the binary system.

Let the PAM signal ak represents kth bit. Then the encoder the new waveform as Ck
=ak + ak-1

Thus two successive bits are added to get encoded value of the kth bit. Hence Ck
becomes a correlated signal even though ak is not correlated. This introduces
intersymbol interference in the controlled manner to reduce the bandwidth.
UNIT-V

1. Compare the probability of Error of PSK with that FSK? (ECE May 2006)

In PSK the probability of error Pe=1/2 erfc (square root (Eb/No)

Where as in FSK Pe=1/2 erfc (square root (Eb/2No)

Comparing these two equations in FSK the bit energy to noise density ratio has to be
doubled to maintain the same bit error as in PSK. So FSK needs double the
bandwidth of PSK. In PSK, the error probability is less whereas in FSK the error
probability is high.

2. Highlight the major difference between a QPSK signal and a MSK signal.
(Nov05)

QPSK is a phase modulation

MSK is frequency modulation

Band width of QPSK is Fb where as MSK is 1.5 Fb

3. What is meant by coherent and non-coherent detection?( May June

2011, 2012)

In coherent detection, the local carrier generated at the receiver is phase locked
with carrier at the transmitter. Hence it is called synchronous detection.

In non-coherent detection, no need to be synchronized. It is simple but it has high

probability of error.

4. What is the error probability of MSK and DPSK?(Apr-May 2005)

For coherent MSK P(e)=1/2 erfc (square root (Eb/No))

For DPSK P(e)=1/2 exp(-Eb/No)

5.Write the expression for bit error rate for Coherent Binary FSK. (Nov-Dec 2004)

1 Eb

For coherent binary FSK Pe 2 erf c 2N 0 or

1 0.6Eb
Pe erf c
2 4N0
6.What are the advantages of BPSK? (CSE Nov 2006)

BPSK has a bandwidth which is lower than of BFSK is the best of all systems in
the presence of noise. It gives the minimum possibility of error and it has very good
noise immunity.

7. What are the drawbacks of binary PSK system? (May June 2012)

The carrier in the receiver is generated by squaring b(t) 2P cos(2f 0 t )

If the received signal is - b(t) 2P cos(2f 0 t ) ,then squared input signal has changed its

sign. Therefore, it is not possible to determine whether the received signal is equal to
b(t) or b(t). This result in ambiguity in output signal.

8. What are Antipodal signals? (IT Nov 2006)

Pair of sinusoidal wave that differs only in a relative phase shift of 180 degrees
is referred as Antipodal signals.

9. What are the advantages and disadvantages of binary FSK signals? ( Dec 2005)
Binary FSK has poorer error performance than PSK or QAM and consequently, is
seldom used for high performance digital radio systems. Its use is restricted to low

performance, low cost, asynchronous data modems that are used for data
communications.

The peak frequency deviation is constant and always at its maximum value.
10. Compare the Bandwidth Efficiency of M-ary PSK signals and M-ary FSK
signals (IT Apr 2003)

The bandwidth efficiency of M-ary PSK signal

is =Rb/B=log2M/2

The bandwidth efficiency of M-ary

=Rb/B=2log2M/M

1 Why is PSK always preferable over ASK in coherent detection?(DEC 2011).

ASK has amplitude variations, hence noise interference is more, PSK method has less
noise interference. It is always preferable.

2 What are the advantages of QPSK as compared to BPSK? (Apr 2005)

Advantages of QPSK are for the same bit error, the bandwidth required by QPSK is
reduced to half as compared to BPSK because of reduced bandwidth, the information
transmission rate of QPSK is higher variation in offset QPSK amplitude is not much.

Hence carrier power almost remains constant.

13.What happens to the probability of error in M-ary FSK as the value of M

increases? (Dec 2004)

The probability of error will remain constant as the value of M increases

Pe1/2(M-1)erfc( E / 2N o

14. What are the advantages of M-ary signaling schemes? (Apr 2004)

The main advantages of M-ary signaling is it increases or improves the spectral

efficiency or bandwidth efficiency.

15. What are the error probabilities of a binary FSK system? ( Dec 2003)

For non-coherent FSK

P(e)=1/2exp(-Eb/2No)

For coherent FSK

P(e)=erfc Eb / No
16. Sketch the waveform representation of ASK, FSK, PSK for a NRZ coded
binary sequence and represent also each case mathematically.
17. Draw the signal constellation of QPSK and give comments on QPSK.(Dec05)

Quaternary phase shift keying or quadrature psk is an other form of angle

modulated constant amplitude digital modulation. QPSK is an M-ary encoding
technique where M is 4. with QPSK four output phases are possible for a single carrier
frequency. Because there are four different output phases there must be four different
input conditions.

18. What are the advantages and disadvantages of differential phase shift
keying? (Nov-Dec 2007)

Advantages:

i.No need to generate the carrier at the receiver end. This means
that complicated circuitry for generation of local carrier is avoided.

ii.The bandwidth required for DPSK is less compared to binary PSK.

Disadvantages:

The probability of error is high compared to binary PSK.

19.Plot the power spectrum of a BPSK signal operated with a carrier frequency of 140
MHz, modulated by data bits at a rate of 2400 bits/sec. What is the bandwidth
requirement? (Apr-May 2008)

fb = 2400 bits/sec = 2400 Hz.

BW = 2fb = 2 x 2400 = 4800 Hz.

20. Give the signal space representation of QPSK. How is the performance of the system
related to the distances between the symbols in the signal space. (Apr-May 2008)

M d 2 k1
1

P
e 2 erfc
k 2 4N 0

Here M is the number of signal points, and dk1 is the distance between s1 and sk

in the signal space.

21. What is signal constellation diagram?(Nov Dec 2008)

Signal constellation refers to a set of possible message points.

22. Define QPSK(Nov - Dec 2009)

As with binary PSK, this modulation scheme is characterized by the fact that the
information carried by the transmitted wave is contained in phase.

In QPSK (Quadriphase Shift Keying), the phase of the carrier takes on one of
3 5 7
the four equally spaced values such as 4 , 4 , 4 and 4 as given by

2
E cos(2 t (2i 0t
S (t) f 1) T.
i c
T 4

0 Else where.

23.A binary frequency shift keying system employs two signaling frequencies f 1 and f2.
The lower frequency f1 is 1200 Hz and signaling rate is 500 Baud. Calculate f 2.

f1 = 1200 Hz.

Signaling rate = 500 Baud, f2 = 1200 + 500 = 1700 Hz.

24.List the advantages of Passband transmission.

1 Long distance.
1 Analog channels can be used for transmission.

c. Multiplexing techniques can be used for bandwidth conservation.

1 Transmission can be done by using wireless channel also.

25.List the requirements of Passband transmission.

i.Maximum data transmission rate.

ii.Minimum probability of symbol error.

iii.Minimum transmitted power.