Johnson Counter

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/digital-electronics/sequential-circuits/ring-johnson-counters/asset-johnson-counter 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.

The video lecture introduces the Johnson Counter, also known as a Twisted Ring Counter or Switch-tail Ring Counter. The instructor explains that while a standard k-bit ring counter provides k distinguishable states, a switch-tail configuration doubles this number. The defining characteristic is a circular shift register where the complemented output (Q-bar) of the last flip-flop is connected to the input (D) of the first flip-flop. The instructor uses a 4-bit D flip-flop diagram to illustrate this feedback loop. He then begins to construct a state table to demonstrate the counting sequence, starting with an initial state of 0000. Finally, he derives the formula for the total number of states in a Johnson counter, which is 2n, and calculates it for a 4-bit system.

Chapters

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

    The instructor defines the Johnson Counter using on-screen text that describes it as a 'circular shift register with the complemented output of the last flip-flop connected to the input of the first flip-flop.' He points to a diagram of four D flip-flops connected in a shift register, highlighting the feedback path from the inverted output of the last stage to the input of the first. He then draws a state table with columns for CLK, Q0, Q1, Q2, and Q3. He populates the initial row (CLK 0) with zeros (0000) and draws arrows to visualize the shifting of bits from one flip-flop to the next, preparing to trace the sequence.

  2. 2:00 – 2:44 02:00-02:44

    The instructor focuses on calculating parameters for this specific counter configuration. He writes the general formula '2^n - 2n' on the board. He substitutes n=4 into the equation, writing '2^4 - 2(4) = 16 - 8'. This calculation highlights the relationship between the total possible states (2^n) and the valid states (2n) for a Johnson counter. He emphasizes this formula as a key property of the switch-tail ring counter.

The lecture progresses from a theoretical definition to a practical calculation. It starts by distinguishing the Johnson Counter from a standard ring counter based on its feedback mechanism (complemented output). The instructor visually demonstrates the circuit structure and begins the process of analyzing its state sequence using a table. The lesson culminates in a mathematical derivation of the counter's modulus (number of states), establishing the formula 2n as a critical takeaway for exam preparation.

Loading lesson…