Sie sind auf Seite 1von 17

# 8/13/13

Digital Electronics
- Part I: Digital Principle Dr. L Dng
Department of Electronics and Computer System (C9-401) School of Electronics and Telecommunications Hanoi University of Science and Technology Email: ledung-fet@mail.hut.edu.vn

## Part I: Digital Principles - Overview

Information Digitalization
Logic Clause Logic Level 1 0 High Low

## Boolean Functions (Boolean Algebra)

True False

Electronic circuits
(Transistor BJT, Diode, Resister, MOS...) Open-Collector Output & Tristate Output

Implementation

## Basic Logic Gates

Inverter,AND,OR,NAND,NOR,XOR,XNOR

- Custom design

Logic Circuits

## Digital Integrated Circuits

Logic Families
RTL, DTL, HTL TTL, CMOS PMOS, NMOS, BiMOS, ECL,

- Standard cell design - Gate array - PLA, PLD, FPGA - FSMD design - VHDL

## Sequential Logic Circuits

Specifications:
- Current & Voltages - Fan-in, Fan-out - Propagation Delay - Noise Margin - Power Dissipation - Speed Power Product

Digital System

Page 2

8/13/13

## Part I: Digital Principles - Contents

Chapter 1 : Binary system and Binary Codes Chapter 2 : Boolean Algebra Chapter 3 : Logic Gates and Digital Integrated Circuits

Page 3

Chapter 1

## Binary system and Binary Codes

1.1 Binary System

1.2 Binary Arithmetic 1.3 Sign Number Representation 1.4 Real Number Code 1.5 Binary Coded Decimal (BCD) 1.6 Character Code 1.7 Gray Code 1.8 Error Detection Codes and Error Correction Codes 1.9 Other (Information) Codes

Page 4

8/13/13

## 1.1 Binary System

Decimal System
+ 10 digits = {0,1,2,3,4,5,6,7,8,9} radix = 10 (Decimal) + A number D = 1974.2810= 1103 + 9102 + 7101 + 4100 + 210-1 + 810-2
r (radix) = 10 and i (weighted position) runs from -2 to 3

Page 5

## 1.1 Binary System

Number System
+ An ordered set of symbols + A number = Positional Notation

+ Polynomial Notation
(with r- radix and i-weighted position)

Page 6

8/13/13

## 1.1 Binary System

Counting in Decimal System
+ Based on the order {01 23456789} + When 9 return 0 at the weighted position (i) a change at the weighted position (i+1) For example: 00 01 02 09 10 11 12 19 20 21 22 29 ... 099 100
Dr. Le Dung - School of Electronics and Telecommunications Page 7

## 1.1 Binary System

Binary System
+ Two ordered symbols (2 bits) = {0,1} radix=2 (Binary) + Binary number
B = 1011.1012 = 123 + 022 + 121 + 120 + 12-1 + 02-2 + 12-3 = 11.62510 r (radix) = 2, ai = digit (0 ai 1)

+ Binary counting {0 1} {00 01 10 11} {000 001 .111} {0000 0001 1111}
Dr. Le Dung - School of Electronics and Telecommunications Page 8

8/13/13

## 1.1 Binary System

Why do we use the binary system ?
Because: Two bits {0, 1} can be represented more easily by: + Two positions of an electrical switch. + Two distinct voltage or current levels allowed by a circuit. + Two distinct levels of light intensity + Two directions of magnetization or polarization + .
Page 9

## Calculating machine (Mller 1784) with decimal system

Dr. Le Dung - School of Electronics and Telecommunications

## 1.1 Binary System

+ 16 symbols = {0,1,2,3,4,5,6,7,8,9,A,B,C,D,E,} + Hexadecimal Number
2DC.1E16= 2162 + 13161 + 12160 + 116-1 + 1416-2

Dr. Le Dung - School of Electronics and Telecommunications Page 10

8/13/13

## 1.1 Binary System

Base Conversions
Convert to base 10
use the polynomial notation with radix and weighted positions

Convert to base 2
use radix divide method for the integer part (remainders and quotient) use radix multiply method for the fraction part.

## Convert between base 2 and 16

Dr. Le Dung - School of Electronics and Telecommunications Page 11

## 1.2 Binary Arithmetic

1 + 1 = 0 carry 1 = 102

Page 12

8/13/13

## 1.2 Binary Arithmetic

Subtraction
1-1=0-0=0 1-0=0 0 - 1 = 1 borrow 1 A (Minuend) B (Subtrahend) borrow difference 11101 1111 1110 01110

Note: A B = A + (-B)

Page 13

## 1.2 Binary Arithmetic

Multiplication
Binary multiplication table Multiply two binary numbers

Note: - Multiplication by repeated Add & Shift - Can be implemented in a faster way
Dr. Le Dung - School of Electronics and Telecommunications Page 14

8/13/13

## 1.2 Binary Arithmetic

Division
1/1=1 0/0=0=0/1 1 / 0 = undefined
Divisor -

## 10111010 1110 1001010 1110 10010 0000 10010 1110 100

1110 1101

Dividend Quotient

Remainder

## Note: - Division by repeated Sub & Shift

Dr. Le Dung - School of Electronics and Telecommunications Page 15

## 1.3 Sign Number Representation

Sign Number Format
MSB

N=

## Representing the magnitude

Sign

= 0 positive + = 1 negative -

## Representing the magnitude Sign magnitude representation Twos complement system

Dr. Le Dung - School of Electronics and Telecommunications Page 16

8/13/13

## 1.3 Sign Number Representation

Sign-Magnitude representation
MSB

N=

## N - integer with n bits lies between -(2n-1-1) and +(2n-1-1)

+ Carry

1010 - 2 1100 - 4 10000 0110 +6 error 0011 +3 1011 -3 0110 1110 -6 error

+ Carry

Page 17

## 1.3 Sign Number Representation

Sign-magnitude representation leads to slow, expensive adder/subtractor due to repeated comparison and test of sign and magnitude This is why we represent numbers mostly using twos complement system

Page 18

8/13/13

## 1.3 Sign Number Representation

Twos Complement System
Radix-complement D* of a number D with n digits is D* = rn D D* + D = rn Eg. The 2-complement of D = 00112 is D* = 24 - 3 = 13 = 11012
+ Carry 0011 +3 1101 (+3)2-complement 11110 0000 0 Ok
represents (-3)

## Twos Complement Calculation ?

Dr. Le Dung - School of Electronics and Telecommunications Page 19

## 1.3 Sign Number Representation

Twos Complement System
Twos Complement Calculation: Algorithm 1: Complement bits then add 1

Algorithm 2: Copy from LSB to the first 1-bit then continue replace the bits with their complement until the MSB has been replaced

Page 20

10

8/13/13

## 1.3 Sign Number Representation

Twos Complement System
MSB

+N =

## Magnitude = absolute value of N

2-complement calculation

-N =

Page 21

## 1.3 Sign Number Representation

Add and Sub in Twos Complement System
Addition 0010 +2 0100 +4 + 00000 0110 +6 0010 +2 1011 (+4) 00111 + 1110 - 2 0111 +7 0110 +6 01100 + 1101 - 3 0010 +2 1100 - 4 + 00000 1110 - 2 0010 +2 0011 (- 4) 00111 + 0110 +6 1001 - 7 1010 - 6 10000 + 0011 +3
Page 22

## 1110 - 2 1100 - 4 + 11000 1010 - 6 1110 - 2 0011 (- 4) 11111 + 0010 +2

Subtraction A+(B)+1

Overflow

11

8/13/13

## 1.3 Sign Number Representation

Summary of Twos Complement Addition and Subtraction

Page 23

## 1.4 Real Number Code

Coding the position of the radix point Fixed-point

Floating-point
Scientific notation

Page 24

12

8/13/13

## 1.4 Real Number Code

Computer floating-point number

Page 25

## 1.5 Binary Coded Decimal (BCD)

Coding 10 decimal digits by 4 bits DCBA
DCBA

Page 26

13

8/13/13

## 1.6 Character Codes

American Standard Code for Information Interchange (ASCII 7-bit code)

Unicode
Dr. Le Dung - School of Electronics and Telecommunications Page 27

## 1.7 Gray Code

00 01 11 10 10 11 01 00
Two consecutive number differ in only 1 bit (distance = 1) Why do we use the gray code ?.

Page 28

14

8/13/13

## 1.8 Error Detection Code Error Correction Code

Error ? Error Control: Error Detection and Error Correction Party Code Hamming Code Cyclic Redundancy Code (CRC-16, CRC-32)

Page 29

## 1.9 Other Code

Voice Encoding (Pulse Code Modulation) Image and Video Encoding (Pixels, Frames) Other information Encoding (ADC, DAC)

Page 30

15

8/13/13

## 1.9 Other Code

Voice Encoding (Pulse Code Modulation)

Page 31

## 1.9 Other Code

Image Encoding (Raster Image Pixels)

Pixels

Page 32

16

8/13/13

## 1.9 Other Code

Video Encoding (Frames)
Frames Frames Frames

Page 33