Module-1

Introduction to Data Communication, Network Models,

Physical Layer-1 and Digital Transmission

1-1
Course Outcomes:
The students will be able to:
CO1-Explain the fundamentals of data communication and apply the techniques to solve the
given problem of frequency, signals, capacity of the channel and compute the performance of
networks based on the metrics specified.

CO2- Explore Access control mechanisms and Examine the relationship between bandwidth
utilization, reliability and error control using appropriate techniques.

CO3- Discuss the working of routers, Internet protocol and Analyze unicast broadcast and
multicasts protocols and design the new algorithm for the given problem.

CO4-Analyze the various services offered by the transport layer and investigate the reliability,
flow control and congestion control techniques for the given problems.

CO5-Identify the principles used in design of the application, discuss the application layer
protocols and different techniques to improve the application performance and justify
solution / architecture for the given case study /problems.

CO6-Investigate the given problem using the relevant modern tool and interpret the data ,
compose the report based on literature survey, results obtained and demonstrate integrity
1-2of
the
 Introduction

1. Data communications
2. Networks
3. The Internet
4. Protocols and standards

1-3
 Data Communications
Sharing of information
 Local: Between individual ,face to face
 Remote: Takes place over distance
Telecommunication-(tele far): communication at distance

• Data
 Information presented in whatever form is agreed upon by the
parties creating and using the data

• Data communication
 Exchange of data between two devices
 Via some form of transmission medium

1-4
 Fundamental characteristics
Delivery: Data must be correctly delivered, must be
received correctly by intended party.
Accuracy: System must deliver the data accurately
 Data that have been altered in transmission and Uncorrected
data are unusable
Timeliness: System must deliver the data in a timely
manner.
 Late delivered data are useless
 Video and audio data must be delivered in real-time.
Jitter: It is the variation in the packet arrival time
1-5
 Five Components of Data Communication
• Message
• Sender
• Receiver
• Transmission medium
• Protocol

1-6
Message: Information to be communicated
 Text, number, pictures, audio, video
Sender: The device that sends the data message.
 Computer, workstation, telephone handset, video camera.
Receiver: The device that receives the message from sender.
 Computer, workstation, telephone handset, television.
Transmission medium: It is the physical path by which a
message travels from sender to receiver.
 Twisted pair, coaxial cable, fiber optic cable ,radio waves.
Protocol: It is the set of rules that govern data
communication.
It represents agreement between the communicating devices

1-7
 Data Representation
 Text: Represented as a bit pattern(0’s and 1’s)
 Different sets of bit patterns have been designed to represent text
 Code-each set of pattern; Coding-Process of representing symbols
 Unicode-coding system; uses 32 bits to represent a symbol or character.
 ASCII-to represent 127 character
 Numbers: Represented by bit pattern
 Numbers are directly converted to a binary.
 Images: Represented by bit pattern
 Pixel : smallest unit of image
 Resolution: Number of pixels in unit area
 Methods: RGB, Black and white, gray scale system
 Audio: Recording and broadcasting of sound or music
 It is continuous in nature
 Video: Recording and broadcasting of picture or movie
 It can be continuous, combination of images.
1-8
 Data Flow
 Simplex: Communication is unidirectional
 Only one of the two devices can transmit other can only receive
 Examples: Keyboard, Monitors
 Entire capacity of the channel is to send data in one direction

 Half duplex: Each station can both transmit and receive, but not at the
same time.
 When one device is sending , the other can only receive.
 Example: Walkie-Talkies and (Citizen Band) radios
 Entire capacity of the channel is utilized for each direction.

 Full duplex: Both stations can transmit and receive simultaneous

 Example: Telephone network
 Entire capacity of the channel is divided between the two directions.
1-9
1-10
 Networks
A network is a set devices(node) connected by
communication links
A node can be a computer, printer or any other
device capable of sending and/or receiving data
generated by other nodes on the network

Distributed Processing
• Task is divided among multiple computers.
• Separate machine handle subset of the task

1-11
 Distributed Processing

• Security / Encapsulation
• Distributed databases
• Faster problem solving
• Security through redundancy
• Collaborative processing

1-12
 Network Criteria
Performance: Measured in terms of response and transmit time.
 Transmit time: Time required for a message to travel from one device to
another.
 Response time: Time between an inquiry and a response
 Performance of a network depends:
 Number of users
 Type of transmission medium
 Capabilities of the connected hardware
 Efficiency of the software
 Throughput: Number of bits transmitted in per second
 Delay: time taken to transmit data
Reliability: Frequency of failure,Recovery time,Catastrophe-damage
Security: Protecting data from unauthorized access, protecting data from
damage, virus.
1-13
 Physical Structures
Types of connection
• Point-to-point
– Dedicated link between two devices
– The entire capacity of the channel is reserved
– Ex) Microwave link, TV remote control

• Multipoint
– More than two devices share a single link
– Capacity of the channel is either
• Spatially shared: Devices can use the link simultaneously
• Timeshare: Users must take turns

1-14
1-15
 Physical Topology
Physical topology is the way in which a network is laid out
physically
Two or more devices connect to a link
Two or more links form a topology
Different Topologies are :Mesh, Star, Bus, Ring

1-16
 Mesh Topology
• Dedicated point-to-point link to every other nodes. The
term dedicated means that the link carries traffic only b/w
the two devices it connects
• Consider that each node must be connected to every other
node.
• Node1 must be connected to n-1 nodes, node2 must be
connected to n-1 node and finally node n must be
connected to n-1 nodes.
• We need n(n-1) physical links. If link allows
communication in both directions, we can divide number
of links by 2. in a mesh topology, we need n(n-1)/2

1-17
1-18
Advantages
 Eliminating the traffic problem
 Robust
 Privacy
 Fault identification and fault isolation

Disadvantages
 Installation and reconnection
 Wiring space is more
 Hardware required to connect each link can be expensive

1-19
 Star Topology
• Dedicated point-to-point link only to a central controller,
called a hub

• The devices are not directly linked to one another

• Hub acts as an exchange: No direct traffic between devices

1-20
Advantages
 Less expensive, easy to install and reconfigure
 Robust
Fault detection and fault isolation is also easy

Disadvantages
 Dependency of the whole on one single point, the
hub

1-21
 Bus Topology
• One long cable acts as a backbone to links all nodes

• Nodes are connected to bus cable by tap and drop line

• A drop line is a connection b/w the device and the main

cable

• A tap is a connector that splices into the main cable or

punctures the sheathing of a cable to create a contact with
the metallic core

1-22
Advantages
 Easy installation
 Cheap

Disadvantages
 Difficult reconfiguration and fault isolation,
A fault or break in the bus stops all transmission
1-23
 Ring Topology
• Dedicated point-to-point link only with the two nodes on
each sides

• A signal is passed along the ring in one direction

• Each device in the ring incorporates a repeater. When a

device receives a signal intended for another device, its
repeater regenerates the bits and passes them along

1-24
Advantages
•Easy reconfiguration
•Fault isolation

Disadvantage
• Unidirectional traffic
•A break in the ring can disable the entire network

1-25
 Hybrid Topology
• Example: Main star topology with each branch connecting several stations in a bus
topology
• To share the advantages from various topologies

1-26
Categories of Networks

1-27
 LAN
• Usually privately owned

• A network for a single office, building, or campus , size is limited

to a few a few Km

• LAN’s are designed to allow resources to be shared b/w PC or

workstations

• The resources to be shared can include h/w, s/w or data

• Common LAN topologies: bus, ring, star

1-28
1-29
An isolated LAN connecting 12 computers to a hub in a closet

1-30
 MAN
• Designed to extend to an entire city

• Designed for a customer who need a high speed connectivity

• Cable TV network, a company’s connected LANs

• Owned by a private or a public company

1-31
 WAN

• Long distance transmission, e.g., a country, a continent, the world

• Enterprise network: A WAN that is owned and used by one company
• point-to-point WANs and switched WANs

1-32
1-33
 Internetwork
• Internetwork (internet) : two or more networks are
connected by internetworking devices
• Internetworking devices: router, gateway, etc.
• The Internet: a specific worldwide network

1-34
1-35
 Internetwork Example
• A heterogeneous network : four WANs and two LANs

1-36
Network Models

1-37
 Overview
• Network is a combination of hardware and
software that sends data from one location to
another.
• Hardware consist of the physical equipment that
carries signals.
• Software consist of instruction sets that make
possible to use services.

1-38
 PROTOCOL LAYERING
• protocol defines the rules that both the sender and
receiver and all intermediate devices need to
follow to be able to communicate effectively.
• When communication is simple, we may need
only one simple protocol;
• when the communication is complex, we may
need to divide the task between different layers, in
which case we need a protocol at each layer, or
protocol layering

1-39
1-40
Second Scenario

1-41
• Advantages:
• Protocol layering enables us to divide a complex task into
several smaller and simpler tasks.
• Modularity in this case means independent layers. A layer
(module) can be defined as a black box with inputs and outputs,
without concern about how inputs are changed to outputs.
• It allows us to separate the services from the implementation. A
layer needs to be able to receive a set of services from the lower
layer and to give the services to the upper layer; we don’t care
about how the layer is implemented.
• Internet, is that communication does not always use only two
end systems; there are intermediate systems that need only some
layers, but not all layers.

1-42
 Principles of Protocol Layering
• First Principle
• The first principle dictates that if we want bidirectional
communication, we need to make each layer so that it is able
to perform two opposite tasks, one in each direction.
• For example, the third layer task is to listen (in one direction)
and talk (in the other direction).
• The second layer needs to be able to encrypt and decrypt.
• The first layer needs to send and receive mail

1-43
• Second Principle
• The second principle that we need to follow in protocol layering
is that the two objects under each layer at both sites should be
identical.
• For example, the object under layer 3 at both sites should be a
plaintext letter.
• The object under layer 2 at both sites should be a cipher text
letter.
• The object under layer 1 at both sites should be a piece of mail.

1-44
Logical Connections

1-45
Layered Tasks
Sender, Receiver, and Carrier
At the sender site
Higher layer: the sender writes the letter, inserts the letter in
an envelope, writes the sender and receiver address, and
drops the letter in a mailbox
Middle layer: the letter is picked up by a letter carrier and
delivered to the post office
Lower layer: the letter is stored at the post office; a carrier
transports the letter

On the way: the letter is then on its way to the recipient. It

may be transported by truck, train, airplane, boat

1-46
At the receiver site
Lower layer: the carrier transports the letter to the post office
Middle layer: the letter is stored and delivered to the recipient’s
mailbox
Higher layer: the receiver picks up the letter, opens the envelope
and reads it

Hierarchy
According to our analysis, there are three different activities at the
sender site and another three activities at the receiver site. The task
of transporting the letter b/w the sender and receiver is done by the
carrier

1-47
Sending a letter

1-48
 TCP/IP PROTOCOL SUITE
• TCP/IP is a protocol suite (a set of protocols organized in
different layers) used in the Internet today.
• It is a hierarchical protocol made up of interactive modules,
each of which provides a specific functionality.
• The term hierarchical means that each upper level protocol is
supported by the services provided by one or more lower level
protocols.
• The original TCP/IP protocol suite was defined as four software
layers built upon the hardware.

1-49
1-50
Layered Architecture

1-51
1-52
1-53
 Physical layer

The physical layer is responsible for transmitting individual bits in

a frame across the link.
 communication between two devices at the physical layer is still a
logical communication because there is another, hidden layer, the
transmission media, under the physical layer.
Two devices are connected by a transmission medium (cable or
air).
Such that the transmission medium does not carry bits; it carries
electrical or optical signals.
So the bits received in a frame from the data-link layer are
transformed
and sent through the transmission media, 1-54
but we can think that the logical unit between two physical layers
 Responsibilities
• Physical characteristics of interfaces and medium: defines the
physical characteristics of the interface b/w the devices and
transmission medium. It also defines the type of transmission
medium
• Representation of bits: the physical layer data consists of a stream
of bits with no interpretation. To be transmitted, bits must be
encoded into signals
• Data rate: the transmission rate- the number of bits sent each
second
• Line configuration: point to point and multipoint
• Physical topology: Mesh, star, ring ,bus
• Transmission mode: Half- duplex, Simplex, full duplex

55
 Data link layer

The data link layer is responsible for transmitting frames

from one node to the next.
This layer transforms the physical layer, raw transmission
facility, to reliable link.

It makes physical layer appear error free to the upper layer

1-56
 Responsibilities
• Framing: the data link layer divides the stream of bits received
from the network layer into manageable data units called frames
• Physical addressing: if frames are to be distributed to different
system on the network, the data link layer adds a header to the
frame to define the sender and/or receiver of the frame
• Flow control: if the rate at which the data are absorbed by the
receiver is less than the rate at which data are produced in the
sender
• Error control: the data link layer adds reliability to the physical
layer by adding mechanism to detect and retransmit damaged data
• Access control: when two or more devices are connected to the
same link, data link layer protocols are necessary to determine
which device has the control over the link
57
Node-to-node delivery

1-58
 Network layer

The network layer is responsible for creating a connection between the

source computer and the destination computer. The communication at
the network layer is host-to-host.
The network layer is responsible for the delivery of packets from the original
source to the final destination.
network layer is responsible for host-to-host communication and
routing the packet through possible routes.
The network layer in the Internet includes the main protocol, Internet
Protocol(IP), that defines the format of the packet, called a datagram at
the network layer.
1-59
• IP also defines the format and the structure of addresses used in
this layer.
• IP is also responsible for routing a packet from its source to its
destination, which is achieved by each router forwarding the
datagram to the next router in its path.
• IP is a connectionless protocol that provides no flow control, no
error control, and no congestion control services.
• The network layer also includes unicast (one-to-one) and
multicast (one-to-many) routing protocols.
• The network layer also has some auxiliary protocols that help IP
in its delivery and routing tasks.

1-60
• The Internet Control Message Protocol (ICMP) helps IP to
report some problems when routing a packet.
• The Internet Group Management Protocol (IGMP) is another
protocol that helps IP in multitasking.
• The Dynamic Host Configuration Protocol (DHCP) helps IP to
get the network-layer address for a host.
• The Address Resolution Protocol (ARP) is a protocol that
helps IP to find the link-layer address of a host or a router
when its network-layer address is given.

1-61
Source-to-destination delivery

1-62
Transport layer
• The transport layer is responsible for delivery of a message from one process to
another.
• The transport layer at the source host gets the message from the application layer, encapsulates it in a
transport layer packet (called a segment or a user datagram in different protocols) and sends it, through
the logical (imaginary) connection, to the transport layer at the destination host.
• the transport layer is responsible for giving services to the application layer: to get a
message from an application program running on the source host and deliver it to the
corresponding application program on the destination host.

1-63
• we have more than one protocol in the transport layer, which means
that each application program can use the protocol that best matches
its requirement.
• The main protocol, Transmission Control Protocol (TCP), is a
connection-oriented protocol that first establishes a logical
connection between transport layers at two hosts before transferring
data.
• It creates a logical pipe between two TCPs for transferring a stream
of bytes.
• TCP provides flow control (matching the sending data rate of the
source host with the receiving data rate of the destination host to
prevent overwhelming the destination)
• error control (to guarantee that the segments arrive at the destination
without error and resending the corrupted ones).
• Congestion control to reduce the loss of segments due to congestion
in the network.
1-64
• User Datagram Protocol (UDP), is a connectionless protocol
that transmits user datagrams without first creating a logical
connection.
• In UDP, each user datagram is an independent entity without
being related to the previous or the next on.
• UDP is a simple protocol that does not provide flow, error, or
congestion control.
• Stream Control Transmission Protocol (SCTP) is designed to
respond to new applications that are emerging in the
multimedia.

1-65
Reliable process-to-process delivery of a message

1-66
 Application layer

The application layer is responsible for providing services to the user.

The two application layers exchange messages between each other.

Communication at the application layer is between two processes (two

programs running at this layer)

To communicate, a process sends a request to the other process and

receives a response. Process-to-process communication is the duty of
the application layer.
1-67
The application layer in the Internet includes many predefined protocols,
but a user can also create a pair of processes to be run at the two hosts.

Ex: The Hypertext Transfer Protocol (HTTP) is a vehicle for accessing

the World Wide Web (WWW).
The Simple Mail Transfer Protocol (SMTP) is the main protocol used in
electronic mail (e-mail) service.
The File Transfer Protocol (FTP) is used for transferring files from one
host to another.
The Terminal Network (TELNET) and Secure Shell (SSH) are used for
accessing a site remotely.
The Domain Name System (DNS) is used by other protocols to find the
network-layer address of a computer.
The Simple Network Management Protocol (SNMP) is used by an
administrator to manage the Internet at global and local levels
The Internet Group Management Protocol (IGMP) is used to collect
membership in a group

1-68
Encapsulation and Decapsulation

1-69
• Encapsulation at the Source Host
At the source, we have only encapsulation.
1. At the application layer, the data to be exchanged is
referred to as a message. A message normally does not
contain any header or trailer, we refer to the whole as the
message. The message is passed to the transport layer .
2. The transport layer takes the message as the payload, the load
that the transport layer should take care of.
• It adds the transport layer header to the payload, which
contains the identifiers of the source and destination
application programs that want to communicate plus some
more information that is needed for the end-to end delivery of
the message, such as information needed for flow, error
control, or congestion control.
1-70
3.The network layer takes the transport-layer packet as data or
payload and adds its own header to the payload.
The header contains the addresses of the source and
destination hosts and some more information used for
error checking of the header, fragmentation
information, and so on.
4. The data-link layer takes the network-layer packet as data
or payload and adds its own header, which contains the link-
layer addresses of the host or the next hop (the router).

1-71
 Decapsulation and Encapsulation at the Router
1. After the set of bits are delivered to the data-link layer, this
layer decapsulates the datagram from the frame and passes it to
the network layer.
2.The network layer only inspects the source and destination
addresses in the datagram header and consults its forwarding
table to find the next hop to which the datagram is to be
delivered.
• The datagram is then passed to the data-link layer of the next link
3. The data-link layer of the next link encapsulates the datagram in a
frame and passes it to the physical layer for transmission.

1-72
 Decapsulation at the Destination Host
• At the destination host, each layer only decapsulates the
packet received, removes the payload, and delivers the
payload to the next-higher layer protocol until the message
reaches the application layer.
• It is necessary to say that decapsulation in the host
involves error checking

1-73
 ADDRESSING
• 4 Levels of addressing:
-Physical addresses
- Logical addresses
-Port addresses
-Specific addresses

1-74
1-75
• Each address belongs to specific layer.
• Physical(Data link layer and Physical)
• Known as link address, it is the address of a node
defined by LAN/WAN.
• It is included in the frame used by the data link layer
• It is lowest level address
• Size and format depend on network(Ethernet uses 6
byte address)
• Example: 07-01-02-01-0C-4B (6 byte with 12
hexadecimal digit)

1-76
• Logical address (IP address): (Network layer)
– Necessary for universal communication –independent of
network
– Each host is identified uniquely
– Internet address is 32-bit long.
– Example: 162.192.2.2

• Port address(Transport layer)

– Necessary for process to communicate with another process
in destination
– Because a system can communicate multiple process at the
same time
– 16 bit port address represented as one single number
– Example: port 13 for day time service
1-77
• THE OSI MODEL
• Established in 1947, the International Organization for
Standardization (ISO) is a multinational body dedicated to
worldwide agreement on international standards.
• An ISO standard that covers all aspects of network
communications is the Open Systems Interconnection (OSI)
model. It was
first introduced in the late 1970s.
• An open system is a set of protocols that allows any two different systems to
communicate regardless of their underlying architecture.
• The purpose of the OSI model is to show how to facilitate communication
between different systems without requiring changes to the logic of the
underlying hardware and software.
• The OSI model is not a protocol; it is a model for understanding and designing
a network architecture that is flexible, robust, and interoperable.
1-78
The OSI model is a layered framework for the design of network
systems that allows communication between all types of computer
systems

1-79
OSI versus TCP/IP

1-80
• First, TCP/IP has more than one transport-layer protocol.
Some of the functionalities of the session layer are available in
some of the transport-layer protocols.
• Second, the application layer is not only one piece of software.
Many applications can be developed at this layer.
• If some of the functionalities mentioned in the session and
presentation layers are needed for a particular application,
they can be included in the development of that piece of
software

1-81
 Lack of OSI Model’s Success
• First, OSI was completed when TCP/IP was fully in place and a lot of time
and money had been spent on the suite; changing it would cost a lot.
• Second, some layers in the OSI model were never fully defined.
• EX: although the services provided by the presentation and the session
layers were listed in the document, actual protocols for these two layers
were not fully defined, nor were they fully described, and the
corresponding software was not fully developed.
• Third, when OSI was implemented by an organization in a different
application, it did not show a high enough level of performance to entice
the Internet authority to switch from the TCP/IP protocol suite to the OSI
model

1-82
TCP/IP

1-83
Example 1
In Figure, a node with physical address 10 sends a frame to a node with
physical address 87.
The two nodes are connected by a link.
At the data link level this frame contains physical addresses in the header.
These are the only addresses needed.
The rest of the header contains other information needed at this level.
The trailer usually contains extra bits needed for error detection

1-84
Example 2
In we want to send data from a node with
network address A and physical address 10,
located on one LAN, to a node with a network
address P and physical address 95, located on
another LAN.
Because the two devices are located on
different networks, we cannot use physical
addresses only; the physical addresses only
have local jurisdiction. What we need here
are universal addresses that can pass through
the LAN boundaries.
The network (logical) addresses have this
characteristic.

1-85
Example 3
Figure shows an example of transport layer communication.
Data coming from the upper layers have port addresses j and k
(j is the address of the sending process, and k is the address of
the receiving process).
Since the data size is larger than the network layer can handle,
the data are split into two packets, each packet retaining the
port addresses (j and k).
Then in the network layer, network addresses (A and P) are
added to each packet.

1-86
Figure 2.14 Example 3

1-87
 Physical Layer:

• the major functions of the physical layer is to move data in the

form of electromagnetic signals across a transmission
medium.
• Whether you are collecting numerical statistics from another
computer, sending animated pictures from a design
workstation, or causing a bell to ring at a distant control
center, you are working with the transmission of data across
network connections.
• EX: a photograph must first be changed to a form that
transmission media can accept. Transmission media work by
conducting energy along a physical path. For transmission,
data needs to be changed to signals
1-88
1-89
 DATA AND SIGNALS
• Analog and Digital Data
• Data can be analog or digital. The term analog data refers to information
that is continuous; digital data refers to information that has discrete
states.
• For example, an analog clock that has hour, minute, and second hands
gives information in a continuous form; the movements of the hands are
continuous.
• On the other hand, a digital clock that reports the hours and the minutes
will change suddenly from 8:05 to 8:06.
• Analog data, such as the sounds made by a human voice, take on
continuous values. When someone speaks, an analog wave is created in the
air.
• Digital data take on discrete values. For example, data are stored in
computer memory in the form of 0s and 1s.

1-90
 Analog and Digital Signals
• Signals can be analog or digital. Analog signals can have an infinite
number of values in a range; digital signals can have only a limited
number of values.

Figure 3.1 Comparison of analog and digital signals

1-91
 Periodic and Nonperiodic
• A periodic signal completes a pattern within a measurable
time frame, called a period, and repeats that pattern over
subsequent identical periods.
• The completion of one full pattern is called a cycle.
• A nonperiodic signal changes without exhibiting a pattern
or cycle that repeats over time.

1-92
 DIGITAL SIGNALS
• In addition to being represented by an analog signal,
information can also be represented by a digital signal. For
example, a 1 can be encoded as a positive voltage and a 0 as
zero voltage. A digital signal can have more than two levels.
In this case, we can send more than 1 bit for each level.

1-93
Two digital signals: one with two signal levels and the other
with four signal levels

3.94
• In general, if a signal has L levels, each level needs log2 L bits.
For this reason, we can send log24 = 2 bits in part b.

EX:A digital signal has eight levels. How many

bits are needed per level? We calculate the
number of bits from the formula

Each signal level is represented by 3 bits

1-95
 Example 3.17

A digital signal has nine levels. How many bits are needed
per level? We calculate the number of bits by using the
formula. Each signal level is represented by 3.17 bits.
However, this answer is not realistic. The number of bits
sent per level needs to be an integer as well as a power
of 2. For this example, 4 bits can represent one level.

3.96
• Bit Rate
• bit rate (instead of frequency)—is used to describe digital
signals. The bit rate is the number of bits sent in 1s,
expressed in bits per second (bps).
• Assume we need to download text documents at the rate of
100 pages per minute. What is the required bit rate of the
channel?
Solution
A page is an average of 24 lines with 80 characters in each line.
If we assume that one character requires 8 bits, the bit rate is

1-97
• A digitized voice channel is made by digitizing a 4-kHz
bandwidth analog voice signal. We need to sample the signal at
twice the highest frequency (two samples per hertz). We assume
that each sample requires 8 bits.
• What is the require bitrate?

• Solution
• The bit rate can be calculated as

1-98
• Bit Length
• The bit length is the distance one bit occupies on the
transmission medium.
• Bit length =propagation speed * bit duration
• Digital Signal as a Composite Analog Signal
• a digital signal is a composite analog signal. The bandwidth is
infinite
• A digital signal, in the time domain, comprises connected
vertical and horizontal line segments. A vertical line in the
time domain means a frequency of infinity (sudden change in
time); a horizontal line in the time domain means a frequency
of zero (no change in time).

1-99
Figure 3.17 The time and frequency domains of periodic and nonperiodic
digital signals

3.100
 Transmission of Digital Signals
• Baseband Transmission
• Baseband transmission means sending a digital signal over a
channel without changing the digital signal to an analog signal.

Baseband transmission requires that we have a low-pass channel,

a channel with a bandwidth that starts from zero. This is the case if
we have a dedicated medium with a bandwidth constituting only
one channel.

1-101
• For example, the entire bandwidth of a cable connecting two computers is
one single channel. As another example, we may connect several
computers to a bus, but not allow more than two stations to communicate
at a time. Again we have a low-pass channel, and we can use it for
baseband communication.

1-102
• Case 1: Low-Pass Channel with Wide Bandwidth
• If we want to preserve the exact form of a nonperiodic digital
signal with vertical segments vertical and horizontal segments
horizontal, we need to send the entire spectrum, the
continuous range of frequencies between zero and infinity.
• This is possible if we have a dedicated medium with an
infinite bandwidth between the sender and receiver that
preserves the exact amplitude of each component of the
composite signal.
• Although this may be possible inside a computer (e.g., between CPU and
memory), it is not possible between two devices.
• such as a coaxial or fiber optic cable, with a very wide bandwidth, two
stations can communicate by using digital signals with very good accuracy

1-103
 Figure 3.20 Baseband transmission using a dedicated
medium

Although the output signal is not an exact replica of the

original signal, the data can still be deduced from the
received signal
Baseband transmission of a digital signal that
preserves the shape of the digital signal is possible
only if we have a low-pass channel with an infinite
3.104 wide bandwidth.
or very
• Low-Pass Channel with Limited Bandwidth
• In a low-pass channel with limited bandwidth, we approximate
the digital signal with an analog signal. The level of
approximation depends on the bandwidth available.
• Rough Approximation
• Let us assume that we have a digital signal of bit rate N. If we
want to send analog signals to roughly simulate this signal, we
need to consider the worst case, a maximum number of
changes in the digital signal. This happens when the signal
carries the sequence 01010101 . . . or the sequence
10101010. . . . To simulate these two cases, we need an analog
signal of frequency f = N/2.

1-105
Figure 3.21 Rough approximation of a digital signal using the first harmonic
for worst case

3.106
• Better Approximation
• To make the shape of the analog signal look more like that of
a digital signal, we need to add more harmonics of the
frequencies. We need to increase the bandwidth. We can
increase the bandwidth to 3N/2, 5N/2, 7N/2, and so on.

In baseband transmission, the required

bandwidth is proportional to the bit rate;
if we need to send bits faster, we need
more bandwidth.

1-107
Figure 3.22 Simulating a digital signal with first three harmonics

3.108
 Table 3.2 Bandwidth requirements

3.109
 Example 3.22

What is the required bandwidth of a low-pass channel if we

need to send 1 Mbps by using baseband transmission?

Solution
The answer depends on the accuracy desired.
a. The minimum bandwidth, is B = bit rate /2, or 500 kHz.

b. A better solution is to use the first and the third

harmonics with B = 3 × 500 kHz = 1.5 MHz.

c. Still a better solution is to use the first, third, and fifth

harmonics with B = 5 × 500 kHz = 2.5 MHz.

3.110
• Broadband Transmission (Using Modulation)
• Broadband transmission or modulation means changing
the digital signal to an analog signal for transmission.
Modulation allows us to use a bandpass channel—a channel
with a bandwidth that does not start from zero. This type of
channel is more available than a low-pass channel.

Figure 3.23 Bandwidth of a bandpass channel

1-111
Figure 3.24 Modulation of a digital signal for transmission on a bandpass
channel

3.112
• 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

1-113
• Attenuation
• Attenuation means a loss of energy. When a signal, simple
or composite, travels through a medium, it loses some of its
energy in overcoming the resistance of the medium.
• That is why a wire carrying electric signals gets warm, if not
hot, after a while. Some of the electrical energy in the signal is
converted to heat. To compensate for this loss, amplifiers are
used to amplify the signal.

1-114
Figure 3.26 Attenuation

3.115
• Decibel
• To show that a signal has lost or gained strength, engineers use
the unit of the decibel.
• The decibel (dB) measures the relative strengths of two
signals or one signal at two different points.
• Note that the decibel is negative if a signal is attenuated and
positive if a signal is amplified.

• Variables P1 and P2 are the powers of a signal at points 1 and

2, respectively.

1-116
• Distortion
• Distortion means that the signal changes its form or shape.
• Distortion can occur in a composite signal made of different
frequencies. Each signal component has its own propagation
speed through a medium and, therefore, its own delay in
arriving at the final destination.
• Signal components at the receiver have phases different from
what they had at the sender. The shape of the composite signal
is therefore not the same.

1-117
Figure 3.28 Distortion

3.118
• Noise: Noise is another cause of impairment. Several
types of noise, such as thermal noise, induced noise,
crosstalk, and impulse noise, may corrupt the signal.
• Thermal noise is the random motion of electrons in a wire,
which creates an extra signal not originally sent by the
transmitter.
• Induced noise comes from sources such as motors and
appliances. These devices act as a sending antenna, and the
transmission medium acts as the receiving antenna.
• Crosstalk is the effect of one wire on the other. One wire acts
as a sending antenna and the other as the receiving antenna.
• Impulse noise is a spike (a signal with high energy in a very
short time) that comes from power lines, lightning, and so on.

1-119
Figure 3.29 Noise

3.120
• Signal-to-Noise Ratio (SNR)
• The signal-to-noise ratio is defined as

1-121
Figure 3.30 Two cases of SNR: a high SNR and a low SNR

3.122
• SNR is actually the ratio of what is wanted (signal) to what is
not wanted (noise).
• A high SNR means the signal is less corrupted by noise; a low
SNR means the signal is more corrupted by noise.
• Because SNR is the ratio of two powers, it is often described
in decibel units,
• SNRdB, defined as

1-123
 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:

3.124
 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)

Noiseless Channel: Nyquist Bit Rate

Noisy Channel: Shannon Capacity
Using Both Limits

1-125
• Noiseless Channel: Nyquist Bit Rate
• For a noiseless channel, the Nyquist bit rate formula defines
the theoretical maximum bit rate
BitRate = 2 * bandwidth * log2L

• In this formula, bandwidth is the bandwidth of the

channel, L is the number of signal levels used to
represent data, and BitRate is the bit rate in bits per
second.

1-126
• 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

1-127
 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.
3.128
 Noisy Channel: Shannon Capacity
In reality, we cannot have a noiseless channel; the
channel is always noisy. In 1944,Claude Shannon
introduced a formula, called the Shannon capacity, to
determine the theoretical highest data rate for a noisy
channel:

In this formula, bandwidth is the bandwidth of the

channel, SNR is the signal-to noise ratio, and
capacity is the capacity of the channel in bits per
second

1-129
 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.

3.130
 Example 3.38

We can calculate the theoretical highest bit rate of a

regular telephone line. A telephone line normally has a
bandwidth of 3000. The signal-to-noise ratio is usually
3162. For this channel the capacity is calculated as

This means that the highest bit rate for a telephone line is
34.860 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.
3.131
 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

3.132
 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.

3.133
 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.

The Shannon capacity gives us the

upper limit; the Nyquist formula tells us
how many signal levels we need.

3.134
 PERFORMANCE
• Bandwidth
• 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.
we can say the bandwidth of a subscriber telephone line is 4 kHz

❑ The second, bandwidth in bits per second, refers to the speed

of bit transmission in a channel or link.
• the bandwidth of a Fast Ethernet network is a maximum of 100
Mbps. This means that this network can send 100 Mbps

1-135
 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.

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.

3.136
• Throughput
• The throughput is a measure of how fast we can actually
send data through a network. Although, at first glance,
bandwidth in bits per second and throughput seem the same,
they are different.

1-137
 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.
3.138
• Latency (Delay)
• The latency or delay defines how long it takes for
an entire message to completely arrive at the
destination from the time the first bit is sent out from
the source.
• Latency = propagation time + transmission time +
queuing time + processing delay
• Propagation time measures the time required for a
bit to travel from the source to the destination.
• Propagation time = Distance / (Propagation
Speed)

1-139
 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.
3.140
• The transmission time of a message depends on the
size of the message and the bandwidth of the channel.
• Transmission time = (Message size) / Bandwidth
• What are the propagation time and the transmission
time for a 2.5-kbyte message (an e-mail) 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 × 10^8 m/s.

1-141
 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.

3.142
• Queuing Time
• the time needed for each intermediate or end device to hold
the message before it can be processed. The queuing time is
not a fixed factor; it changes with the load imposed on the
network.
• When there is heavy traffic on the network, the queuing time
increases. An intermediate device, such as a router, queues the
arrived messages and processes them one by one. If there are
many messages, each message will have to wait

1-143
• Bandwidth-Delay Product
• The bandwidth-delay product defines the number of bits that
can fill the link.

1-144
Figure 3.31 Filling the link with bits for case 1

3.145
Figure 3.32 Filling the link with bits in case 2

3.146
• Jitter
• Jitter is a problem if different packets of data
encounter different delays and the application using
the data at the receiver site is time-sensitive (audio
and video data).
• If the delay for the first packet is 20 ms, for the second is 45
ms, and for the third is 40 ms, then the real-time application
that uses the packets endures jitter

1-147
 • DIGITAL-TO-DIGITAL CONVERSION
• 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.

Line Coding
• Line coding is the process of converting digital data to
digital signals.
• data, in the form of text, numbers, graphical images, audio, or
video, are stored in computer memory as sequences of bits.
• Line coding converts a sequence of bits to a digital signal. At
the sender, digital data are encoded into a digital signal; at the
receiver, the digital data are recreated by decoding the digital
signal.
1-148
igure 4.1 Line coding and decoding

4.149
 Characteristics
• Signal Element Versus Data Element
• A data element is the smallest entity that can represent a piece
of information: this is the bit. In digital data communications,
a signal element carries data elements. A signal element is the
shortest unit (timewise) of a digital signal.
• In other words, 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.
• We define a ratio r which is the number of data elements
carried by each signal element.

1-150
ure Signal element versus data element

1-151
Data Rate Versus Signal Rate
• The data rate defines the number of data elements (bits) sent in
1sec. The unit is bits per second (bps).
• The signal rate is the number of signal elements sent in 1sec. The
unit is the baud.
• consider the relationship between data rate (N) and signal rate (S)

S = N/r
• We can formulate the relationship between data rate and signal rate
as
Save =c * N * (1/r) baud
• where N is the data rate (bps); c is the case factor, which varies for
each case; S is the number of signal elements per second;

1-152
 Example 4.1

A signal is carrying data in which one data element

is encoded as one signal element ( r = 1). If the
bit rate is 100 kbps, what is the average value of
the baud rate if c is between 0 and 1?

Solution
We assume that the average value of c is 1/2 . The baud
rate is then

4.153
• Bandwidth
• Although the actual bandwidth of a digital signal is
infinite, the effective bandwidth is finite.
• We can say that the bandwidth (range of frequencies) is
proportional to the signal rate (baud rate).
The minimum bandwidth can be given as
Bmin = c * N * (1 / r)
We can solve for the maximum data rate if the bandwidth of the
channel is given
Nmax = (1 / c) * B *r

1-154
 Example 4.2

The maximum data rate of a channel is Nmax = 2

× B × log2 L (defined by the Nyquist formula).
Does this agree with the previous formula for Nmax?

Solution
A signal with L levels actually can carry log 2L bits per
level. If each level corresponds to one signal element and
we assume the average case (c = 1/2), then we have

4.155
• Baseline Wandering
• In decoding a digital signal, the receiver calculates running
average of the received signal power. This average is called
the baseline.
• A long string of 0s or 1s can cause a drift in the baseline (baseline
wandering) and make it difficult for the receiver to decode correctly. A
good line coding scheme needs to prevent baseline wandering.
DC Component
• When the voltage level in a digital signal is constant for a
while, the spectrum creates very low frequencies . These
frequencies around zero, called DC (direct-current)
components.
• For example, a telephone line cannot pass frequencies below
200 Hz.

1-156
• Self-synchronization
• To correctly interpret the signals received from the sender, the
receiver’s bit intervals must correspond exactly to the sender’s
bit intervals.
• If the receiver clock is faster or slower, the bit intervals are not
matched and the receiver might misinterpret the signals.
• 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.
If the receiver’s clock is out of synchronization, these points
can reset the clock.

1-157
gure 4.3 Effect of lack of synchronization

1-158
 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.

1-159
• Built-in Error Detection
• It is desirable to have a built-in error-detecting capability in the
generated code to detect some or all of the errors that occurred
during transmission.
• Immunity to Noise and Interference
Another desirable code characteristic is a code that is immune to
noise and other interferences.
• Complexity
A complex scheme is more costly to implement than a simple
one. For example, a scheme that uses four signal levels is more
difficult to interpret than one that uses only two levels

1-160
FigureLine coding
schemes

4.161
• Unipolar Scheme
In a unipolar scheme, all the signal levels are on one side of the
time axis, either above or below

Figure Unipolar NRZ

scheme

1-162
• Polar Schemes
• In polar schemes, the voltages are on both sides of the time
axis. For example, the voltage level for 0 can be positive and
the voltage level for 1 can be negative.
• Non-Return-to-Zero (NRZ)
• In polar NRZ encoding, we use two levels of voltage
amplitude. We can have two versions of polar NRZ: NRZ-L
and NRZ-I.
• In NRZ-L the level of the voltage determines the
value of the bit.
.In NRZ-I the inversion or the lack of inversion
determines the value of the bit.
• If there is no change, the bit is 0; if there is a change, the bit is
1.
1-163
ure Polar NRZ-L and NRZ-I schemes

1-164
• NRZ-L and NRZ-I both have an average signal rate of
N/2 Bd.
• NRZ-L and NRZ-I both have a DC component problem
• The synchronization problem (sender and receiver clocks are not
synchronized) also exists in both schemes. Again, this problem
is more serious in NRZ-L than in NRZ-I.
• Another problem with NRZ-L occurs when there is a sudden
change of polarity in the system. NRZ-I does not have this
problem

1-165
 Example 4.4

A system is using NRZ-I to transfer 10-Mbps

data. What are the average signal rate and
minimum bandwidth?

Solution
The average signal rate is S = N/2 = 500 kbaud. The
minimum bandwidth for this average baud rate is Bmin =
S = 500 kHz.

4.166
• Return-to-Zero (RZ)
• The main problem with NRZ encoding occurs when the sender
and receiver clocks are not synchronized. The receiver does not
know when one bit has ended and the next bit is starting.
• One solution is the return-to-zero (RZ) scheme, which uses
three values: positive, negative, and zero. In RZ, the signal
changes not between bits but during the bit.
• we see that the signal goes to 0 in the middle of each bit. It
remains there until the beginning of the next bit.
• The main disadvantage of RZ encoding is that it requires two
signal changes to encode a bit and therefore occupies greater
bandwidth.
• Another problem is the complexity but no DC component
problem.

1-167
Figure Polar RZ scheme

4.168
• Biphase: Manchester and Differential Manchester
• The idea of RZ (transition at the middle of the bit) and the idea
of NRZ-L are combined into the Manchester scheme.
• In Manchester encoding, the duration of the bit is divided
into two halves. The voltage remains at one level during the
first half and moves to the other level in the second half. The
transition at the middle of the bit provides synchronization.

• Differential Manchester, on the other hand, combines the

ideas of RZ and NRZ-I. There is always a transition at the
middle of the bit, but the bit values are determined at the
beginning of the bit. If the next bit is 0, there is a transition; if
the next bit is 1, there is none

1-169
• There is no baseline wandering. There is no DC
component because each bit has a positive and
negative voltage contribution. The only drawback is
the signal rate.
• The signal rate for Manchester and differential
Manchester is double that for NRZ.

1-170
Polar biphase: Manchester and differential Manchester schemes

1-171
• Bipolar Schemes
• In bipolar encoding (sometimes called multilevel binary),
there are three voltage levels: positive, negative, and zero.
• The voltage level for one data element is at zero, while the
voltage level for the other element alternates between positive
and negative.

• AMI and Pseudoternary

• bipolar alternate mark inversion (AMI)
• the word mark comes from telegraphy and means 1. So AMI
means alternate 1 inversion. A neutral zero voltage represents
binary 0.
• Binary 1s are represented by alternating positive and negative
voltages
1-172
• A variation of AMI encoding is called
pseudoternary in which the 1 bit is encoded as a
zero voltage and the 0 bit is encoded as alternating
positive and negative voltages.

1-173
• The bipolar scheme was developed as an alternative to
NRZ. The bipolar scheme has the same signal rate as
NRZ, but there is no DC component.
• The concentration of the energy in bipolar encoding is
around frequency N/2.
• AMI is commonly used for long-distance communication, but it
has a synchronization problem when a long sequence of 0s is
present in the data

1-174
re Bipolar schemes: AMI and pseudoternary

4.175
1-176
1-177
Digital Transmissio
n

BMS Institute of Technology and Mgmt 4.33 138

 PC
•
M
PCM consists of three steps to digitize an
analog signal:
1. Sampling
2. Quantization
3. Binary encoding

4.34 Department of ISE BMS Institute of Technology and Mgmt 13

9
Figure 4.21 Components of PCM encode
r

4.35 BMS Institute of Technology and Mgmt 14

0
 Samplin
•
g
Analog signal is sampled every T secs.
S

• Ts is referred to as the sampling interval.

• fs = 1/Ts is called the sampling rate or sampling
frequency.
• There are 3 sampling methods:
– Ideal - an impulse at each sampling instant
– Natural - a pulse of short width with varying
amplitude
– Flattop - sample and hold, like natural but with single
amplitude value
• The process is referred to as pulse amplitude
modulation PAM and the outcome is a signal
4.36
with analog (nonofISEISEinteger)
Department
Departmentof
values
BMS Institute of Technology and Mgmt 14
1
Figure 4.22 Three different sampling methods for PC
M

4.37 BMS Institute of Technology and Mgmt 14

2
 Note

According to the Nyquist theorem, the

sampling rate must be
at least 2 times the highest frequency
contained in the signal.

4.38 BMS Institute of Technology and Mgmt 14

3
Figure 4.23 Nyquist sampling rate for low-pass and bandpass signal
s

4.39 BMS Institute of Technology and Mgmt 14

4
 Quantization
• Sampling results in a series of pulses of varying
amplitude values ranging between two limits: a
min and a max.
• The amplitude values are infinite between the
two limits.
• We need to map the infinite amplitude values
onto a finite set of known values.
• This is achieved by dividing the distance
between min and max into L zones, each of
height 
 = (max - min)/L
4.40 Department of ISE BMS Institute of Techology and Mgmt 14
5
 Quantization Levels

• The midpoint of each zone is assigned a

value from 0 to L-1 (resulting in L values)
• Each sample falling in a zone is then
approximated to the value of the
midpoint.

4.41 Department
Departmentof
ofISE
ISE BMS Institute of Technology and Mgmt 14
6
 Quantization Zones
• Assume we have a voltage signal with
amplitutes Vmin=-20V and Vmax=+20V.
• We want to use L=8 quantization levels.
• Zone width  = (20 - -20)/8 = 5
• The 8 zones are: -20 to -15, -15 to -10, -10
to -5, -5 to 0, 0 to +5, +5 to +10, +10 to +15,
+15 to +20
• The midpoints are: -17.5, -12.5, -7.5, -2.5,
2.5, 7.5, 12.5, 17.5
4.42 Department
Departmentof
ofISE
ISE 14
7
 Assigning Codes to Zone
•
s
Each zone is then assigned a binary code.
• The number of bits required to encode the
zones, or the number of bits per sample as it is
commonly referred to, is obtained as follows:
nb = log2 L
• Given our example, nb = 3
• The 8 zone (or level) codes are therefore: 000,
001, 010, 011, 100, 101, 110, and 111
• Assigning codes to zones:
– 000 will refer to zone -20 to -15
– 001 to zone -15 to -10, etc.

4.43 Department
Departmentof
ofISE
ISE 14
8
Figure 4.26 Quantization and encoding of a sampled signa
l

4.44 BMS Institute of Technology and Mgmt 14

9
 Quantization Erro
r
• When a signal is quantized, we introduce an
error
- the coded signal is an approximation of the
actual amplitude value.
• The difference between actual and coded value
(midpoint) is referred to as the quantization
error.
• The more zones, the smaller  which results in
smaller errors.
• BUT, the more zones the more bits required to
encode the samples -> higher bit rate
4.45 Department
Departmentof
ofISE
ISE BMS Institute of Technology and Mgmt 15
0
 PCM Decode
r
• To recover an analog signal from a digitized
signal we follow the following steps:
– We use a hold circuit that holds the amplitude value
of
a pulse till the next pulse arrives.
– We pass this signal through a low pass filter with a
cutoff frequency that is equal to the highest
frequency in the pre-sampled signal.
• The higher the value of L, the less distorted a
signal is recovered.
4.46 Department
Departmentof
ofISE
ISE BMS Institute of Technology and Mgmt 15
1
Figure 4.27 Components of a PCM decode
r

4.47 BMS Institute of Technology and Mgmt 15

2
Figure 5.10 Implementation of BASK

5.193
 Model Questions

1.What is data communication? What are its four fundamental characteristics? With a
neat diagram, explain the components of data communication system.

2. List out the functionalities of physical layer, data link layer and network layer?
3. Explain the different levels of addressing used in an internet with a suitable example
for each level of addressing in TCP/IP?
4. With a neat diagram, explain the interaction between layers in the OSI model?
5. Define network topology, explain ring topology with advantages and disadvantages?
6.Explain Encapsulation and Decapsulation
7.Explain Multiplexing and demultiplexing
8. Explain the layered architecture of TCP/IP protocol suite
9. Explain in detail the concept of protocol layering along with its principles.
10. With a neat diag, explain the functionalities of each layer of OSI reference model
11. Explain with the block diagram, the causes for transmission impairement
12. What is line coding? Represent the sequence “101000110” using Biphase and
Bipolar schemes N(RZ-L, NRZ-I and Manchester, differtential Manchester, RZ
and AMI coding )schemes 1-194
• Switching
• An internet is a switched network in which a switch connects
at least two links together. A switch needs to forward data from
a network to another network when required.
• The two most common types of switched networks are
circuit-switched and packet-switched networks.

1-195
• Circuit-Switched Network
• In a circuit-switched network, a dedicated connection, called
a
circuit, is always available between the two end systems;
the switch can only make it active or inactive.

1-196
1-197
• Packet-Switched Network
• In a computer network, the communication between the two ends
is done in blocks of data called packets.
• we see the exchange of individual data packets between the two
computers.
• This allows us to make the switches function for both storing and
forwarding because a packet is an independent entity that can be
stored and sent later

1-198
1-199