Manchester Coding

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/MPPSC-ASSISTANT-PROFESSOR-COMPUTER-SCIENCE-PAPER-2/computer-network-and-information-security/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 | General Studies: State Wise GK
  3. Paper 1 | Information and Communication Technology: Role of Internet and Web Services, Security in Mobile and Wireless Computing
  4. Paper 1 | Current Affairs: GK- Current Affairs
  5. Paper 2 | Discrete Mathematical Structure: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Probability
  6. Paper 2 | Digital Computer Organization And Architecture: Number System, Number Representation, Sequential Circuits, Combinational Circuit, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. Paper 2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  8. Paper 2 | Programming Languages & Object-Oriented Programming Concepts: Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  9. Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  10. Paper 2 | Data Structure And Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Advanced Algorithms
  11. Paper 2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS
  12. Paper 2 | Theory Of Computation: 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 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Enhanced Data Models
  15. Paper 2 | Computer Network And Information Security: Introduction to CN, Data Communication, Application Layer, Hardware basics, Cyber Threats and Malware Attacks, Network Security, 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
  16. Paper 2 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  17. Paper 2 | Current Trends & Technologies: Emerging Tech Trends, Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Fuzzy Sets, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms, Artificial Intelligence, Data Warehousing & Mining, Electronic Data Interchange and E-Commerce, Terms & Abbreviations
  18. Paper 2 | Full Length Mock Tests:
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…