No description available.

For all intents and purposes, this show is the fourth edition of the textbook Computer Organization and Design Fundamentals by David Tarnoff. Since the first edition came out in 2005, the PDFs have been made free for download to anyone interested in computer organization. With the trend toward audio and video instructional material, it was time for an update. The presentation of the material in this series will be similar to that of the original textbook. In the first third, we will discuss the mathematical foundation and design tools that address the digital nature of computers. This will include an introduction to the differences between the physical world and the digital world, how those differences affect the way the computer represents and manipulates data, and the use and design of digital logic and logic gates. In the second third, the fundamentals of the digital logic and design will be used to design common circuits such as binary adders, describe checksums and cyclic redundancy checks, network addressing, storage devices, and state machines. The final third will examine the top-level view of the computer. This will include a discussion of the memory hierarchy and its components, the components of a CPU, and maybe even a discussion of assembly language along with some examples. / https://dc.etsu.edu/etsu-oer/1005/thumbnail.jpg

Let’s expand the capabilities of Karnaugh maps to combine more than just two rows of the truth table into a single product.

A multiplexer, sometimes referred to as a data selector, allows us to select which digital stream to route to an output. Designing this circuit is a lot easier than it sounds.

A demultiplexer takes a single data stream and routes it to a selected output channel, a bit like one of those old A-B printer switches we used to physically select which printer we were sending data to. In this episode, we show how to design one.

Digital data has many benefits, but what happens if it’s in error? Moreover, how can we tell if a bit has been flipped? Our discussion begins with parity.

Having learned how to program bitwise operations, it is now time to flex our bit bashing muscles by investigating some creative ways to perform common programming functions.

In this episode, we discuss the importance of hardware design to anyone interested in creating computing solutions.

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.

In this episode, we make the distinction between analog (real-world) values and the values that a computer uses, i.e., digital. We discuss the benefits of digital over analog and describe a simple system to capture analog values.