Ring Counter

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/BIHAR-POLYTECHNIC-LECTURER-COMPUTER-SCIENCE/digital-logic/sequential-circuits/ring-johnson-counters/asset-ring-counter after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Discrete Mathematics: Permutation, Combination and Probability / क्रमचय, संचय एवं प्रायिकता, Set Theory, Relations, Functions, Propositional and Predicate Logic, Graph Theory, Group Theory
  2. Digital Logic: Digital Systems & Boolean Basics, Boolean Expression, Boolean Minimization, Logic Gates & Hardware, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  3. Computer Organization and Architecture: Basics of COA, Programming the Basic Computer, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Pipelining, Multiprocessors
  4. Programming: Language Design, C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++
  5. Data Structures: Introduction to DS, Array, Linked List, Stack, Queue, Tree, Graphs, Hashing
  6. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  7. Theory of Computation: Grammar, Regular Language Properties, Moore & Mealy Machines, Turing Machines
  8. 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, Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Pushdown Automata & CFG, Complexity Theory
  9. Operating Systems: 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, Security
  10. Database Management Systems: 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, ORDBMS, NoSQL
  11. Computer Networks: 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
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a detailed lecture on the 4-bit Ring Counter, a specific type of digital circuit used for timing signals. The instructor begins by defining the Ring Counter as a circular shift register where only a single flip-flop is set at any given moment, while all others remain cleared. He explains the physical wiring, noting that the output of the final flip-flop is fed back into the input of the first flip-flop. The lecture then transitions to a practical demonstration using a truth table to show the shifting sequence of the single '1' bit. Finally, the instructor calculates the number of unused states for the counter using a specific formula, emphasizing the efficiency limitations of this design compared to other counters.

Chapters

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

    The instructor introduces the topic "4-Bit Ring Counter" displayed on the slide. He reads and explains the definition: "A ring counter is a circular shift register with only one flip-flop being set at any particular time; all others are cleared." He points to the diagram showing four D flip-flops (DFF) connected in a chain. He highlights the text "Output of the last flip-flop is connected to the input of the first flip-flop in case of ring counter." He also points out the formula "No. of states in Ring counter = No. of flip-flop used," establishing the relationship between the hardware components and the counting sequence length.

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

    The instructor moves to a whiteboard to demonstrate the operation. He draws a table with columns labeled CLK, Q3, Q2, Q1, and Q0. He explains the initial state where Q3 is '1' and the rest are '0'. He draws arrows to visualize the bit shifting right with each clock pulse. He fills the table rows: CLK 0 is 1000, CLK 1 is 0100, CLK 2 is 0010, and CLK 3 is 0001. After showing the cycle repeats, he introduces the concept of unused states. He writes the formula "Number of unused states in Ring Counter is 2^n - n". He substitutes n=4 to get "16 - 4 = 12". He also briefly writes "2^8 - 8 = 248" to illustrate the calculation for a larger counter, showing how the number of unused states grows significantly.

  3. 5:00 – 5:05 05:00-05:05

    The video concludes with the instructor standing next to the board showing the final calculation. The visible text "16 - 4 = 12" and the formula "2^n - n" are clearly displayed, summarizing the key takeaway regarding the efficiency of the ring counter design.

The lecture follows a logical progression from theoretical definition to practical application and finally to performance analysis. It starts by establishing the Ring Counter as a specific type of shift register with a unique feedback loop. The instructor then visualizes the timing sequence using a state table, making the abstract concept of "shifting" concrete. The lesson concludes by quantifying the "wasted" states in the system, providing a critical metric for digital design students to understand why Ring Counters are used for specific timing applications rather than general counting.

Loading lesson…