# Thread: Boolean Alegbra

1. Hi - my notes covering this topic arent the best. Can anyone point me in the direction of a decent guide/tutorial? Or better yet could someone explain the concept to me?

To define it - i need help with Boolean Algebra in relation to switching circuits and the set of primitive-function Logic gates and functions.

Any input would be appreciated.

2.

3. Do a search at codeguru.com for OR, AND, etc. There are likely good snippets there.

4. You're best to learn the functions of the basic gates, NOT, AND, and OR first in terms of their truth tables. Once you've done that, then learn the notation of OR (+) AND (.) and NOT (overhead bar). Then from there you can easily derive other gates such as NAND, NOR, XOR etc, in terms of both boolean algebra and truth tables.

It's not much of a stretch to get to solving basic logic circuit problems from there. For example, if you want to know the function of a circuit, given it's truth table, each high (1) output will be a term in the equation A+B+C+D..., where + is the OR operator. Each term (A,B,C,D) will be a boolean expression for a condition at the inputs for example A could be (for a three bit input), a.b.c[bar], meaning When a AND b AND NOT c are high, then A is high.

Using laws of boolean algebra, you can simplify the expressions too, just like you can factorise numbers in normal algebra.

 Bookmarks
##### Bookmarks
 Posting Permissions
 You may not post new threads You may not post replies You may not post attachments You may not edit your posts   BB code is On Smilies are On [IMG] code is On [VIDEO] code is On HTML code is Off Trackbacks are Off Pingbacks are Off Refbacks are On Terms of Use Agreement