click below

click below

Normal Size Small Size show me how

# 2.1 key terms

### AOI combination logic

Term | Definition | Example |
---|---|---|

Distributive properties | full name:distributive property of multiplication over addition. the properties that allow us to distribute an AND across several OR functions. | the distributive property is quiet easy to use as you are using the value outside of the parenthesizes and distributing it into everything which is inside the parenthesis. |

Least Significant bit (LSB) | The rightmost bit of a binary number. this bit has the numbers smallest positional multiplier. | The LSB is the one on the left since it is the smallest value/multiplier. |

logic circuit | Any circuit that behaves according to a set of logic rules. | the logic circuit is the main thing when you ever use a circuit or make one. |

Logic diagram | A diagram, similar to a schematic, showing the connection of logic gates. | this is important when relating to a logic circuit as it'll help others see what you did. |

Maxterm | A sum term in a Boolean expression where all possible variables appear once in true or complement form. | this is the end result or shortened version of the variables which have been associated. |

Minterm | A product term in a Boolean expression where all possible variables appear once in true or complement form. | this is the end result showing all the variables which have been associated. |

Most significant bit (MSB) | The leftmost bit in a binary number. This bit has the numbers largest positional multiplier. | the left most in a binary which has/holds the highest value apposed to the LSB |

Product of sums (POS) | A type of Boolean expression where several sum terms are multiplied (AND'ed) together. | when the sums are multiplied together they make the product of sums which will include the Maxterm. |

Product term | A term in a Boolean expression where one or more true or complement variables are AND'ed. | |

Sum of products (SOP) | A type of Boolean expression where several product terms are summed (OR'ed) together. | When the products are multiplied together but some are only used once which can include minterm. |

Sum term | A term used in Boolean expression where one or more true or compliment variables are OR'ed | The end variables for a OR'ed circuit that can have one or more complement variables. |

Truth Table | A List of all possible inputs values to a digital circuit, listed in ascending binary order, and the output response for each input combination. | Something you would mark down in order to keep track of what is on or off to keep the final product active using 0 and 1. |

Demorgan's Theorems(2) | theorem stating that the complementof a product (AND operation ) equals the sum of (OR operation) of the complements. | |

Demorgan's Theorems(1) | 1) Theorem stating that the complement of a sum(OR operation) equals the product (AND operation) of the complements and. |