Ripple and Asynchronous Counter Further

Duration: 7 min

This video lesson is available to enrolled students.

Return to /learn/BPSC/digital-electronics/sequential-circuits/ripple-async-counters/asset-ripple-and-asynchronous-counter-further after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the Course: About the Course
  2. Section 1 | Language (Hindi): भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, संधि, समास, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, मुहावरे और लोकोक्तियाँ, अपठित गद्यांश और अपठित पद्यांश, Multi-Topic Content (Cross-Concept Material), वर्णमाला
  3. Section 1 | Language (उर्दू भाषा — 22 प्रश्न (निश्चित)): Spelling & Diacritics, Grammar (اسم, فعل, صفت, ضمیر), Vocabulary, Idioms & Proverbs, Comprehension
  4. Section 1 | Language (বাংলা / बांग्ला भाषा — 22 प्रश्न (निश्चित)): Bangla Script and Sounds, Bangla Grammar and Usage, Bangla Word Formation and Vocabulary, Reading and Text Interpretation
  5. Section 1 | Language (English): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Verb, Adverb, Preposition, Articles, Determiner, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Facts, Inference and Judgements
  6. Section 2 | Primary Maths & Reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Mensuration and Geometry, Age Problems, Arithmetic, Powers and Exponents (Surds and Indices), Algebra, Probability, Trigonometry, Syllogisms, Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence
  7. Section 2 | General Awareness (GK + Current Affairs): Polity, Physics, Biology, State Wise GK, Chemistry, History, Geography, Indian Economy, Environment, GK- Current Affairs, Static General Knowledge
  8. Section 3 | Computer System and Org. (CSO): Basics of COA, Floating Point Rep, Cache Memory Organization, Instr Formats & Modes, Programming the Basic Computer, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design
  9. Section 3 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, SQL, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control
  10. Section 3 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Process Synchronization
  11. Section 3 | Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics
  12. Section 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Shortest Path Algos
  13. Section 3 | Theory Of Computation & Compiler Design: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
  14. Section 3 | Emerging Trends (AI, Societal Ethics & MS Office): Artificial Intelligence, Emerging Tech Trends, Society, Law & Ethics, MS Office Applications
  15. Section 3 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Maintenance and Configuration Management, Software Testing
  16. Section 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  17. Section 3 | OOPS, C++, JAVA, HTML: OOPS with C++, Java, HTML Basics, CSS
  18. Section 3 | Java: Java Fundamentals, Array, String, IO & References
  19. Section 3 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  20. Section 3 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  21. Section 3 | Multimedia: Multimedia
  22. BPSC Previous Year Papers:
  23. BPSC Full Mock Tests:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The lecture focuses on analyzing a digital logic circuit to determine its counting behavior. The instructor presents a schematic of a 3-bit counter using T flip-flops and systematically derives the state transitions. By analyzing the connections between the flip-flops and the clock signals, he constructs a state table and a state diagram to identify the specific counting sequence, ultimately classifying the circuit as a binary up-counter.

Chapters

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

    The video begins with the problem statement: "What is the counting behavior of the given counter?" displayed at the top. The instructor points to a circuit diagram featuring three T flip-flops labeled with outputs Q0, Q1, and Q2. He notes that the T input for the first flip-flop is connected to logic '1', and this line extends to the T inputs of the subsequent flip-flops, meaning T=1 for all stages. The external "Clock" signal drives the first flip-flop, while the Q output of each stage drives the clock input of the next stage. He sets up a state table on the left with columns for "Present State" (Q2p, Q1p, Q0p) and "Next State" (Q2N, Q1N, Q0N) to track the transitions.

  2. 2:00 – 5:00 02:00-05:00

    The instructor derives the excitation equations for the T flip-flops. He writes the general characteristic equation Qn+1 = T XOR Qn at the top. Since T is connected to 1, the equation simplifies to Qn+1 = 1 XOR Qn, which is equivalent to the complement Qn_bar. He observes that the clock inputs have bubbles, indicating negative edge-triggered flip-flops. He writes specific conditions on the board: "If (Q0: 1 -> 0) T M", explaining that the second flip-flop toggles only when the first flip-flop's output falls from 1 to 0. He similarly deduces that Q1 toggles when Q0 falls, and Q2 toggles when Q1 falls. He writes the simplified next state equations Q0N = Q0P_bar, Q1N = Q1P_bar, and Q2N = Q2P_bar to represent the toggle behavior.

  3. 5:00 – 7:18 05:00-07:18

    The instructor proceeds to fill the state table to find the sequence. Starting from the initial state 000, he determines the next state. Since Q0 toggles on every clock pulse, the state becomes 001. On the next pulse, Q0 toggles back to 0, creating a falling edge for the second flip-flop, causing Q1 to toggle to 1, resulting in state 010. He continues this process, filling the table rows: 011, 100, 101, 110, 111. Finally, he draws a state transition diagram at the top showing the sequence 0 -> 1 -> 2 -> 3 -> 4 -> 5 -> 6 -> 7 -> 0. This confirms the circuit is a 3-bit binary up-counter.

The lesson demonstrates a standard method for analyzing asynchronous sequential circuits. By identifying the flip-flop type (T), the input conditions (T=1), and the clocking scheme (ripple/negative edge), the counting sequence is derived. The key takeaway is that a ripple counter with T=1 and negative edge-triggered flip-flops connected in a chain (Q to Clock) functions as a binary up-counter. The state table and diagram provide a visual verification of the counting sequence from 0 to 7.

Loading lesson…