1. Chapter 3,4 & 6 1-TRANSMISSION IMPAIRMENT 2-DATA TRANSMISSION & MODES
3-BANDWIDTH UTILIZATION

2. Topics discussed in this section:
3-4 TRANSMISSION IMPAIRMENT
Signals travel through transmission media, which are not perfect. The imperfection causes signal impairment. This means that the signal at the beginning of the medium is not the same as the signal at the end of the medium. What is sent is not what is received. Three causes of impairment are attenuation, distortion, and noise.
Topics discussed in this section:
Attenuation Distortion Noise

3. Figure 3.25 Causes of impairment

4. Figure Attenuation

5. Example 3.26
Suppose a signal travels through a transmission medium and its power is reduced to one-half. This means that P2 is (1/2)P1. In this case, the attenuation (loss of power) can be calculated as
A loss of 3 dB (–3 dB) is equivalent to losing one-half the power.

6. Example 3.27
A signal travels through an amplifier, and its power is increased 10 times. This means that P2 = 10P1 . In this case, the amplification (gain of power) can be calculated as

7. Example 3.28
One reason that engineers use the decibel to measure the changes in the strength of a signal is that decibel numbers can be added (or subtracted) when we are measuring several points (cascading) instead of just two. In Figure 3.27 a signal travels from point 1 to point 4. In this case, the decibel value can be calculated as

8. Figure 3.27 Decibels for Example 3.28

9. Example 3.29
Sometimes the decibel is used to measure signal power in milliwatts. In this case, it is referred to as dBm and is calculated as dBm = 10 log10 Pm , where Pm is the power in milliwatts. Calculate the power of a signal with dBm = −30.
Solution
We can calculate the power in the signal as

10. Example 3.30
The loss in a cable is usually defined in decibels per kilometer (dB/km). If the signal at the beginning of a cable with −0.3 dB/km has a power of 2 mW, what is the power of the signal at 5 km?
Solution
The loss in the cable in decibels is 5 × (−0.3) = −1.5 dB. We can calculate the power as

11. Figure Distortion

12. Figure Noise

13. Example 3.31
The power of a signal is 10 mW and the power of the noise is 1 μW; what are the values of SNR and SNRdB ?
Solution
The values of SNR and SNRdB can be calculated as follows:

14. Example 3.32 The values of SNR and SNRdB for a noiseless channel are
We can never achieve this ratio in real life; it is an ideal.

15. Figure 3.30 Two cases of SNR: a high SNR and a low SNR

16. Note
Increasing the levels of a signal may reduce the reliability of the system.

17. Topics discussed in this section:
3-5 DATA RATE LIMITS
A very important consideration in data communications is how fast we can send data, in bits per second, over a channel. Data rate depends on three factors:
1. The bandwidth available
2. The level of the signals we use
3. The quality of the channel (the level of noise)
Topics discussed in this section:
Noiseless Channel: Nyquist Bit Rate Noisy Channel: Shannon Capacity Using Both Limits

18. Example 3.34
Consider a noiseless channel with a bandwidth of 3000 Hz transmitting a signal with two signal levels. The maximum bit rate can be calculated as

19. Example 3.35
Consider the same noiseless channel transmitting a signal with four signal levels (for each level, we send 2 bits). The maximum bit rate can be calculated as

20. Example 3.36
We need to send 265 kbps over a noiseless channel with a bandwidth of 20 kHz. How many signal levels do we need?
Solution
We can use the Nyquist formula as shown:
Since this result is not a power of 2, we need to either increase the number of levels or reduce the bit rate. If we have 128 levels, the bit rate is 280 kbps. If we have 64 levels, the bit rate is 240 kbps.

21. Example 3.37
Consider an extremely noisy channel in which the value of the signal-to-noise ratio is almost zero. In other words, the noise is so strong that the signal is faint. For this channel the capacity C is calculated as
This means that the capacity of this channel is zero regardless of the bandwidth. In other words, we cannot receive any data through this channel.

22. Example 3.38
We can calculate the theoretical highest bit rate of a regular telephone line. A telephone line normally has a bandwidth of The signal-to-noise ratio is usually For this channel the capacity is calculated as
This means that the highest bit rate for a telephone line is kbps. If we want to send data faster than this, we can either increase the bandwidth of the line or improve the signal-to-noise ratio.

23. Example 3.39
The signal-to-noise ratio is often given in decibels. Assume that SNRdB = 36 and the channel bandwidth is 2 MHz. The theoretical channel capacity can be calculated as

24. Example 3.40
For practical purposes, when the SNR is very high, we can assume that SNR + 1 is almost the same as SNR. In these cases, the theoretical channel capacity can be simplified to
For example, we can calculate the theoretical capacity of the previous example as

25. Example 3.41
We have a channel with a 1-MHz bandwidth. The SNR for this channel is 63. What are the appropriate bit rate and signal level?
Solution
First, we use the Shannon formula to find the upper limit.

26. Example 3.41 (continued)
The Shannon formula gives us 6 Mbps, the upper limit. For better performance we choose something lower, 4 Mbps, for example. Then we use the Nyquist formula to find the number of signal levels.

27. Note
The Shannon capacity gives us the upper limit; the Nyquist formula tells us how many signal levels we need.

28. Topics discussed in this section:
3-6 PERFORMANCE
One important issue in networking is the performance of the network—how good is it? We discuss quality of service, an overall measurement of network performance, in greater detail in Chapter 24. In this section, we introduce terms that we need for future chapters.
Topics discussed in this section:
Bandwidth Throughput Latency (Delay)
Bandwidth-Delay Product

29. In networking, we use the term bandwidth in two contexts.
Note
In networking, we use the term bandwidth in two contexts.
❏ The first, bandwidth in hertz, refers to the range of frequencies in a composite signal or the range of frequencies that a channel can pass.
❏ The second, bandwidth in bits per second, refers to the speed of bit transmission in a channel or link.

30. Example 3.42
The bandwidth of a subscriber line is 4 kHz for voice or data. The bandwidth of this line for data transmission
can be up to 56,000 bps using a sophisticated modem to change the digital signal to analog.

31. Example 3.43
If the telephone company improves the quality of the line and increases the bandwidth to 8 kHz, we can send 112,000 bps by using the same technology as mentioned in Example 3.42.

32. Example 3.44
A network with bandwidth of 10 Mbps can pass only an average of 12,000 frames per minute with each frame carrying an average of 10,000 bits. What is the throughput of this network?
Solution
We can calculate the throughput as
The throughput is almost one-fifth of the bandwidth in this case.

33. Example 3.45
What is the propagation time if the distance between the two points is 12,000 km? Assume the propagation speed to be 2.4 × 108 m/s in cable.
Solution
We can calculate the propagation time as
The example shows that a bit can go over the Atlantic Ocean in only 50 ms if there is a direct cable between the source and the destination.

34. Example 3.46
What are the propagation time and the transmission time for a 2.5-kbyte message (an ) if the bandwidth of the network is 1 Gbps? Assume that the distance between the sender and the receiver is 12,000 km and that light travels at 2.4 × 108 m/s.
Solution
We can calculate the propagation and transmission time as shown on the next slide:

35. Example 3.46 (continued)
Note that in this case, because the message is short and the bandwidth is high, the dominant factor is the propagation time, not the transmission time. The transmission time can be ignored.

36. Example 3.47
What are the propagation time and the transmission time for a 5-Mbyte message (an image) if the bandwidth of the network is 1 Mbps? Assume that the distance between the sender and the receiver is 12,000 km and that light travels at 2.4 × 108 m/s.
Solution
We can calculate the propagation and transmission times as shown on the next slide.

37. Example 3.47 (continued)
Note that in this case, because the message is very long and the bandwidth is not very high, the dominant factor is the transmission time, not the propagation time. The propagation time can be ignored.

38. Figure 3.31 Filling the link with bits for case 1

39. Example 3.48
We can think about the link between two points as a pipe. The cross section of the pipe represents the bandwidth, and the length of the pipe represents the delay. We can say the volume of the pipe defines the bandwidth-delay product, as shown in Figure 3.33.

40. Figure 3.32 Filling the link with bits in case 2
5 bps
25 bps

41. Note
The bandwidth-delay product defines the number of bits that can fill the link.

42. Figure 3.33 Concept of bandwidth-delay product

43. Topics discussed in this section:
4-3 TRANSMISSION MODES
The transmission of binary data across a link can be accomplished in either parallel or serial mode. In parallel mode, multiple bits are sent with each clock tick. In serial mode, 1 bit is sent with each clock tick. While there is only one way to send parallel data, there are three subclasses of serial transmission: asynchronous, synchronous, and isochronous.
Topics discussed in this section:
Parallel Transmission Serial Transmission

44. Figure 4.31 Data transmission and modes

45. Figure 4.32 Parallel transmission

46. Figure 4.33 Serial transmission

47. Note
In asynchronous transmission, we send 1 start bit (0) at the beginning and 1 or more stop bits (1s) at the end of each byte. There may be a gap between each byte.

48. Asynchronous here means “asynchronous at the byte level,”
Note
Asynchronous here means “asynchronous at the byte level,”
but the bits are still synchronized; their durations are the same.

49. Figure 4.34 Asynchronous transmission

50. Note
In synchronous transmission, we send bits one after another without start or stop bits or gaps. It is the responsibility of the receiver to group the bits.

51. Figure 4.35 Synchronous transmission

52. Bandwidth Utilization: Multiplexing and Spreading
Chapter 6
Bandwidth Utilization:
Multiplexing and Spreading
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.

53. Note
Bandwidth utilization is the wise use of available bandwidth to achieve specific goals.
Efficiency can be achieved by multiplexing; privacy and anti-jamming can be achieved by spreading.

54. Topics discussed in this section:
6-1 MULTIPLEXING
Whenever the bandwidth of a medium linking two devices is greater than the bandwidth needs of the devices, the link can be shared. Multiplexing is the set of techniques that allows the simultaneous transmission of multiple signals across a single data link. As data and telecommunications use increases, so does traffic.
Topics discussed in this section:
Frequency-Division Multiplexing Wavelength-Division Multiplexing Synchronous Time-Division Multiplexing
Statistical Time-Division Multiplexing

55. Figure 6.1 Dividing a link into channels

56. Figure 6.2 Categories of multiplexing

57. Figure 6.3 Frequency-division multiplexing

58. FDM is an analog multiplexing technique that combines analog signals.
Note
FDM is an analog multiplexing technique that combines analog signals.

59. Figure 6.4 FDM process

60. Figure 6.5 FDM demultiplexing example

61. Example 6.1
Assume that a voice channel occupies a bandwidth of 4 kHz. We need to combine three voice channels into a link with a bandwidth of 12 kHz, from 20 to 32 kHz. Show the configuration, using the frequency domain. Assume there are no guard bands.
Solution
We shift (modulate) each of the three voice channels to a different bandwidth, as shown in Figure 6.6. We use the 20- to 24-kHz bandwidth for the first channel, the 24- to 28-kHz bandwidth for the second channel, and the 28- to 32-kHz bandwidth for the third one. Then we combine them as shown in Figure 6.6.

62. Figure 6.6 Example 6.1

63. Example 6.2
Five channels, each with a 100-kHz bandwidth, are to be multiplexed together. What is the minimum bandwidth of the link if there is a need for a guard band of 10 kHz between the channels to prevent interference?
Solution
For five channels, we need at least four guard bands. This means that the required bandwidth is at least
5 × × 10 = 540 kHz,
as shown in Figure 6.7.

64. Figure 6.7 Example 6.2

65. Example 6.3
Four data channels (digital), each transmitting at 1 Mbps, use a satellite channel of 1 MHz. Design an appropriate configuration, using FDM.
Solution
The satellite channel is analog. We divide it into four channels, each channel having a 250-kHz bandwidth. Each digital channel of 1 Mbps is modulated such that each 4 bits is modulated to 1 Hz. One solution is 16-QAM modulation. Figure 6.8 shows one possible configuration.

66. Figure 6.8 Example 6.3

67. Figure 6.9 Analog hierarchy

68. Example 6.4
The Advanced Mobile Phone System (AMPS) uses two bands. The first band of 824 to 849 MHz is used for sending, and 869 to 894 MHz is used for receiving. Each user has a bandwidth of 30 kHz in each direction. How many people can use their cellular phones simultaneously?
Solution
Each band is 25 MHz. If we divide 25 MHz by 30 kHz, we get In reality, the band is divided into 832 channels. Of these, 42 channels are used for control, which means only 790 channels are available for cellular phone users.

69. Figure 6.10 Wavelength-division multiplexing

70. WDM is an analog multiplexing technique to combine optical signals.
Note
WDM is an analog multiplexing technique to combine optical signals.

71. Figure 6.11 Prisms in wavelength-division multiplexing and demultiplexing

72. Figure TDM

73. Note
TDM is a digital multiplexing technique for combining several low-rate channels into one high-rate one.

74. Figure 6.13 Synchronous time-division multiplexing

75. Note
In synchronous TDM, the data rate of the link is n times faster, and the unit duration is n times shorter.

76. Example 6.5
In Figure 6.13, the data rate for each input connection is 3 kbps. If 1 bit at a time is multiplexed (a unit is 1 bit), what is the duration of (a) each input slot, (b) each output slot, and (c) each frame?
Solution
We can answer the questions as follows:
a. The data rate of each input connection is 1 kbps. This means that the bit duration is 1/1000 s or 1 ms. The duration of the input time slot is 1 ms (same as bit duration).

77. Example 6.5 (continued)
b. The duration of each output time slot is one-third of the input time slot. This means that the duration of the output time slot is 1/3 ms.
c. Each frame carries three output time slots. So the duration of a frame is 3 × 1/3 ms, or 1 ms. The duration of a frame is the same as the duration of an input unit.

78. Example 6.6
Figure 6.14 shows synchronous TDM with a data stream for each input and one data stream for the output. The unit of data is 1 bit. Find (a) the input bit duration, (b) the output bit duration, (c) the output bit rate, and (d) the output frame rate.
Solution
We can answer the questions as follows:
a. The input bit duration is the inverse of the bit rate: 1/1 Mbps = 1 μs.
b. The output bit duration is one-fourth of the input bit duration, or ¼ μs.

79. Example 6.6 (continued)
c. The output bit rate is the inverse of the output bit duration or 1/(4μs) or 4 Mbps. This can also be deduced from the fact that the output rate is 4 times as fast as any input rate; so the output rate = 4 × 1 Mbps = 4 Mbps.
d. The frame rate is always the same as any input rate. So the frame rate is 1,000,000 frames per second. Because we are sending 4 bits in each frame, we can verify the result of the previous question by multiplying the frame rate by the number of bits per frame.

80. Figure Example 6.6

81. Example 6.7
Four 1-kbps connections are multiplexed together. A unit is 1 bit. Find (a) the duration of 1 bit before multiplexing, (b) the transmission rate of the link, (c) the duration of a time slot, and (d) the duration of a frame.
Solution
We can answer the questions as follows:
a. The duration of 1 bit before multiplexing is 1 / 1 kbps, or s (1 ms).
b. The rate of the link is 4 times the rate of a connection, or 4 kbps.

82. Example 6.7 (continued)
c. The duration of each time slot is one-fourth of the duration of each bit before multiplexing, or 1/4 ms or 250 μs. Note that we can also calculate this from the data rate of the link, 4 kbps. The bit duration is the inverse of the data rate, or 1/4 kbps or 250 μs.
d. The duration of a frame is always the same as the duration of a unit before multiplexing, or 1 ms. We can also calculate this in another way. Each frame in this case has four time slots. So the duration of a frame is 4 times 250 μs, or 1 ms.

83. Figure Interleaving

84. Example 6.8
Four channels are multiplexed using TDM. If each channel sends 100 bytes /s and we multiplex 1 byte per channel, show the frame traveling on the link, the size of the frame, the duration of a frame, the frame rate, and the bit rate for the link.
Solution
The multiplexer is shown in Figure Each frame carries 1 byte from each channel; the size of each frame, therefore, is 4 bytes, or 32 bits. Because each channel is sending 100 bytes/s and a frame carries 1 byte from each channel, the frame rate must be 100 frames per second. The bit rate is 100 × 32, or 3200 bps.

85. Figure Example 6.8

86. Example 6.9
A multiplexer combines four 100-kbps channels using a time slot of 2 bits. Show the output with four arbitrary inputs. What is the frame rate? What is the frame duration? What is the bit rate? What is the bit duration?
Solution
Figure 6.17 shows the output for four arbitrary inputs. The link carries 50,000 frames per second. The frame duration is therefore 1/50,000 s or 20 μs. The frame rate is 50,000 frames per second, and each frame carries 8 bits; the bit rate is 50,000 × 8 = 400,000 bits or 400 kbps. The bit duration is 1/400,000 s, or 2.5 μs.

87. Figure Example 6.9

88. Figure Empty slots

89. Figure 6.19 Multilevel multiplexing

90. Figure 6.20 Multiple-slot multiplexing

91. Figure Pulse stuffing

92. Figure Framing bits

93. Example 6.10
We have four sources, each creating 250 characters per second. If the interleaved unit is a character and 1 synchronizing bit is added to each frame, find (a) the data rate of each source, (b) the duration of each character in each source, (c) the frame rate, (d) the duration of each frame, (e) the number of bits in each frame, and (f) the data rate of the link.
Solution
We can answer the questions as follows:
a. The data rate of each source is 250 × 8 = 2000 bps = 2 kbps.

94. Example 6.10 (continued)
b. Each source sends 250 characters per second; therefore, the duration of a character is 1/250 s, or 4 ms.
c. Each frame has one character from each source, which means the link needs to send 250 frames per second to keep the transmission rate of each source.
d. The duration of each frame is 1/250 s, or 4 ms. Note that the duration of each frame is the same as the duration of each character coming from each source.
e. Each frame carries 4 characters and 1 extra synchronizing bit. This means that each frame is 4 × = 33 bits.

95. Example 6.11
Two channels, one with a bit rate of 100 kbps and another with a bit rate of 200 kbps, are to be multiplexed. How this can be achieved? What is the frame rate? What is the frame duration? What is the bit rate of the link?
Solution
We can allocate one slot to the first channel and two slots to the second channel. Each frame carries 3 bits. The frame rate is 100,000 frames per second because it carries 1 bit from the first channel. The bit rate is 100,000 frames/s × 3 bits per frame, or 300 kbps.

96. Figure 6.23 Digital hierarchy

97. Table 6.1 DS and T line rates

98. Figure 6.24 T-1 line for multiplexing telephone lines

99. Figure 6.25 T-1 frame structure

100. Table 6.2 E line rates

101. Figure 6.26 TDM slot comparison

102. Topics discussed in this section:
6-1 SPREAD SPECTRUM
In spread spectrum (SS), we combine signals from different sources to fit into a larger bandwidth, but our goals are to prevent eavesdropping and jamming. To achieve these goals, spread spectrum techniques add redundancy.
Topics discussed in this section:
Frequency Hopping Spread Spectrum (FHSS) Direct Sequence Spread Spectrum Synchronous (DSSS)

103. Figure 6.27 Spread spectrum

104. Figure 6.28 Frequency hopping spread spectrum (FHSS)

105. Figure 6.29 Frequency selection in FHSS

106. Figure FHSS cycles

107. Figure 6.31 Bandwidth sharing

108. Figure DSSS

109. Figure DSSS example