DATA COMMUNICATION NETWORKS (EC 6501)

Chapter 2: Data Communications

Lecture 2.4

By
Prof. Santos Kumar Das

12/11/2021 1
Outlines
 CDMA
 WDM
 Error Detection & Correction

12/11/2021 Prof. Santos Kumar Das 2

CDMA (Code Division Multiplexing)

 Used in cellular phones

 Difficult to jam, detect and interfere
 Allows large number of users to share a
common pool of radio frequencies
 Pseudo random code sequences
 Near-far problem
 Geosynchronous satellites

12/11/2021 Prof. Santos Kumar Das 3

CDMA (Code Division Multiplexing)

12/11/2021 Prof. Santos Kumar Das 4

(FDMA, TDMA, CDMA)

12/11/2021 Prof. Santos Kumar Das 5

WDM (Wavelength Division Multiplexing)

 Optical domain version of FDM

 Optical signal modulated at different wavelengths
 Used on fiber optic media with optical multiplexers
and demultiplexers (prisms and diffraction gratings)
 16 wavelengths at OC-48 with bandwidth of 40 Gbps
 32 wavelengths at OC-192 with bandwidth of 320
Gbps
 It goes up to 125 wavelengths

12/11/2021 Prof. Santos Kumar Das 6

WDM (Wavelength Division Multiplexing)
 Designed to use high data rates like
optical fiber.
 Multiplexing allows to combine several
lines into one.
 Same as FDM but operates optical signals
instead of frequency signals.

12/11/2021 Prof. Santos Kumar Das 7

Error Detection & Correction
 Method(s) for detecting and correcting errors in
data transmission, reception, or interpretation.
 All widely used error detection methods are based
on some form of redundant transmission.
 The receiver compares the original message with
the redundant transmission and if the two match,
the original message is assumed to have been
transmitted, received, and interpreted correctly.
 If no match, then transmission error is assumed to
have occurred and the receiver asks the sender to
retransmit the message.
12/11/2021 Prof. Santos Kumar Das 8
Error Detection & Correction

 Even/odd parity
 LRC (Longitudinal redundancy check) and
VRC (Vertical redundancy check)
 Hamming code
 Cyclic Redundancy Checksum (CRC)
 Internet checksum

12/11/2021 Prof. Santos Kumar Das 9

Error Detection & Correction
(Cyclic Redundancy Checksum (CRC))
 It is a more powerful method.
 Embedded to the hardware to make it faster.
 CRC-32, 32 bits or less\
 IEEE 802 standard
 It is designed by division and addition rules
 Perfect for burst error (multibit)
 For CRC calculation Module-2 arithmetic operation is
needed.

12/11/2021 Prof. Santos Kumar Das 10

Error Detection & Correction
(Cyclic Redundancy Checksum (CRC))
 For CRC calculation Module-2 arithmetic operation is
needed.
 Module-2 arithmetic operation:
 Addition without carry
 Subtraction without borrow
 Equivalent to EXOR gate
 1+1 = 0, 0-1 = 1, 1-0 = 0

12/11/2021 Prof. Santos Kumar Das 11

Error Detection & Correction
(Cyclic Redundancy Checksum (CRC))
 Steps of CRC calculation
1. Picks up the data (Actual data)
2. Picks up a divisor (known to the receiver)
3. New data: Actual data + Pad bits (Amend the data with Pad bits (all
zeros) based on the number of bits in the divisor), Pad bits =
number division bits -1
4. Divide the new data by the divisor and obtain the remainder i.e.,
called CRC
5. Replace the padding bits with the CRC
6. Transmitted data = Actual Data + CRC

12/11/2021 Prof. Santos Kumar Das 12

Error Detection & Correction
(Cyclic Redundancy Checksum (CRC))
 Verification of data
 Divide the Transmitted data i.e., (Actual Data + CRC) by the divisor
once again.
 If the reminder is zero then data is valid
 Actual data = remove the CRC from the transmitted data

12/11/2021 Prof. Santos Kumar Das 13

Error Detection & Correction
(Cyclic Redundancy Checksum (CRC))
 Example
 Data : 111001100000 (Polynomial representation: M(x) = x11 +
x10 + x9 + x6 + x5)
 Divisor: 11001 ( 5 bits) (Polynomial representation: G(x) = x4 +
x3 + 1)

 Padding bits: 5 – 1 = 4 i.e., 0000

 New data: 1110011000000000

12/11/2021 Prof. Santos Kumar Das 14

Error Detection & Correction
(Cyclic Redundancy Checksum (CRC))

12/11/2021 Prof. Santos Kumar Das 15

Error Detection & Correction
(Cyclic Redundancy Checksum (CRC))
 New data: 1110011000000000
 After Division process: Reminder i.e., 0110
 Transmitted data = 1110011000000110

12/11/2021 Prof. Santos Kumar Das 16