Introduction and Basic Concepts on FPGA Based System Design

Introduction

When I first started learning how computers really work, I hit a wall. I knew about coding, but what happens under the hood? How do simple on/off switches turn into a video game or this blog post? That is where Boolean algebra comes in.

In this guide, I am going to break down the basics of logic functions. Forget the scary math textbooks. I want to show you how we use simple rules (AND, OR, NOT) to build complex systems. Whether you are a hobbyist or just curious, by the end of this, you will understand the secret language of your CPU.

What is Boolean Algebra?
The Basic Logic Functions (AND, OR, NOT)
Why NAND is Magic (Completeness)
Simplifying Logic (Irredundancy & Don’t-Cares)
Practical Takeaways

What is Boolean Algebra?

At its heart, Boolean algebra is just math for true/false. We use it to represent the logical functions inside digital circuits. Back in 1938, a guy named Shannon showed that networks of light switches could be modeled by these math rules.

Today, we don't use light switches. We use tiny transistors. But the logic is exactly the same.

I like to think of it as a recipe. You put in specific ingredients (your inputs), follow the rules (the logic function), and you get a result (the output). We don't use complicated existential or universal quantification here. Just simple, practical combinations.

The Basic Logic Functions

Let me walk you through the "Big Three" logic functions. If you learn these, you have the foundation for everything else.

1. NOT (Inversion)

This is the simplest. The NOT gate flips the signal.

If the input is True (1) , the output is False (0) .
Notation: I write this as \( a' \) or sometimes \( \sim a \).

2. AND

This requires all conditions to be true.

If a AND b are both 1, the output is 1. Otherwise, it is 0.
Notation: I use \( a \cdot b \) or just \( ab \).

3. OR

This requires at least one condition to be true.

If a OR b is 1, the output is 1.
Notation: I use \( a + b \).

Expert Tip: We also have NAND (NOT AND), NOR (NOT OR), and XOR (Exclusive OR). NAND is particularly interesting, and I will tell you why in the next section.

Why NAND is Magic (Completeness)

Here is a cool party trick for engineers. If I only give you a NAND gate (\( a|b \)), you can build any other logic function. We call this being "complete."

Let me prove it to you quickly:

To make NOT: Connect both inputs together. \( a|a = a' \).
To make AND: \( (a|b)|(a|b) = ab \).
To make OR: \( (a|a)|(b|b) = a'|b' = a + b \).

Why does this matter to you? Because when you look at a computer chip, you are looking at billions of NAND gates (or NOR gates) stacked together. It is the universal building block. If a circuit technology can't make a NAND or NOR, it can't make a computer.

Simplifying Logic (Irredundancy & Don’t-Cares)

When I design logic, I hate wasting space. If I can write the same function with fewer parts, my circuit runs faster and uses less power. This is called irredundancy.

For example: \( ab + ab' \) is redundant. You can just simplify it to \( a \).

The "Don't-Care" Shortcut

Sometimes, we don't care what the output is for a specific input combination. This is a lifesaver.

Imagine a light switch for a room that only has one door. The combination of "Switch Up & Switch Down" might never physically happen. That is a don't-care.

Input don’t-care: Collapsing truth table rows to make reading easier.
Output don’t-care: Telling the software, "Pick 0 or 1 here, whichever makes the circuit smaller."

If you use don't-cares wisely, you can shrink a massive logic expression down to almost nothing.

Check your understanding: If you see a "-" in a truth table, that is your permission slip to choose the easiest output.

Practical Takeaways

Here is what I want you to remember from this tutorial:

It is just switches. Boolean algebra is just a fancy way to describe on/off states.
Three rules are enough. You can build any digital system using only AND, OR, and NOT.
NAND is universal. If you master the NAND gate, you master logic design.
Simplify early. Always look for redundancy and "don't-care" conditions to save time and money.
Tools help. You can do simple simplifications by hand, but for complex stuff, use CAD tools.

Your Next Steps

Grab a piece of paper and write a truth table for a light switch (Two inputs, one output).
Try to write the Boolean expression for \( a \text{ XOR } b \).
Look up a "Karnaugh Map" (K-map) to learn the visual way to simplify logic.

Frequently Asked Questions

Q: Is Boolean algebra hard to learn? A: Not at all! If you can answer "Yes" or "No" to a question, you can do Boolean algebra. It is actually easier than regular algebra because there are only two numbers: 0 and 1.

Q: What is the difference between "combinational" and "sequential" logic? A: I focused on combinational logic here (output depends only on current inputs). Sequential logic is different because it remembers the past (using clocks and memory). Think of combinational as a vending machine button, and sequential as the machine remembering you put a coin in.

Q: Why can't I just use AND and OR to build everything? A: Great question. The combination of AND and OR is not complete. You cannot generate a "NOT" function (inverter) using only AND and OR gates. You need that inversion to flip the signal, which is why NAND or NOR are the industry standards.

Q: Where can I learn more about FPGAs? A: FPGAs are the physical chips that use these logic functions. They let you "re-wire" the hardware. For more on that, check out resources on FPGA fundamentals or the video linked at the top of this post.

Introduction and Basic Concepts on FPGA Based System Design

Introduction

Table of Contents

What is Boolean Algebra?