Binary Numbers

# Binary Numbers

## Binary Numbers

- - - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - - -
##### Presentation Transcript

1. Binary Numbers

2. Outcome • Familiar with the binary system • Binary to Decimal and decimal to binary • Adding two binary sequences • Logic gates • Hexadecimal system

4. The Decimal Number System • The decimal number system is also known as base 10. The values of the positions are calculated by taking 10 to some power. • Why is the base 10 for decimal numbers? • Because we use 10 digits, the digits 0 through 9.

5. The Decimal Number System - base 10 • The decimal number system is a positional number system with a base 10. • Example: 1011 • 10112 = 1000 + 000 + 10 + 1 = 1 x 23 + 0 x22 + 1 x 21 + 1 x 20 = 1110

6. The Binary Number System • The binary number system is also known as base 2. The values of the positions are calculated by taking 2 to some power. • Why is the base 2 for binary numbers? • Because we use 2 digits, the digits 0 and 1.

7. The Binary Number System – base 2 • The decimal number system is a positional number system with a base 10. • Example: 5623 • 5623 = 5000 + 600 + 20 + 3 = 5 x 103 + 6 x102 + 2 x 101 + 3 x 100

8. Why Bits (Binary Digits)? • Computers are built using digital circuits • Inputs and outputs can have only two values • True (high voltage) or false (low voltage) • Represented as 1 and 0 • Can represent many kinds of information • Boolean (true or false) • Numbers (23, 79, …) • Characters (‘a’, ‘z’, …) • Pixels • Sound • Can manipulate in many ways • Read and write • Logical operations • Arithmetic • …

9. Base 10 and Base 2 • Base 10 • Each digit represents a power of 10 • 5417310 = 5 x 104 + 4 x 103 + 1 x 102 + 7 x 101 + 3 x 100 • Base 2 • Each bit represents a power of 2 • 101012= 1 x 24 + 0 x 23 + 1 x 22 + 0 x 21 + 1 x 20 = 2110

10. The Binary Number System (con’t) • The binary number system is also a positional numbering system. • Instead of using ten digits, 0 - 9, the binary system uses only two digits, 0 and 1. • Example of a binary number and the values of the positions: • 1001101 • 26 25 24 23 22 21 20

11. Converting from Binary to Decimal • 10011011 X 20 = 1 • 26 25 24 23 22 21 20 0 X 21 = 0 • 1 X 22 = 4 • 20 = 1 1 X 23 = 8 • 21 = 20 X 24 = 0 • 22 = 40 X 25 = 0 • 23 = 81 X 26 = 64 • 24 = 16 7710 • 25 = 32 • 26 = 64

12. Converting from Binary to Decimal (con’t) Practice conversions: BinaryDecimal 11101 1010101 100111

13. Converting From Decimal to Binary (con’t) • Make a list of the binary place values up to the number being converted. • Perform successive divisions by 2, placing the remainder of 0 or 1 in each of the positions from right to left. • Continue until the quotient is zero. • Example: 4210 • 25 24 23 22 21 20 • 32 16 8 4 2 1 • 101010 • 42/2 = 21 and R = 0 • 21/2 = 10 and R = 1 • 10/2 = 5 and R = 0 • 5/2 = 2 and R = 1 • 2/2 = 1 and R = 0 • 1/2 = 0 and R = 1 • 4210 = 1010102

14. Example 1210 We repeatedly divide the decimal number by2and keep remainders • 12/2 = 6 and R = 0 • 6/2 = 3 and R = 0 • 3/2 = 1 and R = 1 • 1/2 = 0 and R = 1 The binary number representing 12 is 1100

15. Converting From Decimal to Binary (con’t) Practice conversions: DecimalBinary 59 82 175

16. Exercises • Find the binary the decimal number represented by the following binary sequences: • 110101 • 10111010 • Represent the number 135 in base 2.

17. Bits, Bytes, and Words • A bit is a single binary digit (a 1 or 0). • A byte is 8 bits • A word is 32 bits or 4 bytes • Long word = 8 bytes = 64 bits • Quad word = 16 bytes = 128 bits • Programming languages use these standard number of bits when organizing data storage and access.

18. Adding Two Integers: Base 10 • From right to left, we add each pair of digits • We write the sum, and add the carry to the next column 0 1 1 + 0 0 1 Sum Carry 1 9 8 + 2 6 4 Sum Carry 4 0 6 1 2 1 1 0 0 1 0 1

19. Example 10011110 1101111 + + 111 1101 -------------------- ------------------- = 101 0 0 101 = 1111100

20. Boolean Algebra to Logic Gates • Logic circuits are built from components called logic gates. • The logic gates correspond to Boolean operations +, *, ’. • Binary operations have two inputs, unary has one OR + AND * NOT ’

21. AND A Logic Gate: A*B B Truth Table:

22. OR A Logic Gate: A+B B Truth Table:

23. NOT Logic Gate: (also called an inverter) A A’ or A Truth Table:

24. n-input Gates • Because + and * are binary operations, they can be cascaded together to OR or AND multiple inputs. A A B A+B+C ABC B C A A B A+B+C ABC B C C

25. n-bit Inputs • For convenience, it is sometimes useful to think of the logic gates processing n-bits at a time. This really refers to n instances of the logic gate, not a single logic date with n-inputs. 1101100101 1101110111 0100110111 10001111 00001100 00111100 001110 110001

26. A B Y C Logic Circuits ≡ Boolean Expressions • All logic circuits are equivalent to Boolean expressions and any boolean expression can be rendered as a logic circuit. • AND-OR logic circuits are equivalent to sum-of-products form. • Consider the following circuits: A y=aB+Bc abc B C aBc y Ab y=abc+aBc+Ab

27. NAND and NOR Gates • NAND and NOR gates can greatly simplify circuit diagrams. As we will see, can you use these gates wherever you could use AND, OR, and NOT. NAND NOR

28. XOR and XNOR Gates • XOR is used to choose between two mutually exclusive inputs. Unlike OR, XOR is true only when one input or the other is true, not both. XOR XNOR

29. Binary Sums and Carries a b Sum a b Carry 0 0 0 0 0 0 0 1 1 0 1 0 1 0 1 1 0 0 1 1 0 1 1 1 XOR AND 0100 0101 69 + 0110 0111 103 1010 1100 172

31. A Sum B Carry Half Adder (1-bit)

32. Full Adder A B S Full Adder Carry In (Cin) Cout

33. A S B Cin Cout Full Adder H.A. H.A.

34. S A A S A S Half Adder Half Adder B B C B C Cout Cin Full Adder

35. A3 B3 A2 B2 A1 B1 A A A A B B B B Full Adder Full Adder Full Adder Full Adder Cin Cin Cin Cin Cout Cout Cout Cout Carry S S S S S3 S2 S1 S A H.A. H.A. B Cout A S Cin B Full Adder Half Adder C 4-bit Ripple Adder using Full Adder A0 B0 S0

36. Working with Large Numbers • 0 1 0 1 0 0 0 0 1 0 1 0 0 1 1 1 = ? • Humans can’t work well with binary numbers; there are too many digits to deal with. • Memory addresses and other data can be quite large. Therefore, we sometimes use the hexadecimal number system.

37. The Hexadecimal Number System • The hexadecimal number system is also known as base 16. The values of the positions are calculated by taking 16 to some power. • Why is the base 16 for hexadecimal numbers ? • Because we use 16 symbols, the digits 0 and 1 and the letters A through F.

38. The Hexadecimal Number System (con’t) BinaryDecimalHexadecimalBinaryDecimalHexadecimal 0 0 0 1010 10 A 1 1 1 1011 11 B 10 2 2 1100 12 C 11 3 3 1101 13 D 100 4 4 1110 14 E 101 5 5 1111 15 F 110 6 6 111 7 7 1000 8 8 1001 9 9

39. The Hexadecimal Number System (con’t) • Example of a hexadecimal number and the values of the positions: • 3C8B051 • 166 165 164 163 162 161 160

40. Example of Equivalent Numbers • Binary: 1 0 1 0 0 0 0 1 0 1 0 0 1 1 12 • Decimal: 2064710 • Hexadecimal: 50A716 • Notice how the number of digits gets smaller as the base increases.

41. Summary • Convert binary to decimal • Decimal to binary • Binary operation • Logic gates • Use of logic gates to perform binary operations • Hexadecimal