Home » Digital Logic Design

What is a latch circuit ? What do you mean by latch ?

A latch (also called a flip-flop)  is an electronic logic circuit that has two stable states and can be used to store state information. Latch is a fundamental component of data storage.It has two inputs . One of the inputs is called the SET…

Read More »

What is Flip Flop ? What do you mean by Flip Flop ?

Flip flop: The memory elements used in clocked sequential circuits are called Flip flop.These circuits are binary cells capable of storing one bit of information.A Flip flop circuit has two outputs, one for the normal value and one…

Read More »

Compare Sequential and Combinational Logic Circuit [Answered]

A full comparison between sequential logic circuits and combinational logic circuits are given below :   Combinational Logic Circuit Sequential Logic Circuit In this output depends only upon present input. In this output depends upon present as well…

Read More »

Parity Method for Error Detection [Explained] | Boolean Algebra | Parity Bit

There are many types of bit parity errors.They are Even Parity error in the second bit,Even Parity error in the parity bit and Even Parity two corrupted bits etc . This mechanism enables the detection of single bit errors,…

Read More »

Implement the following function with NOR gates

(Boolean Algebra) Implement the following function with NOR gates F(A,B,C) =(A+B)(C+D)E Solve: The first step is to simplify the function in Product of Sum  form .For this you can use K-Map Method .  

Read More »

Implement the following function with NAND gates

(Boolean Algebra) Implement the following function with NAND gates F(A,B,C) = ∑(0,6) Solve: The first step is to simplify the function in Sum of Products  form.For this we have to use K-Map Method. The simplified function in sum of…

Read More »

List the limitations of Karnaugh Map? What are the limitations of Karnaugh Map

The limitations of K-Map or The limitations of Karnaugh Map’s are : The limitation to a K-map is that it is only really efficient to use with few variables ( small bits ) and gets highly confusing to minimize…

Read More »

What is Parity Bit ? | Parity Bit meaning

Parity Bit Definition : Whenever a message is transmitted, it may get contaminated by noise or data may get corrupted.To detect and correct the errors, additional bits are added to the data bits at the time of transmission. The…

Read More »

What is Parity Check ? | Parity check meaning

Parity check  is a simple example of error-detecting code . Whenever a message is transmitted, it may get contaminated by noise or data may get corrupted. To avoid this contamination , we use error-detecting codes which are additional data…

Read More »

What is Duality Principle ? | Duality Principle in Boolean Algebra

Duality Principle in Boolean Algebra states that every algebraic expression deducible from the postulates of Boolean algebra remains valid if the operators and identity elements are interchanged. The Huntington postulates have been listed in pairs and designated by…

Read More »

How to get the Sum of Minterm | Finding Sum of Minterms Form

(Boolean Algebra) What is Sum of Minterm ? : ABC+ABC’ + AB’C+ AB’C’ + AB’C + A’B’C = m7+m6+m5+m4+m1 Sample Problem : Express the following function in a Sum of Minterm F(A,B,C) = A + B’C We can get the Sum of Minterm…

Read More »

How to get the Product of Maxterm | Finding Product of Maxterms Form

(Boolean Algebra)What is Product of Maxterm : (x+y)(x’+y) = M0M2  Sample Problem : Express the following function in a product of maxterm F(A,B,C) = AB + A’C The way to find / get the product of maxterm : To…

Read More »

What is a minterm?What is a standard product? | Digital Logic Design Studies

[Digital Logic Design Studies] Minterm definition : n variables forming an AND term , with each variable being primed or unprimed , provide 2^n possible combinations , called minterms , or standard products. Each minterm is obtained from an…

Read More »

What is a Maxterm? What is Standard Sums ? | Digital Logic Design Studies

[Digital Logic Design Studies] Maxterm definition : n variables forming an OR term , with each variable being primed or unprimed , provide 2^n possible combinations , called maxterms , or standard sums. Each maxterm is obtained from…

Read More »

Compare Boolean Algebra with Arithmetic and Ordinary Algebra

[Digital Logic Design Studies] The differences between Boolean Algebra and Arithmetic or Ordinary Algebra’s are : In ordinary algebra, the letter symbols take any number of values. In Boolean algebra, they take two values, i.e. 0 and 1. The…

Read More »