Scribd
Upload
376 views

Data Communications and Networking

This document contains a chapter summary for a digital communications and networking textbook. It provides examples and explanations of key concepts related to digital transmission, including different line coding schemes, block coding, scrambling, PCM, DM, parallel vs serial transmission, and example problems calculating signal rates, bandwidth, and energy values for different coding schemes. The chapter questions and problems are also included for a student to review.

Uploaded by

Oscar Rodriguez
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
376 views

Data Communications and Networking

This document contains a chapter summary for a digital communications and networking textbook. It provides examples and explanations of key concepts related to digital transmission, including different line coding schemes, block coding, scrambling, PCM, DM, parallel vs serial transmission, and example problems calculating signal rates, bandwidth, and energy values for different coding schemes. The chapter questions and problems are also included for a student to review.

Uploaded by

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

UNIVERSIDAD DE LAS FUERZAS ARMADAS ESPE

INGENIERIA ELECTRONICA E INSTRUMENTACION


FUNDAMENTOS DE REDES DE DATOS

NOMBRES: Alex Aguirre, Efraín Alcoser, Danny Anasi


FECHA: 28/11/2017

DATA COMMUNICATIONS AND


NETWORKING
BEHROUZ A. FOROUZAN
Fith Edition

CHAPTER 4 DIGITAL TRANSMISSION

Ing. Cesar Naranjo Latacunga-Ecuador


QUESTIONS
Q4-1. List three techniques of digital-to-digital conversion.
The three different techniques described in this chapter are line coding, block coding,
and scrambling.
Q4-2. Distinguish between a signal element and a data element.
A data element is the smallest entity that can represent a piece of information (a bit). A
signal element is the shortest unit of a digital signal. Data elements are what we need to
send; signal elements are what we can send. Data elements are being carried; signal
elements are the carriers.
Q4-3. Distinguish between data rate and signal rate.
The data rate defines the number of data elements (bits) sent in 1s. The unit is bits per
second (bps). The signal rate is the number of signal elements sent in 1s. The unit is the
baud.
Q4-4. Define baseline wandering and its effect on digital transmission.
In decoding a digital signal, the incoming signal power is evaluated against the baseline
(a running average of the received signal power). A long string of 0s or 1s can cause
baseline wandering (a drift in the baseline) and make it difficult for the receiver to decode
correctly.
Q4-5. Define a DC component and its effect on digital transmission.
When the voltage level in a digital signal is constant for a while, the spectrum creates
very low frequencies, called DC components that present problems for a system that
cannot pass low frequencies.
Q4-6. Define the characteristics of a self-synchronizing signal.
A self-synchronizing digital signal includes timing information in the data being
transmitted. This can be achieved if there are transitions in the signal that alert the receiver
to the beginning, middle, or end of the pulse.
Q4-7. List five line coding schemes discussed in this book.
In this chapter, we introduced unipolar, polar, bipolar, multilevel, and multitransition
coding.
Q4-8. Define block coding and give its purpose.
Block coding provides redundancy to ensure synchronization and to provide inherent
error detecting. In general, block coding changes a block of m bits into a block of n bits,
where n is larger than m.
Q4-9. Define scrambling and give its purpose.
Scrambling, as discussed in this chapter, is a technique that substitutes long zerolevel
pulses with a combination of other levels without increasing the number of bits.
Q4-10. Compare and contrast PCM and DM.
Both PCM and DM use sampling to convert an analog signal to a digital signal. PCM
finds the value of the signal amplitude for each sample; DM finds the change between
two consecutive samples.
Q4-11. What are the differences between parallel and serial transmission?
In parallel transmission we send data several bits at a time. In serial transmission we send
data one bit at a time.
Q4-12. List three different techniques in serial transmission and explain the differences.
We mentioned synchronous, asynchronous, and isochronous. In both synchronous and
asynchronous transmissions, a bit stream is divided into independent frames. In
synchronous transmission, the bytes inside each frame are synchronized; in asynchronous
transmission, the bytes inside each frame are also independent. In isochronous
transmission, there is no independency at all. All bits in the whole stream must be
synchronized.

PROBLEMS
4-1. Calculate the value of the signal rate for each case in Figure 4.2 if
the data rate is 1 Mbps and c = 1/2.
We use the formula s = c × N × (1/r) for each case. We let c = 1/2.
r = 1 → s = (1/2) × (1 Mbps) × 1/1 = 500 kbaud
r = 1/2 → s = (1/2) × (1 Mbps) × 1/(1/2) = 1 Mbaud
r = 2 → s = (1/2) × (1 Mbps) × 1/2 = 250 Kbaud
r = 4/3 → s = (1/2) × (1 Mbps) × 1/(4/3) = 375 Kbaud

4-2. In a digital transmission, the sender clock is 0.2 percent faster than
the receiver clock. How many extra bits per second does the sender send
if the data rate is 1 Mbps?
The number of bits is calculated as (0.2 /100) × (1 Mbps) = 2000 bits

4-3. Draw the graph of the NRZ-L scheme using each of the following data
streams, assuming that the last signal level has been positive. From the graphs,
guess the bandwidth for this scheme using the average number of changes in the
signal level. Compare your guess with the corresponding entry in Table 4.1.

a. 00000000 b. 11111111 c. 01010101 d. 00110011


See Figure 4.1. Bandwidth is proportional to (3/8)N which is within the range in
Table 4.1 (B = 0 to N) for the NRZ-L scheme.
4-4. Repeat Problem P4-3 for the NRZ-I scheme.
See Figure 4.2. Bandwidth is proportional to (4.25/8)N which is within the range
in Table 4.1 (B = 0 to N) for the NRZ-I scheme.

4-5. Repeat Problem P4-3 for the Manchester scheme.


See Figure 4.3. Bandwidth is proportional to (12.5 / 8) N which is within the range
in Table 4.1 (B = N to B = 2N) for the Manchester scheme.

4-6. Repeat Problem P4-3 for the differential Manchester scheme.


See Figure 4.4. B is proportional to (12/8) N which is within the range in Table 4.1
(B = N to 2N) for the differential Manchester scheme.
4-7. Repeat Problem P4-3 for the 2B1Q scheme, but use the following
data streams.

a. 0000000000000000
b. 1111111111111111
c. 0101010101010101
d. 0011001100110011

See Figure 4.5. B is proportional to (5.25 / 16) N which is inside range in Table 4.1
(B = 0 to N/2) for 2B/1Q.

4-8. Repeat Problem P4-3 for the MLT-3 scheme, but use the following
data streams.
a. 00000000 b. 11111111 c. 01010101 d. 00011000

See Figure 4.6. B is proportional to (5.25/8) × N which is inside the range in Table
4.1 (B = 0 to N/2) for MLT-3.
4-9. Find the 8-bit data stream for each case depicted in Figure 4.36.

NRZ-I: 10011001.
Differential Manchester: 11000100.
AMI: 01110001

4-10. An NRZ-I signal has a data rate of 100 Kbps. Using Figure 4.6,
calculate the value of the normalized energy (P) for frequencies at 0 Hz,
50 KHz, and 100 KHz.

The data rate is 100 Kbps. For each case, we first need to calculate the value f / N.
We then use Figure 4.6 in the text to find P (energy per Hz). All calculations are
approximations.

f /N = 0/100 = 0 → P = 1.0
f /N = 50/100 = 1/2 → P = 0.5
f /N = 100/100 = 1 → P = 0.0
f /N = 150/100 = 1.5 → P = 0.2

You might also like