Scribd
Upload
116 views3 pages

Access Control Logic Assignment Formatted

The document outlines the design of a security access system for university labs using Boolean logic, specifically the expression (I · A) + (L′ · A), which is simplified to A · (I + L′). It discusses the application of De Morgan's Theorems and their relevance in digital logic, emphasizing their utility in hardware design. Additionally, it includes a logic gate diagram and a truth table for the simplified expression.

Uploaded by

mobsbouk
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
116 views3 pages

Access Control Logic Assignment Formatted

The document outlines the design of a security access system for university labs using Boolean logic, specifically the expression (I · A) + (L′ · A), which is simplified to A · (I + L′). It discusses the application of De Morgan's Theorems and their relevance in digital logic, emphasizing their utility in hardware design. Additionally, it includes a logic gate diagram and a truth table for the simplified expression.

Uploaded by

mobsbouk
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Access Control System Logic Design Assignment

Scenario Summary:

You are interning at a university's IT department to help build a security access system

for labs using the Boolean logic:

(I · A) + (L′ · A)

Where:

- I: ID scanned (1 if valid ID is scanned)

- L: Lab available (1 if lab is available)

- A: Admin override (1 if admin allows manual override)

Task 1: Boolean Expression Simplification

The given Boolean expression is: (I · A) + (L′ · A)

To simplify this, we apply Boolean algebra laws step by step.

1. Original Expression: (I · A) + (L′ · A)

2. Apply the Distributive Law: A · (I + L′)

Therefore, the simplified expression is: A · (I + L′)

This simplification reduces the number of gates needed in the hardware implementation,

improving efficiency and cost-effectiveness in circuit design. The use of the distributive
law in this context helps combine terms sharing a common variable (A), demonstrating

its practical significance in logic simplification (Roth & Kinney, 2016).

Task 2: Apply De Morgan's Theorem

De Morgan’s Theorems are essential in digital logic as they offer transformations

between AND-OR and OR-AND relationships with negation. They are stated as:

1. (A · B)' = A' + B'

2. (A + B)' = A' · B'

Applying De Morgan’s Theorem to the term (L′ · A)' yields:

(L′ · A)' = (L′)' + A' = L + A'

Though our current logic expression does not require the negation of (L′ · A),

understanding De Morgan’s transformations helps in realizing logical expressions using

only NAND or NOR gates, which are fundamental in hardware design.

De Morgan’s Theorems align closely with other Boolean laws like the distributive,

associative, and double negation laws. This synergy is what makes Boolean algebra a

complete system for logical expression manipulation (Yadav, 2023).

Task 3a: Logic Gate Diagram

For the simplified expression A · (I + L′), the logic gate implementation is:

I --------\
\

> OR ----\

L --|NOT|---/ \

> AND ---> OUTPUT

A --------------------/

Task 3b: Truth Table for A · (I + L′)

Below is the truth table for the simplified Boolean expression using all possible

combinations of inputs A, I, and L:

References

Roth, C. H., & Kinney, L. L. (2016). Fundamentals of logic design (7th ed.). Cengage

Learning.

Yadav, N. (2023). Digital logic design and applications. Academic Press.

Yoshiwara, K. (2020). Modeling, functions, and graphs. American Institute of

Mathematics. https://yoshiwara.math.college

IEEE. (2021). IEEE Standard for Logic Circuit Terminology. https://standards.ieee.org/

You might also like