1. Electrical Engineering Engineering the Future Digital Circuits Fundamentals Hands-on Full-Adder Simulation (afternoon)

2. Electrical Engineering: Digital Circuits Fundamentals Binary Numbers Binary Functions Engineering the Future

3. Decimal Numbers

4. Binary Numbers

7. Binary Counting Exercise Count up to ? Using 2 bits Count up to ? Using 3 bits Count up to ? Using 4 bits Count up to ? Using 5 bits Count up to ? Using 6 bits

8. Binary Numbers

10. Logic Gates

13. http://www.williamson-labs.com/480_logic.htm#doors

14. Logic Gates

15. Binary Addition Networks (Half Adder) With two’s complement numbers, addition is sufficient Half-adder Schematic SUM CARRY

16. Binary Addition Networks (Cascaded Multi-bit Adder) usually interested in adding more than two bits this motivates the need for the full adder

17. Binary Addition Networks (Full Adder) S = A ’ B ’ CI+A ’ BCI+AB ’ CI ’ +ABCI = CI xor A xor B CO = B CI + A CI + A B = CI (A + B) + A B

18. One-bit adder 1-bit binary adder –inputs: A, B, Carry-in –outputs: Sum, Carry-out A B Cin Cout S ABCinSCout 000 001 010 011 100 101 110 111 0110100101101001 0001011100010111

19. Binary Addition Networks (Full Adder/ Half Adder) Alternative Implementation: 5 Gates CO = A B + CI (A xor B) = A B + B CI + A CI Standard Approach: 6 Gates SUM CARRY OUT CARRY IN