Latches, Flip-Flop and Pewaktu (Timer) x

Latches

The output of a latch depends on its current inputs and on its previous output and its change of state can happen at any time when its inputs change Program Studi T. Elektro FT - UHAMKA Slide - 8 2 The output of a latch depends on its current inputs and on its previous output and its change of state can happen at any time when its inputs change

S-R (Set-Reset) Latch
Gated S-R Latch
Gated D Latch


S-R Latch










Negative-OR Equivalent of the NAND gate /S-/R Latch


Example: Determine the waveform that will be observed on the Q output. Assume that Q is initially LOW






The Gated S-R Latch A gated latch requires an Enable input, EN (G is also used to designated an enable input). The S and R inputs control the state to which the latch will go when a HIGH level is applied to the EN input. The latch will not change until EN is HIGH.




Truth Table for Gated S-R Latch




The Gated D Latch Only has one input in addition to EN. This input is called the D (data) input. -When the D input is HIGH and the EN input is HIGH, the latch will SET. -When the D input is LOW and EN is HIGH, the latch will RESET. -Another way, the output Q follows the input D when EN is HIGH








Edge-Triggered Flip-Flops

Edge-triggered S-R flip-flop
Edge-triggered D flip-flop
Edge-triggered J-K flip-flop


Edge-Triggered Flip-Flop Logic Symbols (Top: Positive Edge-Triggered; Bottom: Negative Edge-Triggered).


The Edge-Triggered S-R Flip-Flop The S and R inputs of the S-R flip-flop are called synchronous input because data on these inputs are transferred to the flip-flop’s output only on the triggering edge of the clock pulse.

Operation of a positive edge-triggered S-R flip-flop






Example: Determine the Q and /Q output waveforms of the flip-flop (Assume is initially RESET)






Exercise: Determine the Q and /Q output waveforms of the flip-flop (Assume is initially RESET) and it is a negative edge-triggered device






The Edge-Triggered D FlipFlop The D flip-flop is useful when a single data bit (1 or 0) is to be stored







source : https://onlinelearning.uhamka.ac.id/

Comments

Post a Comment

Popular posts from this blog

Tugas 2. Rangkuman Materi Sistem Bilangan

Image
 Tujuan Topik Bahasan  Mengulas kembali sistem bilangan desimal.  Menghitung dalam bentuk bilangan biner.  Memindahkan dari bentuk bilangan desimal ke biner dan dalam biner ke dalam desimal.  Penggunaan operasi aritmatika pada bilangan biner.  Menentukan komplemen 1 dan 2 dari sebuah bilangan biner.  Dan lain – lainnya…….. Pendahuluan Sistem Biner dan Kode – kode digital merupakan dasar untuk komputer dan elektronika digital secara umum.  Sistem bilangan biner seperti desimal, hexadesimal dan oktal juga dibahas pada bagian ini. Operasi aritmatika dengan bilangan biner akan dibahas untuk memberikan dasar pengertian bagaimana komputer dan jenis – jenis perangkat digital lain bekerja. Sistem Bilangan Desimal -> 0 ~ 9 Biner ->0 ~ 1 Oktal -> 0 ~ 7 Hexadesimal -> 0 ~ F Bilangan Desimal Dalam setiap bilangan desimal terdiri dari 10 digit, 0 sampai dengan 9 Contoh: Ungkapkan bilangan desimal 2745.214 sebagai penjumlahan nilai setiap digit. Bilangan Biner Sistem Bilangan biner merup
Read more

7. Aljabar Boolean, Penyederhanaan Logika dan Peta Karnaugh

Image
Standard Forms of Boolean Expressions  Sum of Product (SOP)  Product of Sum (POS) The Sum-of-Products (SOP) Form   When two or more product terms are summed by Boolean   Conversion of a General Expression to SOP Form  Any logic expression can be change into SOP form by applying Boolean Algebra techniques The Standard SOP Form The Products-of-Sum (POS) Form  When two or more sum terms are multiplied The Standard POS Form Boolean Expression and Truth Table Converting SOP to Truth Table Examine each of the products to determine where the product is equal to a 1.  Set the remaining row outputs to 0. Converting POS to Truth Table Opposite process from the SOP expressions.  Each sum term results in a 0.  Set the remaining row outputs to 1. Converting from Truth Table to SOP and POS The Karnaugh Map The Karnaugh Map Provides a systematic method for simplifying Boolean expressions  Produces the simplest SOP or POS expression  Similar to a truth table because it presents all of the possible val
Read more