TDMA - Channelization

Duration: 2 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/computer-networks/dll-access-control/channelization/asset-tdma-channelization 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 lecture introduces Time-Division Multiple Access (TDMA) as a channelization technique where multiple stations share the same frequency bandwidth by dividing transmission time into distinct slots. The instructor contrasts TDMA with Frequency-Division Multiple Access (FDMA) using visual diagrams that plot frequency against time. FDMA is depicted with horizontal bands representing continuous frequency allocation, while TDMA is shown as vertical stripes indicating time-based sharing. A real-world analogy involving a radio station schedule is used to clarify how specific slots are assigned to different users, such as "Morning No 1 Soumya" or "Mid Day Masala RJ MIKE." The core definition states that in TDMA, each station is allocated a specific time slot during which it can send data without interference from others sharing the channel.

Chapters

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

    The instructor introduces TDMA using a slide comparing FDMA and TDMA graphs. The screen displays two frequency-time plots: FDMA with horizontal bands and TDMA with vertical stripes. Text on the slide defines TDMA as a method where stations share bandwidth in time, with each allocated a specific slot for data transmission. The instructor points to the vertical bars of the TDMA graph and writes "RR" above it while gesturing to the audience. A radio station schedule analogy is drawn, circling specific slots like "Morning No 1 Soumya" and "Mid Day Masala RJ MIKE" to illustrate time slot allocation.

  2. 2:00 – 2:19 02:00-02:19

    The segment concludes with a focus on the TDMA diagram showing vertical colored bars representing data transmission slots. The slide text reiterates that stations share channel bandwidth by being allocated specific time slots for data transmission. The presenter stands beside the diagram wearing a black shirt with a "KG KNOWLEDGE GATE" logo, reinforcing the educational context of the channelization method explanation.

The lecture effectively uses visual contrasts and real-world analogies to explain TDMA. The key distinction lies in how resources are partitioned: FDMA divides the frequency spectrum, whereas TDMA divides time. The radio station analogy serves as a concrete example of how non-overlapping slots prevent interference, mirroring the technical operation of TDMA systems. The notation "RR" and specific schedule names provide tangible evidence of slot assignment concepts.

Loading lesson…