Quine-McClukey tabular method is a tabular method based on the concept of prime implicants. We know that prime implicant is a product (or sum) term, which can’t be further reduced by combining with any other product (or sum) terms of the given Boolean function. This tabular method is useful to get the prime implicants by repeatedly using the following Boolean identity. xy+xy’=x(y+y’)=x.1=x… Read more →
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 input; the other is called the RESET input.
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 for the complement value of the bit stored in it . A Flip flop circuit can maintain a binary state indefinitely(as long as power… Read more →
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 as past input. Speed is fast. Speed is slow. It is designed easy. Compareing to combinational circuits it is designed tough …. Read more →
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, because if one bit gets flipped due to line noise, there will be an incorrect number of ones in the received data…. Read more →
(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 .
(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 products for this example is F = x’y’z’+xyz’ Place it using NAND Gate. This is done by combining 0’s in the map… Read more →
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 logic which has more variables(variable numbers > 5).It is so difficult to visualize for more than five variables using K-Map. A 4… Read more →
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 additional bits are called parity bits. They allow detection or correction of the errors. The data bits along with the parity bits form… Read more →
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 added to a given digital message to help us detect if an error occurred during transmission of the message.
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 part(a) and part(b) . One part maybe obtained from the other if the binary operators and identity elements are interchanged. This important… Read more →
(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 by first expanding the expression into sum of AND terms. If it misses one or more variables , it is ANDed with… Read more →
(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 get the boolean function as a product of maxterms , it must first be brought into form of OR terms.This may be… Read more →
[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 AND term of the n variables , with each variable being primed if the corresponding bit of the binary number is a… Read more →
[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 an OR term of the n variables , with each variable being unprimed if the corresponding bit is a 0 and primed… Read more →