Informações:
Synopsis
Geek Author presents educational series covering computer organization, computer architecture, and embedded system design. Each episode is a concise step taking the listener on a journey from the foundations of digital logic up to computer architecture and finally to system level input and output. The series is presented by engineer, author, and educator David Tarnoff. After a career in industry designing motherboards and BIOSes, David began teaching hardware concepts to students of computer science. Twenty-five years later, hes taking that content and providing it to anyone with an interest in what makes a computer tick.
Episodes
-
Episode 4.10 - More Boolean Simplifications
14/12/2019 Duration: 12minBecause 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.
-
Episode 4.09 - Simplification of Boolean Expressions
06/12/2019 Duration: 10minIn 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.
-
Episode 4.08 - DeMorgan's Theorem
01/12/2019 Duration: 10minIn this episode, we add one more tool to our Boolean algebra toolbox: DeMorgan's Theorem. We then use it, along with some of our other tools, to modify an expression down to its simplest form.
-
Episode 4.07 - Identities of Boolean Algebra
24/11/2019 Duration: 14minWe are familiar with algebraic laws such as multiply zero by anything, and we get zero. In this episode, we see how a Boolean expression containing a constant, a duplicated signal, or a signal being combined with its inverse will simplify...always.
-
Episode 4.06 - Properties of Boolean Algebra
22/11/2019 Duration: 15minIn this episode, we bring together our knowledge of logic operations, truth tables, and Boolean expressions to prove some basic properties of Boolean algebra.
-
Episode 4.05 - Introduction to Boolean Algebra
15/11/2019 Duration: 11minTruth tables and circuit diagrams fall short in many ways including their abilities to evaluate and manipulate combinational logic. By using algebraic methods to represent logic expressions, we can apply properties and identities to improve performance.
-
Episode 4.04 - NAND, NOR, and Exclusive-NOR Logic
08/11/2019 Duration: 09minThe simplest combinational logic circuits are made by inverting the output of a fundamental logic gate. Despite this simplicity, these gates are vital. In fact, we can realize any truth table using a circuit made only from AND gates with inverted outputs.
-
Episode 4.03 - Combinational Logic
27/10/2019 Duration: 09minIndividual logic gates are not very practical. Their power comes when you combine them to create combinational logic. This episode takes a look at combinational logic by working through an example in order to generate its truth table.
-
Episode 4.02 - Truth Tables
26/10/2019 Duration: 09minIn this episode, we introduce one of the most important tools in the description of logic operations: the truth table. Not only do truth tables allow us to describe a logic operation, they provide a means for us to prove logical equivalence.
-
Episode 4.01 - Intro to Logic Gates
20/10/2019 Duration: 11minLogic gates are the fundamental building blocks of digital circuits. In this episode, we take a look at the four most basic gates: AND, OR, exclusive-OR, and the inverter, and show how an XOR gate can be used to compare two digital values.
-
Episode 3.12 - Run Length Limited Coding
18/10/2019 Duration: 13minBy examining Run Length Limited (RLL) coding, we discover a way to compress the ones and zeros of our binary data by using differential coding. We also chat a bit about magnetic storage media.
-
Episode 3.11 - Polar and Bipolar Line Coding
13/09/2019 Duration: 08minIn this episode, we continue our discussion of line codes by examining five schemes used with polar and bipolar signaling: NRZ-L, NRZ-I, RZ-AMI, Manchester, and differential Manchester. We also discuss differential coding and its benefits.
-
Episode 3.10 - Signaling and Unipolar Line Coding Schemes
13/09/2019 Duration: 08minWhen sending digital data from one device to another, both devices must agree on how to represent ones and zeros. This episode presents how signal levels affect the delivery of data and how line codes are used to represent the ones and the zeros.
-
Episode 3.09 - UTF-8 Encoding and Unicode Code Points
31/08/2019 Duration: 17minASCII was developed when every computer was an island and over 35 years before the first emoji appeared. In this episode, we will take a look at how Unicode and UTF-8 expanded ASCII for ubiquitous use while maintaining backwards compatibility.
-
Episode 3.08 - Intro to ASCII Character Encoding
10/08/2019 Duration: 09minIn 1963, the American Standards Association released a standard defining an 8-bit method to represent letters, punctuation, and control characters. This episode examines ASCII so that we can begin to see how computers represent language.
-
Episode 3.07 - Introduction to Floating Point Binary and IEEE 754 Notation
28/07/2019 Duration: 13minRegardless of the numeric base, scientific notation breaks numbers into three parts: sign, mantissa, and exponent. In this episode, we discuss how the computer stores those three parts to memory, and why IEEE 754 puts them together the way it does.
-
Episode 3.06 - Fixed Point Binary Representation
21/07/2019 Duration: 10minUp to this point, we've limited our discussion to binary integers. In this episode, we are moving the curtain to reveal the powers of two to the right of the binary point in order to begin representing fractions.
-
Episode 3.5 - Introduction to Offset or Biased Notation
17/07/2019 Duration: 08minIt turns out that twos complement is just one of many ways to use binary to represent negative numbers. In this episode, we examine the use of offset or biased notation to represent signed integers.
-
Episode 3.04 - The Application of Twos Complement
10/07/2019 Duration: 16minIn this episode, we continue our discussion of twos complement binary representation by covering overflow and how shifting left and right can be used to perform multiplication and division by powers of two.
-
Episode 3.03 - An Introduction to Twos Complement Representation
23/06/2019 Duration: 09minIn this episode, we switch from base ten to binary as we introduce twos complement representation and show how computers store and manipulate signed integers.