Global ETD Search

31	Episode 3.11 – Polar and Bipolar Line Coding Tarnoff, David 01 January 2020 (has links) In 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. computer organization computer design polar bipolar line coding Computer Sciences
32	Episode 3.12 – Run Length Limited Coding Tarnoff, David 01 January 2020 (has links) By 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. computer organization computer design run length limited coding Computer Sciences
33	Episode 4.01 – Intro to Logic Gates Tarnoff, David 01 January 2020 (has links) Logic 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. Click here to read the show transcript. computer organization computer design logic gates Computer Sciences
34	Episode 4.02 – Truth Tables Tarnoff, David 01 January 2020 (has links) In 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. computer organization computer design truth tables Computer Sciences
35	Episode 4.03 – Combinational Logic Tarnoff, David 01 January 2020 (has links) Individual 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. computer organization computer design combinational logic Computer Sciences
36	Episode 4.04 – NAND, NOR, and Exclusive-NOR Logic Tarnoff, David 01 January 2020 (has links) The 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. computer organization computer design NAND NOR exclusive-NOR Computer Sciences
37	Episode 4.05 – Introduction to Boolean Algebra Tarnoff, David 01 January 2020 (has links) Truth 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. computer organization computer design Boolean Algebra Computer Sciences
38	Episode 4.06 – Properties of Boolean Algebra Tarnoff, David 01 January 2020 (has links) In this episode, we bring together our knowledge of logic operations, truth tables, and boolean expressions to prove some basic properties of Boolean algebra. computer organization computer design Boolean Algebra properties Computer Sciences
39	Episode 4.07 – Identities of Boolean Algebra Tarnoff, David 01 January 2020 (has links) We 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. computer organization computer design Boolean algebra identities Computer Sciences
40	Episode 4.08 – DeMorgan’s Theorem Tarnoff, David 01 January 2020 (has links) In 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. computer organization computer design DeMorgan's theorem Computer Sciences

Search results