Global ETD Search

51	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
52	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
53	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
54	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
55	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
56	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
57	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
58	Episode 7.02 – Clearing Bits using the Bitwise-AND Tarnoff, David 01 January 2020 (has links) Clearing bits within an integer is important if we want to isolate bits or set them to zero before we insert a new value. The bitwise-AND does this for us. computer organization computer design clearing bits Bitwise-AND Computer Sciences
59	Episode 7.03 – Coding Bitwise Operations Tarnoff, David 01 January 2020 (has links) Discussing how to use bitwise operations to manipulate the bits of an integer would be academic if we couldn’t perform the operations in our code. The good news is that we can! computer organization computer design Bitwise operations Computer Sciences
60	Episode 7.04 – Setting Bits using the Bitwise-OR Tarnoff, David 01 January 2020 (has links) The ability to set bits may not seem important at first, but many algorithms in computing depend on just that. Join us as we control bits and build integers from scratch using the bitwise-OR. computer organization computer design Bitwise -OR Computer Sciences

Search results