Line Coding Schemes ‏Line coding is the process of converting binary data, a sequence of bits to a digital signal. Authors Phani Swathi Chitta Mentor Prof.

Slides:



Advertisements
Similar presentations
Logical Operations on Images Boolean logic is a system of logical operations defined by George Boole in the mid 19th century to apply algebraic operations.
Advertisements

High Boost filtering In image processing, it is often desirable to emphasize high frequency components representing the image details without eliminating.
1 Computer Communication & Networks Lecture 6 Physical Layer: Digital Transmission Waleed Ejaz
4.2 Digital Transmission Pulse Modulation (Part 2.1)
Computer Networks1 Chapter 4 Digital Transmission.
The Physical Layer, Encoding Schemes: -Physical Transmission of Bits- Chapter 2.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Chapter 4 Digital Transmission.
Hamming Code A Hamming code is a linear error-correcting code named after its inventor, Richard Hamming. Hamming codes can detect up to two bit errors,
DIGITAL-TO-DIGITAL CONVERSION
Syndrome Decoding of Linear Block Code
Binary Exponential Backoff Binary exponential backoff refers to a collision resolution mechanism used in random access MAC protocols. This algorithm is.
Document that explains the chosen concept to the animator.
EE 3220: Digital Communication Dr. Hassan Yousif Ahmed Department of Electrical Engineering College of Engineering at Wadi Aldwasser Slman bin Abdulaziz.
Computer Communication & Networks Lecture # 05 Physical Layer: Signals & Digital Transmission Nadeem Majeed Choudhary
1 Kyung Hee University Digital Transmission. 2 Kyung Hee University 4 장 Digital Transmission 4.1 Line Coding 4.2 Block Coding 4.3 Sampling 4.4 Transmission.
: Data Communication and Computer Networks
British Computer Society (BCS)
Line Coding Acknowledgments:
Digital Communications
Kashif BashirWWW.Taleem.greatnow.com Chapter 4 Digital Transmission.
9/12/ Digital Transmisison - Lin 1 CPET/ECET Digital Transmission Data Communications and Networking Fall 2004 Professor Paul I-Hai Lin Electrical.
COMMUNICATION SYSTEM EEEB453 Chapter 5 (Part V) DIGITAL TRANSMISSION-LINE ENCODING Intan Shafinaz Mustafa Dept of Electrical Engineering Universiti Tenaga.
Unit 1 Lecture 6 1. Different Conversion/Transmission Schemes 2 Before we discuss various line coding schemes, let us first have an idea of different.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Excerpts from Slides of Chapter 4 Forouzan Digital Transmission.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Chapter 4 Digital Transmission.
1 Chapter 5 Encoding. 2 Figure 4-1 Transformation of Information to Signals.
NET 222: COMMUNICATIONS AND NETWORKS FUNDAMENTALS ( NET 222: COMMUNICATIONS AND NETWORKS FUNDAMENTALS (PRACTICAL PART) Tutorial 4 : Chapter 5 Data & computer.
Convolutional Coding In telecommunication, a convolutional code is a type of error- correcting code in which m-bit information symbol to be encoded is.
Chapter 4 (part 1_a) Baseband Data Transmission EKT 357 Digital Communications.
Edge Detection using Laplacian of Gaussian Edge detection is a fundamental tool in image processing and computer vision. It identifies points in a digital.
Digital Line Encoding Converting standard logic level to a form more suitable to telephone line transmission. Six factors must be considered when selecting.
Gaussian Smoothing Gaussian Smoothing is the result of blurring an image by a Gaussian function. It is also known as Gaussian blur.  Course Name: Digital.
CSMA/CD Simulation Carrier Sense Multiple Access (CSMA), although more efficient than ALOHA or slotted ALOHA, still has one glaring inefficiency: When.
Linear Search Linear Search is a fundamental search algorithm. Linear search, also known as sequential search, is a process that checks every element in.
Median Filtering In signal processing, it is often desirable to be able to perform some kind of noise reduction on an image or signal. The median filter.
Go-Back-N ARQ (Sliding Window Protocol) Go-Back-N is an instance of the Automatic Repeat-request (ARQ) Protocol, in which the sending process continues.
Document that explains the chosen concept to the animator 1.
Process Scheduling In multiprogramming systems, when there is more than one ready process, the operating system must decide which one to activate. The.
What is Line Coding? Mapping of binary information sequence into the digital signal that enters the channel Ex. “1” maps to +A square pulse; “0” to –A.
Introduction to Information Technologies
DIGITAL TRANSMISSION PART C
Data Conversion Methods
Net 222: Communications and networks fundamentals (Practical Part)
Physical Layer (Part 2) Data Encoding Techniques
Lecture 1 Line Encoding 2nd semester
Line Codes and Their Spectra
Prof. Saravanan Vijayakumaran
Line Codes and Their Spectra
NET301 Lecture 5 10/18/2015 Lect5 NET301.
NET301 Lecture 5 10/18/2015 Lect5 NET301.
CCE Computer Networks Chapter 5: Encoding Information must be encoded into signals before it can be transported across communication media Information.
Introduction to Information Technologies
Chapter 4 Digital Transmission
Dilation The basic morphological operations applied to either grayscale or binary images are Erosion and Dilation. Erosion shrinks image objects while.
Closing One of the important morphological operations applied to either grayscale or binary images is Closing. It is derived from the fundamental operations.
Erosion The basic morphological operations applied to either grayscale or binary images are Erosion and Dilation. Erosion shrinks image objects while.
NRZ-L: [Non-Return-to-Zero-Level]
Virtual Memory Virtual memory is a technique which gives an application program the impression that it has contiguous working memory, while in fact it.
Binary Search A binary search algorithm finds the position of a specified value within a sorted array. Binary search is a technique for searching an ordered.
Sorted Linked List A linked list is a data structure that consists of a sequence of data records such that in each record there is a field that contains.
Lecture 2: Line Encoding 1nd semester By: Adal ALashban.
Prof. Saravanan Vijayakumaran
Discrete Convolution of Two Signals
Continuous Time Convolution
Data Transmission And Digital Communication
Chapter 5: Encoding Information must be encoded into signals before it can be transported across communication media Information can be either Digital,
CS433 - Data Communication and Computer Networks
Party Problem The simplest example of Ramsey theory. It is also known as the ‘Maximum Clique Problem’. A clique of a graph is a complete sub graph of the.
Opening One of the important morphological operations applied to either grayscale or binary images is Opening. It is derived from the fundamental operations.
Image Sharpening using Laplacian
Presentation transcript:

Line Coding Schemes ‏Line coding is the process of converting binary data, a sequence of bits to a digital signal. Authors Phani Swathi Chitta Mentor Prof. Saravanan Vijayakumaran Course Name: Data Communications Level : UG

Learning Objectives After interacting with this Learning Object, the learner will be able to: Convert the sequence of binary digits into a digital signal

Definitions of the components/Keywords: Binary data can be transmitted using a number of different types of pulses. The choice of a particular pair of pulses to represent the symbols 1 and 0 is called Line Coding.

Master Layout Input Data Digital Signal

Step 1: unipolar NRZ (Non Return to Zero) I nstruction for the animator T ext to be displayed in the working area (DT) The first fig should appear then the second fig should appear. In parallel to the figures the text should be displayed. Bit 0 is mapped to amplitude close to zero Bit 1 is mapped to a positive amplitude A DC component is present Representation of 0Representation of 1

Step 2: Polar NRZ (Non Return to Zero) I nstruction for the animator T ext to be displayed in the working area (DT) The first fig should appear then the second fig should appear. In parallel to the figures the text should be displayed. Bit 0 is mapped to a negative amplitude Bit 1 is mapped to a positive amplitude A DC component is present Representation of 0Representation of 1

Step 3: Polar RZ (Return to Zero) I nstruction for the animator T ext to be displayed in the working area (DT) The first fig should appear then the second fig should appear. In parallel to the figures the text should be displayed. A bit 0 is mapped to a negative amplitude −A for the first half of the symbol duration followed by a zero amplitude for the second half of the symbol duration. A bit 1 is mapped to a positive amplitude +A for the first half of the bit duration followed by a zero amplitude for the second half of the bit duration. Representation of 0Representation of 1

Step 4: NRZI (Non Return to Zero Inverted) I nstruction for the animator T ext to be displayed in the working area (DT) The first fig should appear then the second fig should appear. In parallel to the figures the text should be displayed. Bit 0 mapped to no signal level transition Bit 1 is mapped to signal level transition at the beginning of the bit interval Assumption: The signal level to the left of the bit is high– Fig. A and Fig. C The signal level to the left of the bit is low – Fig. B and Fig. D Representation of 0Representation of 1 Fig. A Fig. B Fig. C Fig. D

Step 5: Manchester coding I nstruction for the animator T ext to be displayed in the working area (DT) The first fig should appear then the second fig should appear. In parallel to the figures the text should be displayed. Bit 0 is sent by having a mid-bit transition from high to low. Bit 1 is sent by having a mid-bit transition from low to high. Representation of 0Representation of 1

Step 6: Differential Manchester coding I nstruction for the animator T ext to be displayed in the working area (DT) The first fig should appear then the second fig should appear. In parallel to the figures the text should be displayed. Bit 0 is mapped to signal level transition at the beginning of the bit interval. Bit 1 is mapped to absence of signal level transition at the beginning of the bit interval. Assumption: The signal level to the left of the bit is high – Fig. A and Fig. C The signal level to the left of the bit is low – Fig. B and Fig. D Representation of 0Representation of 1 Fig. A Fig. B Fig. C Fig. D

The corresponding waveforms should be shown in the demo part when a particular line code is selected.

Illustration of different line coding schemes

Line coding Scheme Representation of 0 Representation of 1 Unipolar NRZ Polar NRZ Polar RZ The signal level to the left of the bit is high Assumption: Include Slides 13 and 14 in the theory part

Line coding Scheme Representation of 0 Representation of 1 NRZI Manchester Differential Manchester

Introduction Credits 15 Definitions Test your understanding (questionnaire) ‏ Lets Sum up (summary) ‏ Want to know more… (Further Reading) ‏ Try it yourself Interactivity: Analogy Slide 1 Slide 3 Slide 14,15 Slide 17 Slide 16 Electrical Engineering Input Data Digital Signal  Select the coding scheme Uni polar NRZ Polar NRZ Polar RZ NRZI Manchester Differential Manchester  Enter 11 bit input data

Questionnaire 1.What is the Differential Manchester waveform corresponding to the bit string Note: The signal level before the first bit is assumed to be high Answers: a) b) ‏

What is the D ifferential Manchester waveform for the bit string Note: T he signal level to the left of the first bit in the string is low Answers: a) b) ‏ Questionnaire

Links for further reading Reference websites: Books: “Communication Systems” by Simon Haykin, fourth Edition “Data and Computer Communications” by William Stallings, eighth Edition Research papers:

Summary Binary data can be transmitted using a number of different types of pulses. The choice of a particular pair of pulses to represent the symbols 1 and 0 is called Line Coding. ‏Line coding is the process of converting binary data, a sequence of bits to a digital signal.