Explain sr latch with nand gate, Computer Engineering

Assignment Help:

Explain SR Latch with NAND Gate?

SR Latch has two useful states:

  • Set state, when output Q=1 and Q'=0.
  • Reset state, when output Q=0 and Q'=1.Output Qand Q' are normally complement of each other.

1999_SR Latch with NAND Gate 1.png

  • Undefined state, when Q=1 and Q'=1, occurred when both inputs R and S are equal to 0 at the same time.
  • Under normal conditions, both inputs of the latch (Rand S) remain at 1 unless the state has to be changed.
  • To let latch in the set state, Smust be 0
  • To let latch in the reset state, Rmust be 0
  • The inputs Sand Rmust go back to 1 before any other changes to avoid the occurrence of the undefined state (when Q=1 and Q'=1)
  • The latch go to the set state or reset state and stay there even after both inputs return to 1.

1133_SR Latch with NAND Gate 2.png


Related Discussions:- Explain sr latch with nand gate

Show the properties of frame tag, Q. Show the properties of Frame Tag? ...

Q. Show the properties of Frame Tag? This tag is used for placing an HTML file in the frame created. We should now tell browser what to put in every frame.

Write short note on associated vs. common channel signaling, Write short no...

Write short note on Associated vs. Common channel signaling. Associated vs Common channel signalling: The out band signalling suffers from the very restricted bandwidth.

What is memory address register, Q. What is Memory Address Register? Me...

Q. What is Memory Address Register? Memory Address Register (MAR): It specifies address of memory location from that data or instruction is to be accessed (read operation) or t

Assessing heuristic searches , Assessing Heuristic Searches: Given a p...

Assessing Heuristic Searches: Given a particular problem you want to build an agent to solve, so there may be more than one way of justifying it as a search problem, more than

Explain the boolean equations for logic circuits, Explain The Boolean Equat...

Explain The Boolean Equations for Logic Circuits? A Boolean equation is the mathematical representation of a logic circuit using standard Boolean terms. All the logic gates (AND,

Determine the indicator variables in a random forest, Given a dataset with ...

Given a dataset with 1000 rows and 25 predictors labeled x1, x2, ...,x25 to classify into two classes {a, b}. Consider the small random forest with 3 trees and one split in each tr

Show the classification of printers, Q. Show the Classification of Printers...

Q. Show the Classification of Printers? Printers can be classified on following bases: a) Impact: Impact printers print by impact of hammers on ribbon (for example Dot-Matri

Xor gate, The XOR gate. The exclusive OR or XOR gate is similar to a tw...

The XOR gate. The exclusive OR or XOR gate is similar to a two input OR gate. The output of an XOR gate is logic 1 only when one input or the other input is high and is 0 when

Illustrate about the three state table buffers, Three state table buffers ...

Three state table buffers Three state table buffers: A bus system can be constructed with the help of three state gates instead of multiplexers. A three states gate is digital

.., 1mechanism of artificial satellite

1mechanism of artificial satellite

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd