In this episode, we take a break from proving identities of Boolean algebra and start applying them. Why? Well, so we can build our Boolean logic circuits with fewer gates. That means they’ll be cheaper, smaller, and faster. That’s why.
| Identifer | oai:union.ndltd.org:ETSU/oai:dc.etsu.edu:computer-organization-design-oer-1001 |
| Date | 01 January 2020 |
| Creators | Tarnoff, David |
| Publisher | Digital Commons @ East Tennessee State University |
| Source Sets | East Tennessee State University |
| Detected Language | English |
| Type | text |
| Format | audio/mpeg |
| Source | Computer Organization and Design Fundamentals Series |
| Rights | http://creativecommons.org/licenses/by-nc-nd/4.0/ |
Page generated in 0.0025 seconds