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

Define object oriented modelling, Object oriented modelling Object ori...

Object oriented modelling Object oriented modelling is entirely a new way of thinking about queries. This methodology is all about visualizing the things by using models organ

Role of internet, What are the roles of Internet, Intranet and extranet in ...

What are the roles of Internet, Intranet and extranet in e-business? Role of Internet, Intranet and extranet into e-business: The given information activities are carried

Rank the list elements in terms of distance, Q. Rank the list elements in t...

Q. Rank the list elements in terms of distance? Rank the list elements in terms of distance from each to last element in given linear linked list. A parallel algorithm for t

Explain the stack storage allocation model, Explain the stack storage alloc...

Explain the stack storage allocation model. In a stack-based allocation, all objects are allocated in last-in, first-out data structure and a stack. For example: Recursive subr

Student, Suppose we have an array-based list A[0..N - 1] and we want to del...

Suppose we have an array-based list A[0..N - 1] and we want to delete all duplicates. LastPosition is initially N - 1, but gets smaller as elements are deleted. Consider the pseudo

How to create a new object order preference, 1. In an ASCII editor, make an...

1. In an ASCII editor, make an empty text file with the extension .ord. 2. Save the file in the Dat folder of the project. 3. Click To o l s > G UI R e c o r d O p t i o n s

Handshake control of data transfer - computer architecture, Handshake contr...

Handshake control of data transfer during an input operation: . Handshake control of data transfer during an output operation o Interface to CPU and Memory o

What is multiplexer, Q. What is multiplexer? Explain 4 X 1 Multiplexer. ...

Q. What is multiplexer? Explain 4 X 1 Multiplexer. Q. Explain the working of a Binary Half-Adder. Construct a Full-Adder from Half- Adder. Also draw the circuit diagram of full

How to design a sequential circuit, A sequential circuit is signified by a ...

A sequential circuit is signified by a time sequence of external inputs, external outputs and internal flip-flop binary states. So firstly a state diagram and state table is used t

What is a word line, What is a word line? In a memory cell, all the cel...

What is a word line? In a memory cell, all the cells of a row are linked to a common line called as word line

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages