Scribd
Upload
2 views

Logic_Gates_Assignment_Report

The assignment report discusses Boolean algebra, its operations, and laws, which are essential for analyzing and simplifying logic circuits. It includes symbols and truth tables for various logic gates, such as AND, OR, NOT, NAND, and NOR, along with examples of implementing Boolean expressions using these gates. The report concludes that mastering these concepts is crucial for efficient digital system design.

Uploaded by

sabs.smma
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
2 views

Logic_Gates_Assignment_Report

The assignment report discusses Boolean algebra, its operations, and laws, which are essential for analyzing and simplifying logic circuits. It includes symbols and truth tables for various logic gates, such as AND, OR, NOT, NAND, and NOR, along with examples of implementing Boolean expressions using these gates. The report concludes that mastering these concepts is crucial for efficient digital system design.

Uploaded by

sabs.smma
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Assignment Report: Logic Gates and Boolean Algebra

1. Boolean Algebra and Simplification of Boolean Expressions

Boolean algebra is a mathematical system used to describe and analyze logic circuits. It operates
on binary values (0 and 1) and uses logical operators such as AND, OR, and NOT. Boolean algebra
simplifies complex logical expressions, aiding in the design and optimization of digital circuits.

Basic Operations in Boolean Algebra:


- AND (·): The output is 1 only if all inputs are 1.
- OR (+): The output is 1 if at least one input is 1.
- NOT (~): Inverts the input; 1 becomes 0 and 0 becomes 1.

Important Boolean Laws:


- Identity: A + 0 = A, A · 1 = A
- Null: A + 1 = 1, A · 0 = 0
- Idempotent: A + A = A, A · A = A
- Inverse: A + A' = 1, A · A' = 0
- Commutative: A + B = B + A
- Associative: A + (B + C) = (A + B) + C
- Distributive: A · (B + C) = A·B + A·C
- De Morgan's: (A · B)' = A' + B', (A + B)' = A' · B'

Simplification Example:
Expression: Y = A + A·B -> Simplified: Y = A (Absorption Law)

2. Symbols and Truth Tables of Logic Gates

NOT Gate:
A | Y = A'
0|1
1|0

OR Gate:
AB|Y=A+B
00|0
01|1
10|1
11|1

AND Gate:
AB|Y=A·B
00|0
01|0
10|0
11|1

3-input OR Gate:
ABC|Y=A+B+C
000|0
001|1
010|1
...

3-input AND Gate:


ABC|Y=A·B·C
000|0
001|0
010|0
...

3. Implementation of Boolean Expressions Using Logic Gates

Example: Y = A · B + C'

Step-wise Implementation:
1. Use an AND gate for A · B.
2. Use a NOT gate for C'.
3. Use an OR gate for final output.

Final Output: Y = A·B + C'

4. Universal Logic Gates: Symbols and Truth Tables

NAND Gate: Y = (A · B)'


AB|Y
00|1
01|1
10|1
11|0

NOR Gate: Y = (A + B)'


AB|Y
00|1
01|0
10|0
11|0

5. Realization of AND and OR Gates Using Universal Gates

Using NAND Gates:


AND Gate: Y = (A · B) -> Y = ((A · B)')'
OR Gate: Y = A + B -> Y = ((A') · (B'))'

Using NOR Gates:


OR Gate: Y = A + B -> Y = ((A + A)' + (B + B)')'
AND Gate: Y = A · B -> Y = ((A + B)' + (A + B)')'

Conclusion

This assignment covered the fundamentals of Boolean algebra, logic gates, and their
implementation. Mastering these concepts is essential for designing efficient digital systems. Using
universal gates like NAND and NOR, any logic function can be implemented, making them powerful
tools in circuit design.

You might also like