CSC258H1 Lecture Notes - Multiplexer, Binary Number
Document Summary
Building up from gates: half adders. A 2-input, 1-bit width binary adder that performs the following: some common and more complex structures computations: Seven-segment decoders: certain structures are common to many circuits, and have block elements of their own. Karnaught map review moved to jan18ce. Output is x if s = 0; otherwise output is y if s = 1. A half adder adds two bits to produce a two-bit sum. The sum is expressed as a sum bit s and a carry bit c. Equations and circuits for half adder units are easy to define (even w/o k-maps: full adders. Similar to half-adders, but with another input z, which. C and z are sometimes labels as cout and cin. When z is 0, the unit behaves exactly like a half adder. When z is 1, the full adder performs the following computations: multiplexer design. Adders: also known as binary adders. Small circuits devices that add two digits together.
