Preamble and SFD

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/computer-networks/data-link-layer-ethernet/ethernet-frame-format-preamble-sfd/asset-preamble-and-sfd after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. General Aptitude & Reasoning: Number System, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Speed Time and Distance, Mixture and Alligation, Data Interpretation, Algebra, Probability, Permutation and Combination, Venn Diagram, HCF LCM, Divisibility Rules, Age Problems, Pipe and Cistern, Partnership, Linear Algebra, Sequence and Series (Series), Statistics, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Calculus, Trigonometry, Vectors, Speed Mathematics and Basic Mathematics, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Series (Number and Letter Series) (Numerical Relations and Reasoning), Puzzle Solving (Puzzles), Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Calendar, Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Clock, Analytical Reasoning (Counting Figures Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Inequality, Data Sufficiency, Cubes & Dices
  3. Computer Networks & Cybersecurity: Introduction to CN, Data Communication, 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, Network Security
  4. Programming, Data Structures & Algorithms: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  5. AI, Machine Learning, Big Data & Cloud: Emerging Tech Trends, Artificial Intelligence, Big Data Systems, Approaches to AI, Search Algorithms, Knowledge Representation, Cloud Computing
  6. Digital Logic & Computer Organization: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, 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. TOC & Compiler: 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, 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
  8. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  9. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Distributed Systems
  10. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Object Oriented Technology, HTML Basics, JavaScript-Basics, Java, XML
  11. Database Management System: 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, Data Warehousing & Mining, Enhanced Data Models, NoSQL
  12. Other Recurring CS Topics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, Multimedia
  13. Live Classes: ISRO Live classes
  14. Full Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This short lecture segment introduces the Preamble and Start Frame Delimiter (SFD) fields of an Ethernet frame. The instructor presents a slide titled “Preamble,” defining it as a 7-byte field containing alternating 0s and 1s, equivalent to 56 bits. The slide notes that the Preamble is added at the physical layer and serves synchronization purposes. An Ethernet frame diagram labels the fields in order: Preamble (7 bytes), SFD (1 byte), Destination address (6 bytes), Source address (6 bytes), Length (2 bytes), Data and padding, and CRC (4 bytes). The instructor circles the Destination and Source address fields. On-screen notes also mention minimum payload length of 46 bytes, maximum payload length of 1500 bytes, and minimum frame length of 512 bits or 64 bytes. The lesson then transitions to the SFD slide, stating that it is a 1-byte field always set to 10101011, with the final two bits “11” marking the beginning of the frame. The SFD is also added at the physical layer, and a note indicates that historically only the SFD existed before the Preamble was added later.

Chapters

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

    The slide titled “Preamble” defines the field as a 7-byte sequence of alternating 0s and 1s, shown on-screen as “Preamble: 56 bits of alternating 1s and 0s.” The instructor explains that the Preamble is added at the physical layer for synchronization. An Ethernet frame diagram displays labeled blocks: Preamble (7 bytes), SFD (1 byte), Destination address (6 bytes), Source address (6 bytes), Length (2 bytes), Data and padding, and CRC (4 bytes). Handwritten ovals circle the Destination and Source address fields. Additional on-screen notes state minimum payload length 46 bytes, maximum payload length 1500 bytes, and minimum frame length 512 bits or 64 bytes.

  2. 2:00 – 2:53 02:00-02:53

    The presentation switches to a slide titled “Start Frame Delimiter (SFD),” which states that the SFD is a 1-byte field always set to “10101011.” The slide highlights that the last two bits, “11,” mark the beginning of the frame and that the SFD is added at the physical layer. A note below reads “only SFD was there Preamble was added later,” indicating the historical development of these fields. The instructor gestures while explaining, and the frame diagram remains visible with Preamble labeled as 7 bytes and SFD as 1 byte.

The central teaching point is the structure and purpose of the Preamble and SFD in Ethernet framing. The Preamble provides synchronization through a 7-byte alternating bit pattern, while the SFD signals frame start with its fixed value 10101011, where the trailing “11” distinguishes it from the alternating pattern. Both fields are physical-layer additions, and the diagram situates them before the data-link layer addresses and payload. The historical note that SFD preceded Preamble adds context for why both exist.

Loading lesson…