This document discusses synchronous and asynchronous counters. It begins by explaining the basic concepts of asynchronous and synchronous counters, noting the key difference that synchronous counters have all flip-flops share the same clock signal, so their outputs change simultaneously. The document then provides details on designing various types of counters, including synchronous up/down counters and higher modulus counters using cascading. It also discusses advantages of synchronous counters over asynchronous counters, such as not having propagation delays or being able to design random counting sequences.
Digital clock (mod counters)using DSCH (DIGITAL SCHEMATIC) by Gaurav RaikarGauravRaikar3
The DSCH program is a logic editor and simulator. DSCH provides a user-friendly environment for hierarchical logic design, and fast simulation with delay analysis, which allows the design and validation of complex logic structures.
Modulus counters, or simply MOD counters, are defined based on the number of states that the counter will sequence through before returning back to its original value.
Digital clock (mod counters)using DSCH (DIGITAL SCHEMATIC) by Gaurav RaikarGauravRaikar3
The DSCH program is a logic editor and simulator. DSCH provides a user-friendly environment for hierarchical logic design, and fast simulation with delay analysis, which allows the design and validation of complex logic structures.
Modulus counters, or simply MOD counters, are defined based on the number of states that the counter will sequence through before returning back to its original value.
Question bank on digital electronics. Total 194 questions. Covering questions on basics of digital electronics, number systems, digital gates, logic families, the sum of product, the product of sum, boolean theorem, karnaugh map, coders, etc.
Question bank on digital electronics. Total 194 questions. Covering questions on basics of digital electronics, number systems, digital gates, logic families, the sum of product, the product of sum, boolean theorem, karnaugh map, coders, etc.
The following presentation is a part of the level 4 module -- Electrical and Electronic Principles. This resources is a part of the 2009/2010 Engineering (foundation degree, BEng and HN) courses from University of Wales Newport (course codes H101, H691, H620, HH37 and 001H). This resource is a part of the core modules for the full time 1st year undergraduate programme.
The BEng & Foundation Degrees and HNC/D in Engineering are designed to meet the needs of employers by placing the emphasis on the theoretical, practical and vocational aspects of engineering within the workplace and beyond. Engineering is becoming more high profile, and therefore more in demand as a skill set, in today’s high-tech world. This course has been designed to provide you with knowledge, skills and practical experience encountered in everyday engineering environments.
A digital clock is a type of clock that displays the time digitally (i.e. in numerals or other symbols), as opposed to an analog clock, where the time is indicated by the positions of rotating hands.
Counters:
Introduction, Asynchronous counter, Terms related to counters, IC-7493 (4-bit binary counter), Synchronous counter, Bushing, Type T-Design, Type JK Design, Presettable counter, IC-7490, IC 7492, Synchronous counter ICs, Analysis of counter circuits
Design and Development of Digital control based Asymmetric Multilevel Inverte...idescitation
Multilevel inverter is an effective topology for
increasing power demand and reducing harmonics of AC
waveforms. This paper presents an efficient seven-level
asymmetric cascaded multilevel inverter suited for renewable
energy applications. A digital control method employing flip-
flops has been proposed which reduces Total Harmonic
Distortion (THD) and switching losses compared to the
conventional PWM technique. Various performance
parameters namely THD, switching loss, first-order distortion
factor (DF1) and second-order distortion factor (DF2) is
analyzed and a simulation model of the proposed digital
control is developed in MATLAB/SIMULINK. Hardware
prototype will be built to validate the results.
UiPath Test Automation using UiPath Test Suite series, part 6DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 6. In this session, we will cover Test Automation with generative AI and Open AI.
UiPath Test Automation with generative AI and Open AI webinar offers an in-depth exploration of leveraging cutting-edge technologies for test automation within the UiPath platform. Attendees will delve into the integration of generative AI, a test automation solution, with Open AI advanced natural language processing capabilities.
Throughout the session, participants will discover how this synergy empowers testers to automate repetitive tasks, enhance testing accuracy, and expedite the software testing life cycle. Topics covered include the seamless integration process, practical use cases, and the benefits of harnessing AI-driven automation for UiPath testing initiatives. By attending this webinar, testers, and automation professionals can gain valuable insights into harnessing the power of AI to optimize their test automation workflows within the UiPath ecosystem, ultimately driving efficiency and quality in software development processes.
What will you get from this session?
1. Insights into integrating generative AI.
2. Understanding how this integration enhances test automation within the UiPath platform
3. Practical demonstrations
4. Exploration of real-world use cases illustrating the benefits of AI-driven test automation for UiPath
Topics covered:
What is generative AI
Test Automation with generative AI and Open AI.
UiPath integration with generative AI
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
GraphSummit Singapore | The Future of Agility: Supercharging Digital Transfor...Neo4j
Leonard Jayamohan, Partner & Generative AI Lead, Deloitte
This keynote will reveal how Deloitte leverages Neo4j’s graph power for groundbreaking digital twin solutions, achieving a staggering 100x performance boost. Discover the essential role knowledge graphs play in successful generative AI implementations. Plus, get an exclusive look at an innovative Neo4j + Generative AI solution Deloitte is developing in-house.
How to Get CNIC Information System with Paksim Ga.pptxdanishmna97
Pakdata Cf is a groundbreaking system designed to streamline and facilitate access to CNIC information. This innovative platform leverages advanced technology to provide users with efficient and secure access to their CNIC details.
Communications Mining Series - Zero to Hero - Session 1DianaGray10
This session provides introduction to UiPath Communication Mining, importance and platform overview. You will acquire a good understand of the phases in Communication Mining as we go over the platform with you. Topics covered:
• Communication Mining Overview
• Why is it important?
• How can it help today’s business and the benefits
• Phases in Communication Mining
• Demo on Platform overview
• Q/A
Removing Uninteresting Bytes in Software FuzzingAftab Hussain
Imagine a world where software fuzzing, the process of mutating bytes in test seeds to uncover hidden and erroneous program behaviors, becomes faster and more effective. A lot depends on the initial seeds, which can significantly dictate the trajectory of a fuzzing campaign, particularly in terms of how long it takes to uncover interesting behaviour in your code. We introduce DIAR, a technique designed to speedup fuzzing campaigns by pinpointing and eliminating those uninteresting bytes in the seeds. Picture this: instead of wasting valuable resources on meaningless mutations in large, bloated seeds, DIAR removes the unnecessary bytes, streamlining the entire process.
In this work, we equipped AFL, a popular fuzzer, with DIAR and examined two critical Linux libraries -- Libxml's xmllint, a tool for parsing xml documents, and Binutil's readelf, an essential debugging and security analysis command-line tool used to display detailed information about ELF (Executable and Linkable Format). Our preliminary results show that AFL+DIAR does not only discover new paths more quickly but also achieves higher coverage overall. This work thus showcases how starting with lean and optimized seeds can lead to faster, more comprehensive fuzzing campaigns -- and DIAR helps you find such seeds.
- These are slides of the talk given at IEEE International Conference on Software Testing Verification and Validation Workshop, ICSTW 2022.
Goodbye Windows 11: Make Way for Nitrux Linux 3.5.0!SOFTTECHHUB
As the digital landscape continually evolves, operating systems play a critical role in shaping user experiences and productivity. The launch of Nitrux Linux 3.5.0 marks a significant milestone, offering a robust alternative to traditional systems such as Windows 11. This article delves into the essence of Nitrux Linux 3.5.0, exploring its unique features, advantages, and how it stands as a compelling choice for both casual users and tech enthusiasts.
UiPath Test Automation using UiPath Test Suite series, part 5DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 5. In this session, we will cover CI/CD with devops.
Topics covered:
CI/CD with in UiPath
End-to-end overview of CI/CD pipeline with Azure devops
Speaker:
Lyndsey Byblow, Test Suite Sales Engineer @ UiPath, Inc.
zkStudyClub - Reef: Fast Succinct Non-Interactive Zero-Knowledge Regex ProofsAlex Pruden
This paper presents Reef, a system for generating publicly verifiable succinct non-interactive zero-knowledge proofs that a committed document matches or does not match a regular expression. We describe applications such as proving the strength of passwords, the provenance of email despite redactions, the validity of oblivious DNS queries, and the existence of mutations in DNA. Reef supports the Perl Compatible Regular Expression syntax, including wildcards, alternation, ranges, capture groups, Kleene star, negations, and lookarounds. Reef introduces a new type of automata, Skipping Alternating Finite Automata (SAFA), that skips irrelevant parts of a document when producing proofs without undermining soundness, and instantiates SAFA with a lookup argument. Our experimental evaluation confirms that Reef can generate proofs for documents with 32M characters; the proofs are small and cheap to verify (under a second).
Paper: https://eprint.iacr.org/2023/1886
Unlocking Productivity: Leveraging the Potential of Copilot in Microsoft 365, a presentation by Christoforos Vlachos, Senior Solutions Manager – Modern Workplace, Uni Systems
Maruthi Prithivirajan, Head of ASEAN & IN Solution Architecture, Neo4j
Get an inside look at the latest Neo4j innovations that enable relationship-driven intelligence at scale. Learn more about the newest cloud integrations and product enhancements that make Neo4j an essential choice for developers building apps with interconnected data and generative AI.
In the rapidly evolving landscape of technologies, XML continues to play a vital role in structuring, storing, and transporting data across diverse systems. The recent advancements in artificial intelligence (AI) present new methodologies for enhancing XML development workflows, introducing efficiency, automation, and intelligent capabilities. This presentation will outline the scope and perspective of utilizing AI in XML development. The potential benefits and the possible pitfalls will be highlighted, providing a balanced view of the subject.
We will explore the capabilities of AI in understanding XML markup languages and autonomously creating structured XML content. Additionally, we will examine the capacity of AI to enrich plain text with appropriate XML markup. Practical examples and methodological guidelines will be provided to elucidate how AI can be effectively prompted to interpret and generate accurate XML markup.
Further emphasis will be placed on the role of AI in developing XSLT, or schemas such as XSD and Schematron. We will address the techniques and strategies adopted to create prompts for generating code, explaining code, or refactoring the code, and the results achieved.
The discussion will extend to how AI can be used to transform XML content. In particular, the focus will be on the use of AI XPath extension functions in XSLT, Schematron, Schematron Quick Fixes, or for XML content refactoring.
The presentation aims to deliver a comprehensive overview of AI usage in XML development, providing attendees with the necessary knowledge to make informed decisions. Whether you’re at the early stages of adopting AI or considering integrating it in advanced XML development, this presentation will cover all levels of expertise.
By highlighting the potential advantages and challenges of integrating AI with XML development tools and languages, the presentation seeks to inspire thoughtful conversation around the future of XML development. We’ll not only delve into the technical aspects of AI-powered XML development but also discuss practical implications and possible future directions.
In his public lecture, Christian Timmerer provides insights into the fascinating history of video streaming, starting from its humble beginnings before YouTube to the groundbreaking technologies that now dominate platforms like Netflix and ORF ON. Timmerer also presents provocative contributions of his own that have significantly influenced the industry. He concludes by looking at future challenges and invites the audience to join in a discussion.
Observability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdfPaige Cruz
Monitoring and observability aren’t traditionally found in software curriculums and many of us cobble this knowledge together from whatever vendor or ecosystem we were first introduced to and whatever is a part of your current company’s observability stack.
While the dev and ops silo continues to crumble….many organizations still relegate monitoring & observability as the purview of ops, infra and SRE teams. This is a mistake - achieving a highly observable system requires collaboration up and down the stack.
I, a former op, would like to extend an invitation to all application developers to join the observability party will share these foundational concepts to build on:
GridMate - End to end testing is a critical piece to ensure quality and avoid...ThomasParaiso2
End to end testing is a critical piece to ensure quality and avoid regressions. In this session, we share our journey building an E2E testing pipeline for GridMate components (LWC and Aura) using Cypress, JSForce, FakerJS…
GridMate - End to end testing is a critical piece to ensure quality and avoid...
Chapter 5 counter1
1. EE 202 DIGITAL ELECTRONICS
Chapter 5 : Counters
By:Siti Sabariah Salihin
Electrical Engineering Department
1
2. Chapter 5 : Counters
EE 202 DIGITAL ELECTRONICS
Course Learning Outcomes, CLO
Upon completion of the course, students should be able to:
�
CLO 3 : Draw logics diagrams, truth tables and timing diagrams for
all common flip flops and use these to implement sequential logic
circuits correctly.
EE 202 DIGITAL ELECTRONICS
2
3. Chapter 5 : Counters
EE 202 DIGITAL ELECTRONICS
Upon completion of the chapter, students should be able to:
5.1 Understand the basic concepts of asynchronous counter and
synchronous counters, and the difference between them.
5.1.1 Draw circuit and Timing Diagram of Asynchronous
Counters
5.1.2 Interpret the Operation and Application of an
asynchronous counter
5.1.3 Draw circuit and timing diagram of synchronous counters
5.1.4 Interpret the operation and application of synchronous
up/down counters.
5.1.5 Describe how the counters in 5.1.1 and 5.1.3 can be
connected in cascade to produce higher mod
5.1.6 Explain the application of counters in Digital Clock
4. Introduction –COUNTERS
�
A counter is a register that goes through a predetermined
sequence of states upon the application of clock pulses.
�
�
�
Asynchronous counters
Synchronous counters
Asynchronous Counters (or Ripple counters)
�
�
�
the clock signal (CLK) is only used to clock the first FF.
Each FF (except the first FF) is clocked by the preceding FF.
Synchronous Counters ,
�
�
the clock signal (CLK) is applied to all FF, which means that
all FF shares the same clock signal,
thus the output will change at the same time.
EE 202 DIGITAL ELECTRONICS
4
5. Introduction –COUNTERS
�
Modulus (MOD) – the number of states it counts in a complete cycle
before it goes back to the initial state.
�
Thus, the number of flip-flops used depends on the MOD of the counter
(ie; MOD-4 use 2 FF (2-bit), MOD-8 use 3 FF (3-bit), etc..)
�
Example: MOD-4 Ripple/Asynchronous Up-Counter.
EE 202 DIGITAL ELECTRONICS
5
7. Asynchronous (Ripple) UP Counters
�
The Asynchronous Counter that counts 4 number starts from
00�01�10�11 and back to 00 is called MOD-4 Ripple (Asynchronous)
Up-Counter.
�
Next state table and state diagram
Present State
Next State
Q1Q0
Q1Q0
00
01
01
10
10
11
11
00
00
11
EE 202 DIGITAL ELECTRONICS
01
10
7
8. Asynchronous (Ripple) UP Counters
�
A two-bit asynchronous counter is
shown on the left. The external clock is
connected to the clock input of the first
flip-flop (FF0) only. So, FF0 changes
state at the falling edge of each clock
pulse, but FF1 changes only when
triggered by the falling edge of the Q
output of FF0.
�
Figure 2.1 : MOD 4 Asynchronous Up Counter
Note that for simplicity, the transitions
of Q0, Q1 and CLK in the timing
diagram above are shown as
simultaneous even though this is an
asynchronous counter. Actually, there
is some small delay between the CLK,
Q0 and Q1 transitions.
Waveform
EE 202 DIGITAL ELECTRONICS
8
9. Asynchronous (Ripple) UP Counters
Figure 2.1 : MOD 4 Asynchronous Up Counter
�
Because of the inherent propagation
delay through a flip-flop, the transition
of the input clock pulse and a transition
of the Q output of FF0 can never occur
at exactly the same time. Therefore,
the flip-flops cannot be triggered
simultaneously, producing an
asynchronous operation.
�
The 2-bit ripple counter circuit shown
has four different states, each one
corresponding to a count value.
Similarly, a counter with n flip-flops can
have 2 to the power n states. (2n) The
number of states in a counter is
known as its mod (modulo) number.
Thus a 2-bit counter is a mod-4 counter.
Waveform
EE 202 DIGITAL ELECTRONICS
9
10. Asynchronous (Ripple) UP Counters
Figure 2.1 : MOD 4 Asynchronous Up Counter
�
Usually, all the CLEAR inputs are
connected together, so that a single
pulse can clear all the flip-flops before
counting starts. The clock pulse fed
into FF0 is rippled through the other
counters after propagation delays, like
a ripple on water, hence the name
Ripple Counter
�
A mod-n counter may also described as
a divide-by-n counter. This is because
the most significant flip-flop (the
furthest flip-flop from the original clock
pulse) produces one pulse for every n
pulses at the clock input of the least
significant flip-flop (the one triggers by
the clock pulse).
Waveform
EE 202 DIGITAL ELECTRONICS
10
11. MOD 8 Asynchronous Up Counter
Figure 2.2 : MOD 8 Asynchronous Up Counter
�
�
The following is a three-bit
asynchronous binary counter and its
timing diagram for one cycle.
It works exactly the same way as a twobit asynchronous binary counter
mentioned above, except it has eight
states due to the third flip-flop
.
Waveform
EE 202 DIGITAL ELECTRONICS
11
12. MOD 8 Asynchronous Up Counter
Figure 2.3a Next State Table
Present State
CBA
001
010
010
011
100
101
110
111
011
100
101
110
111
000
0
Next State
CBA
000
001
Figure 2.3b State Diagram
7
1
6
2
5
EE 202 DIGITAL ELECTRONICS
3
4
12
13. Exercise :
Figure 2.4 : MOD 8 Asynchronous Up Counter
A
1
J
Q
1
B
J
CLK
K
Q
Q
C
1
J
CLK
K
Q
Q
CLK
K
Q
CLK
A
0
B
0
C
0
EE 202 DIGITAL ELECTRONICS
13
14. MOD 16 Asynchronous Up counter – (Negative Triggered)
Figure 2.5 : MOD 16 Asynchronous Up Counter
EE 202 DIGITAL ELECTRONICS
14
15. MOD 16 Asynchronous Up counter (Positive Triggered)
Figure 2.6 : MOD 16 Asynchronous Up Counter
�
Exercise : Draw a MOD 16 Asynchronous DOWN Counter
(Negative Triggered) :
EE 202 DIGITAL ELECTRONICS
15
16. Asynchronous DOWN Counter
Figure 2.7 : MOD 4 or 2-bit Asynchronous down counter
A (LSB)
1
J
B (MSB)
1
Q
J
CLK
Q
CLK
K
Q
Q
K
CLK
A
0
1
0
1
0
1
0
1
0
B
0
1
1
0
0
1
1
0
0
Binary 0 � 3
� 2 � 1 � 0 � 3 �
EE 202 DIGITAL ELECTRONICS
2 �
1 � 0
16
17. Asynchronous Counters
�
Exercise:
�
Design a MOD-4 ripple down-counter
�
Design a MOD-8 ripple down counter
using negative triggered.
�
Design a MOD-16 ripple down counter
using positive triggered.
EE 202 DIGITAL ELECTRONICS
17
18. Asynchronous Counters (MOD ≠ 2N)
�
So far, we have design the counters with MOD number equal to
2N, where N is the number of bit (N = 1,2,3,4….) (also correspond
to number of FF)
�
Thus, the counters are limited on for counting MOD-2, MOD4,
MOD-8, MOD-16 etc..
�
The question is how to design a MOD-5, MOD-6, MOD-7, MOD-9
which is not a MOD-2N (MOD ≠ 2N) ?
�
MOD-6 counters will count from 0 10 (0002) to 510(1012) and after
that will recount back to 0 10 (0002) continuously.
EE 202 DIGITAL ELECTRONICS
18
19. Asynchronous Counters (MOD ≠ 2N)
MOD-6 ripple up-counter (MOD ≠ 2N)
Present St.
Next St.
CBA
000
001
010
011
100
101
CBA
001
010
011
100
101
000(110)
Figure 2.8b :State Diagram
0
5
1
4
2
3
Figure 2.8a :Next State Table
Reset the state to 0002
when 1102 is detected
EE 202 DIGITAL ELECTRONICS
19
20. Asynchronous Counters (MOD ≠ 2N)
�
Circuit diagram for MOD-6 ripple up-counter (MOD ≠ 2N)
A (LSB)
B
Present St.
Next St.
CBA
000
001
010
011
100
101
CBA
001
010
011
100
101
000(110)
C(MSB)
1
CLK
J
Q
1
J
Q
1
J
Q
CLK
CLK
CLK
K Q
K Q
K Q
CLR
CLR
CLR
Detect the output at
CBA=110 to activate
CLR. NAND gate is used
to detect outputs that generates ‘1’!
EE 202 DIGITAL ELECTRONICS
20
21. Asynchronous Counters (MOD ≠ 2N)
Exercise : Draw MOD-5 Ripple Down-counter and Upcounter (MOD ≠ 2N)
EE 202 DIGITAL ELECTRONICS
21
22. IC for Asynchronous counters (IC 74293)
�
74293 IC for Asynchronous counter with Reset (MR1 and MR2)
MR1
MR2
CP0
CP1
MR1
MR2
J Q
CLK
K
Q
CLR
CP0
Q3 Q2 Q1 Q0
Q0
1
CP1
74293
1
Q1
J Q
CLK
K
Q
CLR
Q2
1
J Q
CLK
K
Q
CLR
EE 202 DIGITAL ELECTRONICS
1
Q3
J Q
CLK
K
Q
CLR
22
23. IC for Asynchronous counters (IC 74293)
�
Using 74293 IC to design MOD ≤ 16 Asynchronous UP-Counter!
�
Exercise:
�
Use 74293 IC to design MOD-10 ripple upcounter
MR1
CP1
74293
MR2
CP0
Q3 Q2 Q1 Q0
1
0
1
0
EE 202 DIGITAL ELECTRONICS
23
24. IC for Asynchronous counters (IC 74293)
�
Exercise:
�
Determine the MOD for each configuration shown below?
MR1
CP1
74293
MR2
CP0
Q3 Q2 Q1 Q0
MR1
Answer : MOD 8
CP1
74293
MR2
CP0
Q3 Q2 Q1 Q0
1
0 1
Answer : MOD 5
24
25. IC for Asynchronous counters (IC 74293)
�
Determine the MOD for configuration shown below?
MR1
CP1
74293
MR2
CP0
Q3 Q2 Q1 Q0
1
1
1
1
Answer : MOD 14
EE 202 DIGITAL ELECTRONICS
25
26. IC for Asynchronous counters (IC 74293)
CASCADE connection to produce Higher Mod
Exercise : Design Asynchronous counters MOD-60
using IC 74293.
Solution : Discuss with your Lecturer in class.
Exercise : i. Design Asynchronous counters MOD-55
using IC 74293.
ii. Design Asynchronous counters MOD1000 using IC 74293.
EE 202 DIGITAL ELECTRONICS
26
27. Asynchronous Decade Counters
Figure 2.3 : Asynchronous Decade Counter
�
The binary counters previously introduced have two to the power n states. But
counters with states less than this number are also possible. They are designed to
have the number of states in their sequences, which are called truncated sequences.
These sequences are achieved by forcing the counter to recycle before going
through all of its normal states.
�
A common modulus for counters with truncated sequences is ten. A counter with
ten states in its sequence is called a decade counter . The circuit below is an
implementation of a decade counter.
27
28. Asynchronous Decade Counters
�
The sequence of the decade counter is
shown in the table below:
�
Once the counter counts to ten (1010),
all the flip-flops are being cleared.
Notice that only Q1 and Q3 are used to
decode the count of ten. This is called
partial decoding, as none of the other
states (zero to nine) have both Q1 and
Q3 HIGH at the same time.
Figure 2.4 : True Table Asynchronous Decade
Counter
28
29. Asynchronous Up-Down Counters
Figure 2.5 : Asynchronous Up-Down Counter
�
In certain applications a counter must be able to count both up and down.
The circuit below is a 3-bit up-down counter. It counts up or down
depending on the status of the control signals UP and DOWN. When the
UP input is at 1 and the DOWN input is at 0, the NAND network between
FF0 and FF1 will gate the non-inverted output (Q) of FF0 into the clock
input of FF1. Similarly, Q of FF1 will be gated through the other NAND
network into the clock input of FF2. Thus the counter will count up.
29
30. Asynchronous Up-Down Counters
Figure 2.5 : Asynchronous Up-Down Counters
�
When the control input UP is at 0 and DOWN is at 1, the inverted outputs of
FF0 and FF1 are gated into the clock inputs of FF1 and FF2 respectively. If
the flip-flops are initially reset to 0's, then the counter will go through the
following sequence as input pulses are applied.
E2002 : Electronic System 2
30
31. Asynchronous Up-Down Counters
�
Notice that an asynchronous up-down counter is slower than an
up counter or a down counter because of the additional
propagation delay introduced by the NAND networks.
E2002 : Electronic System 2
31
33. Asynchronous Counters
�
Disadvantages of Asynchronous Counters:�
�
Existence of ‘glitch’ is inevitable for MOD ≠ 2N counters.
�
�
Propagation delay is severe for larger MOD of counters, especially
at the MSB.
Cannot design random counters (i.e:- to design circuit that counts
numbers in these sequence
5�6�7�2�3�1�5�6�7�2�3�1�5�6….)
Solution, use SYNCHRONOUS COUNTERS
EE 202 DIGITAL ELECTRONICS
.
33
35. Synchronous Counters
�
A synchronous counter , in contrast to an asynchronous counter , is one whose
output bits change state simultaneously, with no ripple. The only way we can build
such a counter circuit from J-K flip-flops is to connect all the clock inputs together,
so that each and every flip-flop receives the exact same clock pulse at the exact
same time:
EE 202 DIGITAL ELECTRONICS
35
36. Synchronous Counters
�
Now, the question is, what do we do with the J and K inputs? We know that we still have to
maintain the same divide-by-two frequency pattern in order to count in a binary sequence, and
that this pattern is best achieved utilizing the "toggle" mode of the flip-flop, so the fact that the
J and K inputs must both be (at times) "high" is clear. However, if we simply connect all the J
and K inputs to the positive rail of the power supply as we did in the asynchronous circuit, this
would clearly not work because all the flip-flops would toggle at the same time: with each and
every clock pulse!
EE 202 DIGITAL ELECTRONICS
36
39. How To Design Synchronous Counter
�
For synchronous counters, all the flip-flops are using the
same CLOCK signal. Thus, the output would change
synchronously.
�
Procedure to design synchronous counter are as follows:STEP 1: Obtain the State Diagram.
STEP 2: Obtain the Excitation Table using state transition
table for any particular FF (JK or D). Determine number
of FF used.
STEP 3: Obtain and simplify the function of each FF input
using K-Map.
STEP 4: Draw the circuit.
EE 202 DIGITAL ELECTRONICS
39
40. How To Design Synchronous Counter
�
Design a MOD-4 synchronous up-counter,
using JK FF.
STEP 1: Obtain the State transition Diagram
00
0
3
1
Binary
11
01
10
2
EE 202 DIGITAL ELECTRONICS
40
41. How To Design Synchronous Counter
STEP 2: Obtain the Excitation table. Two JK FF are used.
OUTPUT TRANSITION
QN
QN+1
0 � 0
0 � 1
1 � 0
1 � 1
FF INPUT
J
K
0
X
1
X
X
1
X
0
Excitation table
Present State
Next State
BA
0 0
0 1
1 0
1 1
BA
0 1
1 0
1 1
0 0
Input, J K
JB KB
0 X
1 X
X 0
X 1
EE 202 DIGITAL ELECTRONICS
JA KA
1 X
X 1
1 X
X 1
41
42. How To Design Synchronous Counter
STEP 3: Obtain the simplified function using K-Map
B
B
A
0
0 0
1 X
1
1
X
A
JB = A
0
0 1
1 1
1
X
1
KB = A
1
1
1
KA = 1
B
B
A
0
0 X
1 0
1
X
X
A
JA = 1
EE 202 DIGITAL ELECTRONICS
0
0 X
1 X
42
43. How To Design Synchronous Counter
STEP 4: Draw the circuit diagram.
A (LSB)
1
B (MSB)
J A QA
JB QB
CLK
CLK
KA Q A
KB QB
(MOD-4 synchronous up-counter )
EE 202 DIGITAL ELECTRONICS
43
44. How To design Synchronous Counter
�
Let us employ these techniques to design a MOD-8 counter to count in the
following sequence: 0, 1, 2, 3, 4, 5, 6, 7.
�
Step1: Determined Flip Flop Used and Creating state transition
diagram. (Rajah Keadaan)
N = 2
n
8 = 2n
n = log 8 / log 2
= 3 Flip Flop ( 3 Bit )
n
M = 2 -1
= 23 - 1
=8-1=7
N = Modulo/MOD
n = Flip Flop Used
M = Maximum Number To Be Count
EE 202 DIGITAL ELECTRONICS
44
45. How To design Synchronous Counter
�
Step 2: Creating present state-next state table
Present State
Next State
Q2
Q1
Q0
Q2
Q1
Q0
0
0
0
0
0
1
0
0
1
0
1
0
0
1
0
0
1
1
0
1
1
1
0
0
1
0
0
1
0
1
1
0
1
1
1
0
1
1
0
1
1
1
1
1
1
0
0
Q0 = QA
Q1 = QB
Q2 = Q c
0
EE 202 DIGITAL ELECTRONICS
45
46. How To Design Synchronous Counter
Step 3: Expand the present state-next state table to form the transition
table.
�
Present
State
Excitation Table
(Jadual Ujaan Flip Flop
JK)
_
J
K
Q
Q
Next State
Present inputs
QC
QB
QA
QC
QB
QA
JCKC
JBKB
JAKA
0
0
0
0
0
1
0X
0X
1X
0
0
1
0
1
0
0X
1X
X1
0
0
0
X
0
1
0
0
1
1
0X
X0
1X
0
1
1
X
0
1
1
1
0
0
1X
X1
X1
1
0
X
1
1
0
0
1
0
1
X0
0X
1X
1
1
X
0
1
0
1
1
1
0
X0
1X
X1
1
1
0
1
1
1
X0
X0
1X
1
1
1
0
0
0
X1
X1
X1
‘X’ indicates a "don’t care" condition.
"don’
EE 202 DIGITAL ELECTRONICS
46
47. How To Design Synchronous Counter
�
Step 4: Use Karnaugh maps to identify the present state logic functions
for each of the inputs.
E.g. for J 2 we get:
QcQB
QcQB
00
QA
0
0
QA
1
0
01
JC
=
0
1
11
10
0
2
X
6
X
4
1
3
X
7
X
5
Q BQ A
Using similar techniques for the other inputs we get:
KC =
QBQA
JB =
QA
KB =
QA
JA =
1
KA =
1
EE 202 DIGITAL ELECTRONICS
47
48. How To Design Synchronous Counter
�
Step 5: Constructing Circuit
A
A
A
B
B
A
B
B
EE 202 DIGITAL ELECTRONICS
C
C
C
C
48
49. How To Design Synchronous Counter
that count Random number
Example :
Design a Synchronous Counter to Count 4,7,3,0 and 2 respectively
using JKFlip Flop negative trigered by showing:
i. Flip Flop Used
ii. State Transition Diagram
iii. Exitation Table / Present state, next State
iv. Karnough Map & perform Simplified Function
v. The Synchronous Counter
EE 202 DIGITAL ELECTRONICS
50. Synchronous Counter to Count 4,7,3,0 and 2 respectively
Solution:
Step 1 : Flip Flop Used
n
Find Modulo, N= 2
n
M = 7, M = 2 -1 = 7
n
2 =N
, so, N = 7+1 = 8, MOD 8
n
2 = 8, n = log 8 / log 2
n = 3 bit = 3 Flip Flop.
EE 202 DIGITAL ELECTRONICS
51. Synchronous Counter to Count 4,7,3,0 and 2 respectively
Solution:
Step 2 : State Transation
Diagram, to count 4, 7, 3, 0
and 2.
010
011
Next
State
Qn+1
J
K
0
0
x
0
1
1
x
1
0
x
1
1
111
Present
Qn
0
100
000
Exitation Truth Table For Counter
using JK FlipFlop
1
x
0
EE 202 DIGITAL ELECTRONICS
52. Synchronous Counter to Count 4,7,3,0 and 2 respectively
Step 3 : Exitation Table /present State, Next State
Deci
mal
Present
State
Next State
JC KC JB KB JA KA
QC
QB
QA
QC
QB
QA
4
1
0
0
1
1
1
x
0
1
x
1
x
7
1
1
1
0
1
1
x
1
x
0
x
0
3
0
1
1
0
0
0
0
x
x
1
x
1
0
0
0
0
0
1
0
0
x
1
x
0
x
2
0
1
0
1
0
0
1
x
x
1
0
x
EE 202 DIGITAL ELECTRONICS
53. Synchronous Counter to Count 4,7,3,0 and 2 respectively
Step 4: Karnough Map and
Simplified Function
CB
00
01
11
10
0
0
x
1
A
0
0
1
x
2
x
1
6
x
3
4
x
7
5
K-Map For
JA = QC
EE 202 DIGITAL ELECTRONICS
54. Synchronous Counter to Count 4,7,3,0 and 2 respectively
K-Map For
JA = QC
CB
K-Map For
KA = QC
00
01
11
10
A
0
01
11
10
X
X
X
X
A
0
0
0
1
CB 00
X
X
2
X
1
1
6
X
3
7
0
4
X
0
1
5
EE 202 DIGITAL ELECTRONICS
X
2
1
1
6
0
3
4
X
7
5
55. Synchronous Counter to Count 4,7,3,0 and 2 respectively
K-Map For
JB = 1
CB
K-Map For
KB = QC
00
01
11
10
A
0
01
11
10
X
1
X
X
A
1
X
0
1
CB 00
X
X
2
X
1
1
6
X
3
7
0
4
X
0
1
5
EE 202 DIGITAL ELECTRONICS
X
2
1
1
6
0
3
4
X
7
5
56. Synchronous Counter to Count 4,7,3,0 and 2 respectively
K-Map For
K-Map For
JC = QAQB
KC = QB
CB 00
01
11
10
0
1
0
1
00
01
11
10
0
X
X
X
0
A
A
0
CB
X
X
2
0
1
X
6
X
3
1
X
7
0
4
5
EE 202 DIGITAL ELECTRONICS
X
2
X
1
6
1
3
4
X
7
5
57. Synchronous Counter to Count 4,7,3,0 and 2 respectively
Step 5 : Perform Counter Circuit
By using simplified function from K-Map, JA = QC,
JB = 1, KB = QC, JC = QA + QB, KC = QB
'1' / Vdd
KA = QC,
JA QA
J B QB
JC QC
KA QA
KB QB
K C QC
CP,CLOCK PULSE
EE 202 DIGITAL ELECTRONICS
58. Synchronous Counter
Exercises:
� Design a counter to count in the following
sequence: 6, 4. 2, 3, 1.
�
Design a counter to count in the following
sequence: 15,9,11,5,2,13,1.
�
Do more exercises in Past Years Exam Paper.
End Of This Topic…..
EE 202 DIGITAL ELECTRONICS
58
59. REFERENCES:
1. "Digital Systems Principles And Application"
Sixth Editon, Ronald J. Tocci.
2. "Digital Systems Fundamentals"
P.W Chandana Prasad, Lau Siong Hoe,
Dr. Ashutosh Kumar Singh, Muhammad Suryanata.
Download Tutorials Chapter 5: Counter
@ CIDOS
http://www.cidos.edu.my
EE 202 DIGITAL ELECTRONICS
59