dc 3

In digital transmission systems, data can either be converted from analog to digital
or transmitted directly in digital form (digital to digital conversion). Both processes
are essential in modern communication systems for data storage, transmission,
and processing.

1. Analog to Digital Conversion

Analog signals are continuous signals, such as voice, video, or any data from the
physical world. To transmit these signals over a digital medium or to store them in
digital devices, they must be converted into digital form. This process is called
Analog to Digital Conversion (ADC).
The process of converting an analog signal to a digital signal consists of three
major steps:

1. Sampling

2. Quantization

3. Encoding

1.1. Sampling
Sampling is the process of taking periodic snapshots of an analog signal at
regular intervals. Each snapshot is called a sample.

According to the Nyquist Theorem, the sampling rate must be at least twice
the highest frequency present in the analog signal (this is called the Nyquist
rate) to accurately reconstruct the original signal.
Example:

If an analog signal has a maximum frequency of 4 kHz, the sampling rate

should be at least 8 kHz.

1.2. Quantization
After sampling, each sample has a continuous range of values, but digital
systems can only handle discrete values. Therefore, quantization is the

dc 3 1
 process of approximating each sample to the nearest available value in a
discrete set of levels.

The precision of quantization is determined by the number of bits used to

represent each sample. For example, an 8-bit system can represent 256
discrete levels (2^8 = 256), while a 16-bit system can represent 65,536 levels.
Example:

A sample might have a value of 3.142 in an analog signal, but in

quantization, it would be rounded to the nearest available discrete value,
say 3.14.

1.3. Encoding
Encoding is the final step in the analog-to-digital conversion process. The
quantized values are then converted into a binary format (0s and 1s) for digital
representation.

Once the signal is in binary form, it can be transmitted or stored in digital

systems.

2. Digital to Digital Conversion

In digital to digital conversion, data that is already in digital format (such as
binary data from a computer) is transmitted over a digital medium. The data may
need to be formatted or encoded before transmission to ensure it can be
successfully transmitted over the communication medium and properly decoded
at the receiver’s end.

There are two primary techniques used in digital-to-digital conversion:

1. Line Coding

2. Block Coding

2.1. Line Coding

Line coding is the process of converting a sequence of binary data (0s and 1s)
into a digital signal that can be transmitted over a medium like a copper wire or
fiber optic cable.

dc 3 2
 There are several types of line coding schemes:

Unipolar Encoding: Uses only one voltage level for representing binary 1s, and
no signal (or zero voltage) for binary 0s.

Example:

Binary data 1010 is represented as +V for 1 and 0 for no signal.

Polar Encoding: Uses two voltage levels to represent binary data (positive
voltage for 1, and negative voltage for 0).

Example:

Binary data 1010 could be represented as +V for 1 and -V for 0.

Bipolar Encoding: Also uses two voltage levels, but instead of alternating
between positive and negative for 1 and 0, it alternates for consecutive 1s
while keeping 0 as zero voltage.

Example:

For binary data 1011 , the first 1 could be +V, the second 1 could be -V, and
0 could be zero voltage.

Manchester Encoding: Combines the clock signal with the data signal. A 0 is
represented by a high-to-low transition, and a 1 is represented by a low-to-
high transition within each clock cycle.

Example:

Binary 0 is represented by a falling edge, while binary 1 is represented by

a rising edge.

2.2. Block Coding

Block coding is used to improve the reliability of digital transmission. In this
method, a block of k bits is transformed into a block of n bits (where n > k). This
process introduces redundancy that can be used for error detection and
correction.

4B/5B Coding: A common block coding technique where every group of 4 bits
(k = 4) is replaced by a group of 5 bits (n = 5) to ensure a more balanced and
error-tolerant signal.

dc 3 3
 Example:

The 4-bit data 1011 may be encoded as 11001 in 4B/5B.

Hamming Code: A type of block coding that not only detects errors but also
corrects them. It adds parity bits to a block of data, enabling detection and
correction of single-bit errors.

Summary:
Analog to Digital Conversion transforms real-world analog signals into digital
format using sampling, quantization, and encoding. This process is crucial for
transmitting voice, video, and other analog data over digital systems.
Digital to Digital Conversion involves encoding digital data into a signal that can
be transmitted over a digital communication medium, using techniques like line
coding and block coding for reliable and efficient transmission.
Both processes are integral to modern digital communication systems, enabling
efficient transmission of voice, data, and video across networks.

Line Coding refers to the process of converting binary data (a sequence of 1s and
0s) into a digital signal suitable for transmission over a physical medium, such as a
copper wire, fiber optic cable, or radio waves. The digital signal may involve
variations in voltage, current, or light intensity, depending on the transmission
medium. This process is necessary for synchronizing data transmission and
ensuring that the data can be transmitted without errors or misinterpretation.

Different line coding schemes define how the binary data (0s and 1s) are mapped
to voltage or signal levels in the communication medium.

Key Characteristics of Line Coding:

1. Synchronization: The receiver must be able to detect when a bit starts and
ends. Some line coding schemes have built-in mechanisms for
synchronization.

2. DC Component: Some coding schemes eliminate the DC component, which is

the average of the signal over time. This is important for long-distance
transmission as it reduces power consumption and interference.

dc 3 4
 3. Error Detection: Some line coding schemes include error detection
capabilities by including additional information in the transmitted signal.

4. Bandwidth Efficiency: How efficiently the coding scheme uses the available
bandwidth is a critical consideration.

Types of Line Coding Schemes:

1. Unipolar Encoding
Unipolar NRZ (Non-Return-to-Zero): In this scheme, binary 1 is represented
by a high positive voltage, and binary 0 is represented by zero voltage.

Example: For binary data 1010 , the signal would be high for 1, and zero for
0.

Advantages: Simple to implement.

Disadvantages: Has a significant DC component and lacks synchronization

information, making it inefficient for long-distance transmission.

2. Polar Encoding
In polar schemes, both positive and negative voltage levels are used.

NRZ-Level (Polar NRZ): Binary 1 is represented by a positive voltage, and

binary 0 by a negative voltage.

Example: For binary data 1010 , 1 is represented by a positive voltage (+V),

and 0 by a negative voltage (-V).

NRZ-Inverted (NRZI): In this scheme, a change in the voltage level (either

from positive to negative or negative to positive) indicates a binary 1, and no
change in voltage indicates a binary 0.

Example: If the signal starts at +V and the binary data is 1011 , the signal
will switch between positive and negative at each occurrence of 1, but it
will remain unchanged at 0.

RZ (Return-to-Zero): In this scheme, each bit returns to zero before the next
bit is transmitted. Binary 1 is represented by a positive voltage for half the
duration of the bit period, and binary 0 is represented by a negative voltage
for half the duration.

dc 3 5
 Example: The signal returns to zero after each bit is transmitted, improving
synchronization but doubling the bandwidth required compared to NRZ.

Advantages: Polar encoding schemes help in synchronization and reduce the

DC component.

Disadvantages: Some schemes still face challenges with long sequences of

the same bit value (e.g., too many 0s or 1s).

3. Bipolar Encoding
Bipolar encoding is also known as AMI (Alternate Mark Inversion). It uses three
voltage levels: positive, zero, and negative.

AMI (Alternate Mark Inversion): In AMI, binary 0 is represented by zero

voltage, and binary 1 alternates between positive and negative voltages.

Example: For binary data 1011 , the first 1 might be represented by +V, the
next 0 by 0, the second 1 by -V, and the last 1 by +V.

Advantages: No DC component (the average voltage is zero), and easy error

detection (consecutive positive or negative levels indicate an error).

Disadvantages: May have synchronization issues if there are too many

consecutive zeros.

4. Manchester Encoding
Manchester encoding combines the clock signal with the data, so each bit is
represented by a transition, ensuring synchronization and reducing the DC
component.

Encoding Rules:

Binary 1: Low-to-high transition (from negative to positive voltage).

Binary 0: High-to-low transition (from positive to negative voltage).

Advantages:

Built-in clock signal for synchronization.

No DC component since every bit has a transition.

dc 3 6
 Disadvantages: Requires more bandwidth because there are two signal
changes per bit.

Example:

For binary data 1010 , the waveform would exhibit a transition for each bit. For
1 , a rising edge (low to high), and for 0 , a falling edge (high to low).

5. Differential Manchester Encoding

In Differential Manchester encoding, the data is represented by the presence or
absence of a transition at the beginning of each bit period. A transition occurs at
the midpoint of every bit, but the presence of an additional transition at the start of
a bit determines its value.

Encoding Rules:

Binary 0: A transition at the beginning of the bit period.

Binary 1: No transition at the beginning of the bit period.

Advantages:

Provides good synchronization.

More robust to noise compared to Manchester encoding.

Disadvantages: Requires more bandwidth compared to simpler schemes.

6. 4B/5B Encoding
4B/5B encoding is a block line coding scheme used to ensure synchronization
and avoid long sequences of zeros that can cause synchronization issues. In this
scheme, 4-bit groups of data are converted into 5-bit symbols, which are then
transmitted. The 5-bit code is designed to prevent long sequences of zeros.

Example: The binary data 1010 might be encoded as 11010 .

Advantages:

Provides better error detection and synchronization.

Can ensure a minimum number of signal transitions to help maintain

timing.

dc 3 7
 Disadvantages: Increases the bandwidth since each 4-bit group becomes a
5-bit signal.

Comparison of Line Coding Schemes:

Bandwidth
Scheme Voltage Levels DC Component Synchronization
Efficiency

Unipolar NRZ Positive, Zero High Poor Efficient

Positive,
Polar NRZ None Poor Efficient
Negative

NRZ Inverted Positive,

None Good (for 1's) Efficient
(NRZI) Negative

Positive,
Polar RZ None Good Less Efficient
Negative, Zero

Positive,
Bipolar (AMI) None Good Efficient
Negative, Zero

Positive,
Manchester None Excellent Less Efficient
Negative

Differential Positive,
None Excellent Less Efficient
Manchester Negative

Positive, Moderate
4B/5B None Excellent
Negative Efficiency

Summary:
Line coding is essential in digital communication for converting binary data
into a signal that can be transmitted.

Various line coding schemes offer different trade-offs in terms of

synchronization, bandwidth efficiency, and handling of DC components.

Unipolar, Polar, Bipolar, Manchester, and 4B/5B are some of the commonly
used line coding techniques in different communication systems.

Block Coding and Scrambling are important techniques used in digital data
transmission to improve signal reliability, error detection, and synchronization.

dc 3 8
 They serve different purposes but are often used together to enhance
communication systems.

Block Coding:
Block coding is a method where the source data (typically in binary form) is
divided into fixed-size blocks of bits and then encoded into larger blocks. This is
done to introduce redundancy, error detection, or synchronization capabilities into
the transmitted data.

Key Concepts of Block Coding:

1. Fixed-Size Blocks: Block coding groups the original data into fixed-size
blocks, typically 4 bits, 8 bits, or any other size, and then converts each block
into a coded block of larger size.

2. Redundancy: Extra bits are added to the original data bits to detect or correct
errors at the receiver's end.

3. Error Detection and Correction: By using block coding, the receiver can
detect errors (and sometimes correct them) in the transmitted signal.

Common Block Coding Techniques:

1. 4B/5B Coding:

Purpose: To ensure sufficient transitions in the signal for synchronization.

It replaces each 4-bit group of data with a corresponding 5-bit code.

Example: The 4-bit binary data 1010 might be encoded as 11010 . The extra
bit is introduced to prevent long sequences of zeros, which could cause
synchronization loss.

2. 8B/10B Coding:

Purpose: Commonly used in high-speed data transmission (e.g., Gigabit

Ethernet, Fibre Channel). It encodes 8-bit data into a 10-bit code to ensure
signal transitions and balance between 1s and 0s.

Example: An 8-bit sequence 11001100 might be encoded into a 10-bit

sequence such as 1001110100 .

3. Hamming Code:

dc 3 9
 Purpose: Primarily used for error detection and correction. It adds parity
bits to a block of data to detect and correct single-bit errors.

Example: A 4-bit block such as 1010 could be encoded into a 7-bit block
1010101 by adding three parity bits. The receiver can use these parity bits

to detect and correct errors.

4. Parity Check Code:

Purpose: This is the simplest form of block coding. It adds an extra bit
(parity bit) to a group of data bits. The parity bit can be used to detect if
the number of 1s in the transmitted group is even or odd.

Example: For the data 1010 , a parity bit could be added to make the
number of 1s even, resulting in 10100 .

Benefits of Block Coding:

Error Detection/Correction: Extra bits allow for the detection of transmission
errors, and in some cases, error correction.

Synchronization: Block coding ensures enough signal transitions for the

receiver to remain synchronized with the incoming data.

DC Balance: Many block coding schemes eliminate long strings of zeros or

ones to maintain a balanced signal (no DC bias).

Scrambling:
Scrambling is a technique used to modify a data sequence so that it avoids long
runs of zeros or ones, which can cause problems with synchronization or signal
quality in communication systems. Scrambling ensures that the transmitted signal
has a sufficient number of transitions between 1s and 0s, which helps maintain
synchronization without adding extra bits, as in block coding.

Scrambling modifies the actual data pattern but allows for the original data to be
recovered perfectly at the receiver without loss.

Key Concepts of Scrambling:

1. Maintaining Synchronization: Scrambling ensures that there are enough
signal transitions to maintain synchronization between the transmitter and

dc 3 10
 receiver.

2. Avoiding Long Sequences of Identical Bits: If a transmission contains too

many consecutive 0s or 1s, the receiver may lose track of bit timing.
Scrambling helps prevent this.

3. No Redundancy: Unlike block coding, scrambling doesn't add extra bits. It

simply rearranges the data to ensure the signal properties are maintained.

Types of Scrambling:
1. Self-Synchronizing Scrambler:

In a self-synchronizing scrambler, each output bit is a function of the input

bit and a few previous bits. This means that the scrambling process can be
reversed by using the received signal itself, without needing any additional
synchronization information.

Example: If the input data is 1010 , the scrambler might modify this based
on previous bits, such as converting it to 1101 . The receiver can use the
same algorithm in reverse to recover the original data.

2. Synchronous Scrambler:

A synchronous scrambler uses a fixed sequence of bits (a scrambling key)

to modify the input data. Both the transmitter and receiver know this
scrambling sequence. The receiver uses the same key to de-scramble the
incoming data.

Example: A pseudo-random sequence known to both the transmitter and

receiver is XORed with the data. If the input is 1010 , and the scrambling
key is 0110 , the result would be 1100 .

3. B8ZS (Bipolar 8-Zero Substitution):

Purpose: To avoid long sequences of 0s. B8ZS modifies the signal by

inserting a special pattern whenever eight consecutive 0s are detected in
a bipolar signal.

Example: When eight consecutive 0s are found, B8ZS substitutes the

sequence with two bipolar violations (intentional pattern modifications)
that can be detected and corrected at the receiver.

dc 3 11
 4. HDB3 (High-Density Bipolar-3 Zeros):

Purpose: Similar to B8ZS, this technique substitutes sequences of four or

more zeros with a pattern that includes intentional bipolar violations. This
keeps the signal balanced and ensures synchronization.

Example: If four consecutive zeros are detected, HDB3 substitutes this

sequence with a pattern that ensures enough transitions for
synchronization.

Benefits of Scrambling:
Synchronization: Scrambling ensures sufficient transitions in the signal for the
receiver to maintain synchronization without the need for extra bits.

No Extra Overhead: Scrambling doesn't increase the size of the data, making
it bandwidth efficient.

Prevents Long Sequences of Zeros: Preventing long sequences of identical

bits helps avoid issues with timing recovery at the receiver.

Comparison of Block Coding and Scrambling:

Feature Block Coding Scrambling

Adds extra bits for error Modifies data pattern without

Method
detection and synchronization adding bits

Error detection/correction, Maintain signal integrity,

Purpose
synchronization synchronization

Adds redundancy through extra No redundancy, only re-arranges

Redundancy
bits data

Error Detection Can detect and correct errors No error detection capability

Maintains synchronization by
Provides synchronization
Synchronization avoiding long sequences of
through additional bits
identical bits

Common B8ZS, HDB3, Self-synchronizing

4B/5B, 8B/10B, Hamming Code
Techniques scrambler

Bandwidth May reduce bandwidth More bandwidth efficient, no extra

Efficiency efficiency due to extra bits bits added

dc 3 12
 Summary:
Block Coding adds redundancy to the transmitted data for error detection and
synchronization, making it robust but requiring additional bandwidth.

Scrambling modifies the data sequence without adding extra bits, ensuring
signal integrity and synchronization without increasing bandwidth, making it
more efficient.

Both block coding and scrambling are crucial in digital transmission systems,
often used together to ensure reliable and efficient communication.

dc 3 13