ENEL 111 Digital Electronics

Richard Nelson
G.1.29
richardn@cs.waikato.ac.nz
Second Half of ENEL 111

 Digital Electronics
 Number Systems and Logic
 Electronic Gates
 Combinational Logic
 Sequential Circuits
 ADC – DAC circuits
 Memory and Microprocessors
 Hardware Description Languages
Weekly Structure

 Lectures Monday, Tuesday, Wednesday

 Slides in ppt and pdf format on support website:
 http://wand.cs.waikato.ac.nz/~111/2005/
 (follow link from course website)

 Friday Tutorials - Sample Questions on website.

The lecture today

 Digital vs Analog data

 Binary inputs and outputs
 Binary, octal, decimal and hexadecimal number
systems
 Other uses of binary coding.
Analog/Analogue Systems

 Analogue Systems
 V(t) can have any value between its minimum and
maximum value

V(t)
Digital Systems

 Digital Systems
 V(t) must take a value V(t)

selected from a set of

values called an
alphabet
 Binary digital systems 1 0 1 0 1
form the basis of
almost all hardware
systems currently
For example, Binary Alphabet: 0, 1.
Slide example

 Consider a child’s slide in a playground:

a set of discrete steps

continuous movement

levels
Relationship between Analogue and
Digital systems
5 Volt

 Advantages of Digital Systems

 Analogue systems: slight error in Input Output
Range Range
input yields large error in output for 1 for 1
 Digital systems more accurate
2.8
and reliable 2.4
 Computers use digital circuits

internally
 Interface circuits (for instance,
0.8
sensors and actuators) are often Input
0.4 Output
Range
analogue for 0
Range
0 Volt for 0
Exercise

 Explain whether the following are analog or

digital:

 A photograph or painting
 A scanned image
 Sound from a computer’s loud speaker
 Sound file stored on disc
Binary Inputs and Outputs

 Coding:
 A single binary input can only have two

values: True or False (Yes or No) (1 or

0)
 Binary

 More bits = more combinations

00 01 10 1 1

Each additional input doubles the number of

combinations we can represent
i.e. with n inputs it is possible to represent 2n
combinations
Combinations

 Example 1:
 How many combinations are possible with 10 binary
inputs?

 Example 2:
 What is the minimum number of bits needed to
represent the digits ‘0’ to ‘9’ as a binary code?”
Decimal systems

 Number Representation
 Difficult to represent Decimal numbers directly in a
digital system
 Easier to convert them to binary
 There is a weighting system:
eg

403 = 4 x 100 + 0 x 10 + 3 x 1

or in, powers of 10:

40310= 4x102 + 0x101 + 3x100 = 400 + 0 + 3

Binary Inputs and Outputs

 Both Decimal and Binary numbers use a positional

weighting system, eg:

10102 = 1x23+0x22+1x21+0x20 = 1x8 + 0x4 + 1x2 + 0x1 = 1010

decimal 100 (102) 10 (101) 1 (100)

4 0 3 400 + 0 + 3

binary 8 (23) 4 (22) 2 (21) 1 (20)

1 0 0 1 8+0+0+1
 Binary to decimal
 Multiply each 1 bit by the appropriate power of 2 and add them
together.

? ? 128 64 32 16 8 4 2 1
1 0 0 0 0 0 1 1
1 0 1 0 0 1 1 0 0

100000112 = ……………….10 ?

1010011002 = ……………………10 ?
Binary Inputs and Outputs
 Number Representation - Binary to decimal
 A decimal number can be converted to binary by repeated division by 2

number /2 remainder
155 77 1 Least Significant Bit
77 38 1
38 19 0
19 9 1
9 4 1
4 2 0
2 1 0
1 0 1 Most Significant bit

15510 = 100110112
Decimal to Binary

An alternative way is to use the “placement” method

128 64 32 16 8 4 2 1

128 goes into 155 once leaving 27 to be placed

So 64 and 321are too big (make them zero)

16 goes in once leaving 11

and so on…
1 0 0 1
Representations

 There are different ways of representing decimal

numbers in a binary coding

 BCD or Binary Coded Decimal is one example.

 Each decimal digit is replaced by 4 binary digits

Binary Inputs and Outputs

 6 of the possible 16 values unused Decimal BCD

0 0000
 example 45310 = 0100 0101 0011BCD 1 0001
2 0010
3 0011
 Note that BCD code is longer than a direct 4 0100
representation in natural binary code: 5 0101
6 0110
 453 = 111000101 7 0111
8 1000
9 1001
Binary Inputs and Outputs
 Hexadecimal and Octal
 Writing binary numbers as strings of 1s and 0s can be very

tedious
 Octal (base 8) and Hexadecimal (base 16) notations can be

used to reduce a long string of binary digits.

octal 512 (83) 64 (82) 8 (81) 1 (80)
1 2 0 7 512 + 128 + 7

hexadecimal 256 (162) 16 (161) 1 (160)

1 A F 256 + 160 + 15

Notice that hexadecimal requires 15 symbols (each number system needs 0 –

base-1 symbols) and therefore A – F are used after 9.
Octal as shorthand for Binary

 Each octal digit corresponds to 3 binary bits

binary octal
To convert a binary string: 10011101010011
000 0
001 1
Split into groups of 3:
010 2
010 011 101 010 011
011 3
2 3 5 2 3
100 4
101 5
110 6 Thus 100111010100112 = 235238

111 7
Similarly with Hexadecimal

 Each hex digit corresponds to 4 binary bits

To convert a binary string:

binary hex binary hex
10011101010011
0000 0
1000 8
0001 1 1001 9 Split into groups of 4:
0010 2 1010 A 0010 0111 0101 0011
0011 3 1011 B
0100 4 1100 C
0101 5 1101 D
0110 6 1110 E
Thus 100111010100112 = ……………16 ?

0111 7 1111 F
Binary inputs and outputs
 Colour codes

 You often see hex used in graphic design programs for

the red, blue and green components of a colour:

 FF0000 represents red, for example.

 How many bits are used to represent each colour?

 How many different colours can be represented?

Binary Inputs and Outputs
 Characters
 Three main coding schemes used: ASCII (widespread
use), EBCDIC (not used often) and UNICODE (new)
 ASCII table (in hex) :
00 01 02 03 04 05 06 07 08 09 0a 0b 0c 0d 0e 0f
nul soh sot etx eot enq ack bel bs ht nl vt np cr so si
10 11 12 13 14 15 16 17 18 19 1a 1b 1c 1d 1e 1f
dle dc1 dc2 dc3 dc4 nak syn etb can em sub esc fs gs rs us
20 21 22 23 24 25 26 27 28 29 2a 2b 2c 2d 2e 2f
sp ! " # $ % & ' ( ) * + , - . /
30 31 32 33 34 35 36 37 38 39 3a 3b 3c 3d 3e 3f
0 1 2 3 4 5 6 7 8 9 : ; < = > ?
40 41 42 43 44 45 46 47 48 49 4a 4b 4c 4d 4e 4f
@ A B C D E F G H I J K L M N O
50 51 52 53 54 55 56 57 58 59 5a 5b 5c 5d 5e 5f
P Q R S T U V W X Y Z [ \ ] ^ _
60 61 62 63 64 65 66 67 68 69 6a 6b 6c 6d 6e 6f
` a b c d e f g h i j k l m n o
70 71 72 73 74 75 76 77 78 79 7a 7b 7c 7d 7e 7f
p q r s t u v w x y z { } ~ del
Gray Codes
 Other codes exist for specific purposes Dec Gray
 Gray codes provide a sequence where 0 000
only one bit changes for each increment 1 001
 Allows increments without ambiguity due 2 011
to bits changing at different times. 3 010
 E.g. changing from 3 to 4, normal binary has
4 110
all three bits changing 011 -> 100.
Depending on the order in which the bits 5 111
change any intermediate value may be 6 101
created.
7 100
Summary
 Support website
 Analogue and Digital
 Binary Number Systems
 Coding schemes considered were:
 Natural Binary
 BCD
 Octal representation
 Hexadecimal representation
 ASCII
Exercises

 You should practice conversions between binary,

octal, decimal and hexadecimal.

 You should be able to code decimal to BCD (and

BCD to decimal).

 You should be able to explain and give examples

of digital and analogue data.