Manchester Coding

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/IOCL-ENGINEERS-OFFICERS-GRADE-A-PAPER-2/computer-networks/data-link-layer-ethernet/manchester-encoding-ge-thomas-ieee-and-differential-manchester-schemes/asset-manchester-coding after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 1 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
  3. Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
  4. Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
  5. Paper 1 | Unit Tests:
  6. Paper 1 | Full-Length Mock Tests:
  7. Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
  8. Paper 2 | Digital Logic: Digital Systems & Boolean Basics Logic Gates & Hardware Boolean Expression Boolean Minimization Combinational Circuit Sequential Circuits Number System Number Representation Registers and Counters Boolean Algebra and Logic Gates Microprocessors and Microcontrollers Logic Families and CMOS Logic Microprocessors Logic Gates and Boolean Algebra Number Systems and Codes Minimization of Boolean Functions Timing, Hazards and Testing Logic Families Combinational Logic Design Arithmetic Circuits Semiconductor Memories and Programmable Logic Devices Combinational Logic Circuits Sequential Circuits and State Machines Latches and Flip-Flops Finite State Machines Minimization of Boolean Functions Arithmetic Circuits Registers and Counters Latches and Flip-Flops Number Systems and Codes
  9. Paper 2 | Computer Architecture: Basics of COA Floating Point Rep Cache Memory Organization Input Output Organisation Pipelining Instr Formats & Modes Control Unit Design Semiconductor Memories and Programmable Logic Processor Organization and Instructions Memory Hierarchy and Input/Output
  10. Paper 2 | Programming and Data Structures: C Fundamentals Control Flow Functions Arrays & Pointers Storage Classes, Structures & Enums DMA, Macros, Scoping & File Handling Introduction to DS Array Stack Queue Linked List Tree Graphs Hashing
  11. Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
  12. Paper 2 | Theory Of Computation/Automata Theory: Introduction to TOC Deterministic FA (DFA) Non-Deterministic FA Regular Expressions Grammar Regular Language Properties Moore & Mealy Machines Pushdown Automata & CFG Turing Machines Complexity Theory
  13. Paper 2 | Compiler Design: Intro to Compilers Lexical Analysis Grammar & CFG Syntax Analysis: Top-Down Syntax Analysis: Bottom-Up Semantic Analysis & SDT Intermediate Code Gen Code Optimization Run Time Environment
  14. Paper 2 | Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management
  15. Paper 2 | DataBase Management System/DBMS: Basics of DBMS ER Diagram Relational Model & Functional Dependencies Keys & Integrity Constraints Normalization (1NF - BCNF) Decomposition Properties & 4NF File Organization & Indexing Relational Algebra SQL Relational Calculus Transaction Management Concurrency Control Database Recovery
  16. Paper 2 | Computer Networks: Introduction to CN DLL: Access Control DLL: Flow Control DLL: Error Control DLL: Framing Data Link Layer - Ethernet Net Layer: IPv4 & Proto Net Layer: IP Addressing Net Layer:Routing Protocol Transport Layer Services TL: Congestion & UDP Application Layer Hardware Basics
  17. Paper 2 | CS/IT Sectional Mock Tests:
  18. Complete Paper Full Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture introduces Manchester encoding as a digital line coding scheme used in data communication. The instructor begins with an implementation slide showing that at the sender, data are converted into a digital signal using the Manchester scheme, while at the receiver the incoming signal is interpreted as Manchester and decoded back into data. A block diagram illustrates a Manchester encoder on the left and a Manchester decoder on the right, connected by a transmission medium labeled Station and Media, with arrows indicating 10 Mbps data flow. The instructor then moves to a whiteboard and hand-draws square-wave signals beneath written bit symbols. The core definition is presented: in Manchester encoding, the duration of each 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, with the mid-bit transition providing synchronization. The board displays stacked waveforms labeled Clock, Data (marked 1 and 0), Manchester as per G.E. Thomas, and Manchester as per IEEE 802.3, alongside a larger teal waveform plotted against a Time axis for the bit sequence 0 1 0 0 1 1. The session emphasizes how the guaranteed mid-bit transition supports clock recovery and distinguishes the two common Manchester conventions.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The presenter stands beside an Implementation slide stating that at the sender data are converted to a digital signal using the Manchester scheme and at the receiver the received signal is interpreted as Manchester and decoded into data. A block diagram shows a Manchester encoder box on the left and a Manchester decoder box on the right, each tied to an arrow labeled 10 Mbps data, joined by a line marked Station and Media. The presenter then turns to the whiteboard and hand-draws a square-wave signal beneath written bit symbols, beginning the waveform demonstration.

  2. 2:00 – 3:31 02:00-03:31

    The whiteboard text reads 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. Stacked waveforms are labeled Clock, Data with 1 and 0 markers, Manchester as per G.E. Thomas, and Manchester as per IEEE 802.3. On the right, a teal waveform is plotted against a Time axis with bit values 0 1 0 0 1 1 above dashed vertical grid lines, and hand-drawn black waveforms with circled transition marks appear across the lower board.

The lesson centers on Manchester encoding as a self-synchronizing line code. The key rule is that each bit period is split into two halves, with a voltage transition at the midpoint; this mid-bit edge supplies synchronization to the receiver. The implementation view frames encoding and decoding as paired operations at sender and receiver over a 10 Mbps link. The waveform comparison distinguishes two conventions, G.E. Thomas and IEEE 802.3, which assign opposite polarity transitions to logical 1 and 0, while the plotted sequence 0 1 0 0 1 1 demonstrates how data bits map to the encoded signal. For revision, students should remember the bit-duration division, the synchronization role of the mid-bit transition, and the difference between the two Manchester standards.

Loading lesson…