Scribd
Upload
5 views12 pages

Lecture 3

Uploaded by

eashelfarooq12
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
5 views12 pages

Lecture 3

Uploaded by

eashelfarooq12
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 12

Digital To Digital Conversion

In this section, we see how we can


represent digital data by using digital
signals
The conversion involves three techniques:
line coding, block coding, and scrambling
 Line coding is always needed
 Block coding and Scrambling may or may
not be needed

4.1
Figure 4.1 Line coding and decoding

4.2
igure 4.2 Signal element versus data element

4.3
Data rate and Baud rate
The baud or signal rate can be expressed
as:
S = c x N x 1/r bauds
where N is data rate
c is the case factor (worst, best & avg.)
r is the ratio between data element & signal
element

4.4
Note

Although the actual bandwidth of a


digital signal is infinite, the effective
bandwidth is finite

4.5
Figure 4.3 Effect of lack of synchronization

4.6
Example 4.3

In a digital transmission, the receiver clock is


0.1 percent faster than the sender clock. How
many extra bits per second does the receiver
receive if the data rate is
1 kbps? How many if the data rate is 1 Mbps?
Solution
At 1 kbps, the receiver receives 1001
bps instead of 1000 bps.

At 1 Mbps, the receiver receives 1,001,000


bps instead of 1,000,000 bps

4.7
Line encoding C/Cs
Noise and interference - there are line
encoding techniques that make the
transmitted signal “immune” to noise and
interference
This means that the signal cannot be
corrupted, it is stronger than error
detection.

4.8
Line encoding C/Cs
Complexity - the more robust and
resilient the code, the more complex it is to
implement and the price is often paid in
baud rate or required bandwidth

4.9
Figure 4.4 Line coding schemes

4.10
Unipolar
All signal levels are on one side of the
time axis -either above or below
NRZ - Non Return to Zero scheme is an
example of this code
The signal level does not return to zero
during a symbol transmission
 Scheme is prone to baseline wandering and
DC components
 It has no synchronization or any error
detection
 It is simple but costly in power consumption.

4.11
Figure 4.5 Unipolar NRZ scheme

4.12

You might also like