Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
0% found this document useful (0 votes)
8 views

Dig Comm Notes Unit I, II

 The document provides an outline for the course "ECPC19 Digital Communication" taught by Dr. G. Thavasi Raja.  The course covers various digital communication techniques including baseband transmission, pulse modulation, digital modulation, linear block codes, convolutional codes, spread spectrum techniques, and CDMA.  The recommended textbooks are Communication Systems by Simon Haykin and Digital Communication by John G. Proakis, which provide background on topics like sampling, pulse code modulation, matched filters, error rates, and modulation schemes.

Uploaded by

SAKTHI
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
8 views

Dig Comm Notes Unit I, II

 The document provides an outline for the course "ECPC19 Digital Communication" taught by Dr. G. Thavasi Raja.  The course covers various digital communication techniques including baseband transmission, pulse modulation, digital modulation, linear block codes, convolutional codes, spread spectrum techniques, and CDMA.  The recommended textbooks are Communication Systems by Simon Haykin and Digital Communication by John G. Proakis, which provide background on topics like sampling, pulse code modulation, matched filters, error rates, and modulation schemes.

Uploaded by

SAKTHI
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 271

Course Name: ECPC19 Digital

Communication
By
Dr. G. Thavasi Raja
Associate Professor, ECE, NITT (thavasi@nitt.edu)
Course Outline
 Base band transmission. Pulse Modulation techniques – PAM, PPM, PDM.
Pulse code modulation (PCM), DM, Destination SNR in PCM systems with
noise. Matched filter. Nyquist criterion for zero ISI. Optimum transmit and
receive filters. Correlative Coding, M-ary PAM. Equalization; zero-forcing
and adaptive linear equalizers.

 Digital modulation techniques – Binary ASK, FSK, and PSK. Signal space
diagram. Error probabilities.

 M-ary PSK, FSK, QAM, MSK and GMSK. Optimum detector. Signal
constellation, error probability.

 Linear block codes, Encoding and decoding. Cyclic codes. Convolutional


codes. Viterbi decoding. TCM.

 Spread spectrum (SS) techniques; direct S.S and frequency hop S.S.
Processing gain and jamming margin. CDMA
Course Books
Text:
S. Haykin, Communication Systems (4/e), Wiley,2001. – unit 1 ,2 , 3, 5
J.G. Proakis, Digital Communication (4/e), McGraw – Hill,2001. – unit 4

References:
B. Sklar, Digital Communications: Fundamentals & Applications, Pearson
Education, (2/e), 2001.
A.B. Carlson : Communication Systems, 3/e McGraw Hill.
R.E. Zimer & R.L. Peterson: Introduction to Digital Communication, PHI, 2001.
Communication

 Main purpose of communication is to transfer information


from a source to a recipient via a channel or medium.

 Basic block diagram of a communication system:

Source Transmitter Channel Receiver

Recipient
Brief Description

 Source: analog or digital

 Transmitter: transducer, amplifier, modulator, oscillator, power


amp., antenna

 Channel: e.g. cable, optical fibre, free space

 Receiver: antenna, amplifier, demodulator, oscillator, power


amplifier, transducer

 Recipient: e.g. person, (loud) speaker, computer


 Types of information
Voice, data, video, music, email etc.

 Types of communication systems


Public Switched Telephone Network (voice,fax,modem)
Satellite systems
Radio,TV broadcasting
Cellular phones
Computer networks (LANs, WANs, WLANs)
Information Representation
 Communication system converts information into electrical
electromagnetic/optical signals appropriate for the transmission
medium.
 Analog systems convert analog message into signals that can
propagate through the channel.

 Digital systems convert bits(digits, symbols) into signals

 Computers naturally generate information as characters/bits


 Most information can be converted into bits
 Analog signals converted to bits by sampling and quantizing
(A/D conversion)
Why Digital?
 Digital techniques need to distinguish between discrete symbols
allowing regeneration versus amplification

 Good processing techniques are available for digital signals, such


as medium.
 Data compression (or source coding)
 Error Correction (or channel coding)(A/D conversion)
 Equalization
 Security

 Easy to mix signals and data using digital techniques


 Basic Digital Communication Transformations
 Formatting/Source Coding
 Transforms source info into digital symbols (digitization)
 Selects compatible waveforms (matching function)
 Introduces redundancy which facilitates accurate decoding
despite errors
 It is essential for reliable communication
 Modulation/Demodulation
 Modulation is the process of modifying the info signal to
facilitate transmission
 Demodulation reverses the process of modulation. It
involves the detection and retrieval of the info signal
 Types
 Coherent: Requires a reference info for detection
 Noncoherent: Does not require reference phase information
Basic Digital Communication Transformations
 Coding/Decoding
Translating info bits to transmitter data symbols
Techniques used to enhance info signal so that they are
less vulnerable to channel impairment (e.g. noise, fading,
jamming, interference)
 Two Categories
 Waveform Coding - Produces new waveforms with better
performance
 Structured Sequences - Involves the use of redundant bits to
determine the occurrence of error (and sometimes correct it)
 Multiplexing/Multiple Access Is synonymous with
resource sharing with other users
Performance Metrics

 Analog Communication Systems


 Metric is fidelity: want mˆ (t )  m(t )
 SNR typically used as performance metric

 Digital Communication Systems


 Metrics are data rate (R bps) and probability of bit error
 P  p( bˆ  b)
b
 Symbols already known at the receiver
 Without noise/distortion/sync. problem, we will never
make bit errors
Main Points
 Transmitters modulate analog messages or bits in case of a DCS
for transmission over a channel.
 Receivers recreate signals or bits from received signal (mitigate
channel effects)
 Performance metric for analog systems is fidelity, for digital it is
the bit rate and error probability.
Why Digital Communications?
 Easy to regenerate the distorted signal
 Regenerative repeaters along the transmission path can
detect a digital signal and retransmit a new, clean (noise
free) signal
 These repeaters prevent accumulation of noise along the
path
 This is not possible with analog communication
systems
 Two-state signal representation
 The input to a digital system is in the form of a
sequence of bits (binary or M_ary)
 Immunity to distortion and interference
 Digital communication is rugged in the sense that it is more
immune to channel noise and distortion
Why Digital Communications?
 Hardware is more flexible
 Digital hardware implementation is flexible and
permits the use of microprocessors, mini-processors,
digital switching and VLSI
 Shorter design and production cycle
 Low cost

 The use of LSI and VLSI in the design of components


and systems have resulted in lower cost
 Easier and more efficient to multiplex several digital
signals
 Digital multiplexing techniques – Time & Code Division
Multiple Access - are easier to implement than analog
techniques such as Frequency Division Multiple
Access
Why Digital Communications?
 Can combine different signal types – data, voice, text, etc.

 Data communication in computers is digital in nature whereas


voice communication between people is analog in nature

 The two types of communication are difficult to combine over the


same medium in the analog domain.

 Using digital techniques, it is possible to combine both format for


transmission through a common medium

 Encryption and privacy techniques are easier to implement


 Better overall performance

 Digital communication is inherently more efficient than analog in


realizing the exchange of SNR for bandwidth
 Digital signals can be coded to yield extremely low rates and high
fidelity as well as privacy
Why Digital Communications?
Disadvantages
 Requires reliable “synchronization”
 Requires A/D conversions at high rate
 Requires larger bandwidth
 Performance Criteria
 Probability of error or Bit Error Rate
Goals in Communication System Design

 To maximize transmission rate, R


 To maximize system utilization, U
 To minimize bit error rate, Pe
 To minimize required systems bandwidth, W
 To minimize system complexity, Cx
 To minimize required power, Eb/No
ECPC19 Digital Communication
Sampling

[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]


Sampling

[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]


Sampling
Sampling

Note:

[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]


[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]
Reconstruction:
Sampling Theorem (Used at Tx’ & Rx’)

Aliasing Effect

[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]


Aliasing Effect

[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]


To combat Aliasing Effect:
Reconstruction Filter:
Pulse Amplitude Modulation
Pulse-time modulations

[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]


Trade-off (Noise b/w BW)

[PPM Vs FM]
Qunatizer

[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]


[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]
Types of Qunatization

[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]


Quantization process & Noise

[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]


Quantizer g(.) maps the input random variable ‘M’ of continuous amplitude into a
discrete random variable ‘V’

Qunatization error denoted by RV Q and sample value q.


[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]
[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]
Pulse Code Modulation
Non-uniform Quantization
Line Codes
Delta Modulation
[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]
Matched Filter
Problem statement

[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]


[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]
Error Rate Due to Noise
[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]
[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]
[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]
[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]
[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]
Intersymbol Interference (ISI)
[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]
[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]
Nyquist’s Criterion for Distortionless
Transmission
[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]
[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]
[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]
[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]
[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]
[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]
Signal-space Analysis

[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]


Geometric Representation of Signals

si=
Geometric Representation of Signals
s1
ϕ1
0 2
Gram-Schmidt Orthogonalisation
????
Signal-space Analysis

[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]


Geometric Representation of Signals
Geometric Representation of Signals
Si(t) + w(t) =
x(t)
[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]
Gram-Schmidt Orthogonalisation
????
Statistical Characterisation
[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]
Detection Problem:
[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]
[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]
[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]
Passband Transmission Model
Φj(t)

si=[sij]

w(t)
Coherent Binary Amplitude Shift
Keying (BASK)

s2(t) = 0

[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]


[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]
[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]
s1=
Si=[sij]

i=1,2
j=1 s2 =

x(t) = si(t)+w(t)
W(t)

[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]


Pe=p0 P10 + p1P01

[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]


[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]
[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]
Binary Frequency Shift Keying
(BFSK)

[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]


[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]
[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]
[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]
[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]
[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]
[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]
QPSK
si=[sij]
E=Eb log2M
Cos(2pi/M (i-1))
Sin(2pi/M (i-1))
M=8
[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]
[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]
Minimum Shift Keying (MSK)

[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]


Phase Trellis
[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]
[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]
[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]
[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]
[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]
[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]
[Courtesy: Communication systems by Simon Haykin, 4e John Wiley]

You might also like