| Author |
Message
|
| cheekychop |
 Posted: Mon May 12, 2008 8:19 am Post subject: Boolean Alegbra |
 |
|
Forum Freshman
Joined: 12 May 2008
Posts: 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. |
|
| Back to top |
|
 |
| CShark |
| Posted: Mon May 12, 2008 8:27 am Post subject: |
|
|
Forum Sophomore
Joined: 08 May 2008
Posts: 169
Location: East Coast of Canada
|
| Do a search at codeguru.com for OR, AND, etc. There are likely good snippets there. |
|
| Back to top |
|
|
| bit4bit |
| Posted: Wed May 14, 2008 3:15 pm Post subject: |
|
|
Forum Ph.D.
Joined: 14 Jul 2007
Posts: 611
|
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.
_________________
Chance favours the prepared mind. |
|
| Back to top |
|
|
|
|
|
