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

How read and write is performed using sockets, How read and write is perfor...

How read and write is performed using sockets? An application program interface gives the details of how can an application program interacts along with protocol software. But

What do you mean by directives, Q What do you mean by Directives? Assem...

Q What do you mean by Directives? Assembly languages support numerous statements. This allows you to control the way in which a source program assembles and list. These stateme

State the number of definitions of firewall, State the number of definition...

State the number of definitions of firewall Though there exist a number of definitions of firewall, in simplest terms it can be defined as "a mechanism used to protect a truste

#logic function, Minimize the following logic function using K-maps and rea...

Minimize the following logic function using K-maps and realize using NAND and NOR gates. F(A,B,C,D) =?_m(1,3,5,8,9,11,15) + d(2,13).

Explain non-pre-emptive algorithms, Explain non-pre-emptive algorithms? ...

Explain non-pre-emptive algorithms? Non preemptive algorithms: In this algorithm a job is provided to CPU for execution as long as the job is non-completed the CPU cannot

Define the arithmetic micro-operations, Q. Define the Arithmetic Micro-oper...

Q. Define the Arithmetic Micro-operations? These micro-operations execute simple arithmetic operations on numeric data stored in registers. The fundamental arithmetic micro-ope

Show error detection mechanism, Q. Show Error detection mechanism? Erro...

Q. Show Error detection mechanism? Error detection mechanism can be described as below: Figure: Error detection and correction

Gantt chart and kiviat diagram, Q. What is Gantt chart and Kiviat diagram? ...

Q. What is Gantt chart and Kiviat diagram? Gantt chart: Gantt chart explains numerous activities of every processor with respect to progress in time in busy -overhead - id

Dataflow computing, Dataflow Computing A different to the von Neumann m...

Dataflow Computing A different to the von Neumann model of computation is the dataflow computation model. In a dataflow model, control is fixed to the flow of data. The order o

Define bandwidth, Define Bandwidth? When transferring blocks of data, i...

Define Bandwidth? When transferring blocks of data, it is of interest to know how much time is required to transfer an entire block, as blocks can be variable in size it is use

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages