Global ETD Search

41	Episode 4.10 – More Boolean Simplifications Tarnoff, David 01 January 2020 (has links) Because many students have trouble when trying to simplify Boolean expressions, we’re going to dedicate another episode to examples of simplification. We’re also going to show how sometimes, there’s more than one way to crack an egg. computer organization computer design Boolean simplifications Computer Sciences
42	Episode 5.01 – The Sum-of-Products Expression Tarnoff, David 01 January 2020 (has links) Who knew how easy it would be to derive a Boolean expression from a truth table? By following a few simple steps, sum-of-products expressions are quickly converted to and from truth tables. In addition, the SOP expression is a heck of a performer. computer organization computer design sum-of-products expression Computer Sciences
43	Episode 5.02 – NAND Logic Tarnoff, David 01 January 2020 (has links) The NAND gate outputs a logic zero only when all its inputs equal logic one. Let’s explore how this universal gate can be used to implement any Boolean expression. computer organization computer design NAND logic Computer Sciences
44	Episode 5.03 – The Product-of-Sums Expression Tarnoff, David 01 January 2020 (has links) Now that we’ve studied the sum-of-products form of Boolean expressions, it’s time to take a look at the product-of-sums. This form uses logical OR’s to generate zeros which are passed to the output through an AND gate. computer organization computer design product-of-sums expression Computer Sciences
45	Episode 6.01 – Introduction to Karnaugh Maps Tarnoff, David 01 January 2020 (has links) Here we introduce a graphical tool that when used correctly will produce a most simplified sum-of-products expression, all without meddling in any simplification of Boolean expressions. computer organization computer design Karnaugh maps Computer Sciences
46	Episode 6.04 – Four-Variable Karnaugh Map Example Tarnoff, David 01 January 2020 (has links) Many digital designs begin with a truth table. In this episode, we do just that, and then create the simplified sum-of-products expression by way of the Karnaugh map. computer organization computer design four-variable Karnaugh map Computer Sciences
47	Episode 6.05 – Don’t Cares, the Logical Kind Tarnoff, David 01 January 2020 (has links) Like a wild card in a game of poker, an unspecified truth table entry called a “don’t care” can make our sum-of-products expressions so much nicer. computer organization computer design don’t cares logical Computer Sciences
48	Episode 6.06 – Don’t Cares as Inputs Tarnoff, David 01 January 2020 (has links) This short episode shows how a complicated truth table can be clarified by using “don’t cares” to represent input values. computer organization computer design don’t cares inputs Computer Sciences
49	Episode 6.08 – Binary Decoders Tarnoff, David 01 January 2020 (has links) What does it take to switch on a device? In some cases, like getting a soda from a vending machine, a number of conditions must be just right. That’s where binary decoders come in. computer organization computer design binary decoders Computer Sciences
50	Episode 7.01 – The Need for Bitwise Operations Tarnoff, David 01 January 2020 (has links) All areas of computing, from data compression to web design, from networking to digital image storage, from system administration to high-performance computing, benefit from bit manipulation. computer organization computer design bitwise operations Computer Sciences

Search results