ECE 2110: Introduction to Digital Systems BCD, Gray, Character, Action/Event, Serial Data.

Slides:



Advertisements
Similar presentations
Lecture no 6. Two's Complement Given a negative number (N), represented using the Two's Complement representation (N*), the magnitude of the number (P)
Advertisements

HEXADECIMAL NUMBERS Code
Chapter 2: Data Representation
Principles of Computer Architecture Miles Murdocca and Vincent Heuring Chapter 2: Data Representation.
ECE 331 – Digital System Design
King Fahd University of Petroleum and Minerals
Digital Fundamentals Floyd Chapter 2 Tenth Edition
Data Representation Computer Organization &
Binary & Decimal numbers = 3* * *10 + 5*1 = 3* * * *10 0 Decimal system: Ten digits: 0,1,2,3,…,9 Example:
2.3 Binary Codes for Decimal Numbers ReturnNext Code: A set of n-bit strings in which different bit strings represent different numbers or other things.
Data Representation COE 205
Number Systems Decimal (Base 10) Binary (Base 2) Hexadecimal (Base 16)
2-1 Computer Organization Part Fixed Point Numbers Using only two digits of precision for signed base 10 numbers, the range (interval between lowest.
EECC341 - Shaaban #1 Lec # 3 Winter Binary Multiplication Multiplication is achieved by adding a list of shifted multiplicands according.
CSCE 211: Digital Logic Design Chin-Tser Huang University of South Carolina.
Data Representation ICS 233
VIT UNIVERSITY1 ECE 103 DIGITAL LOGIC DESIGN CHAPTER I NUMBER SYSTEMS AND CODES Reference: M. Morris Mano & Michael D. Ciletti, "Digital Design", Fourth.
Digital Fundamentals Floyd Chapter 2 Tenth Edition
Number Systems and Codes Discussion D4.1. Number Systems Counting in Binary Positional Notation Hexadecimal Numbers Negative Numbers.
MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR 1 Overflow Signed binary is in fixed range -2 n-1  2 n-1 If the answer for addition/subtraction more than the.
Number Systems and Codes
1.6 Signed Binary Numbers.
ECE 2110: Introduction to Digital Systems Signed Number Conversions.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd.
Digital Design: Principles and Practices Chapter 2 Number Systems and Codes.
Computers Organization & Assembly Language
Digital Systems and Logic Design
2-1 Chapter 2 - Data Representation Principles of Computer Architecture by M. Murdocca and V. Heuring © 1999 M. Murdocca and V. Heuring Chapter Contents.
ECE 3110: Introduction to Digital Systems Review #1 (Chapter 1,2)
2-1 Chapter 2 - Data Representation Principles of Computer Architecture by M. Murdocca and V. Heuring © 1999 M. Murdocca and V. Heuring Principles of Computer.
Binary Codes. Binary Code A binary code is just an assignment of information to bit patterns.
EE2174: Digital Logic and Lab Professor Shiyan Hu Department of Electrical and Computer Engineering Michigan Technological University CHAPTER 2 Number.
Lec 3: Data Representation Computer Organization & Assembly Language Programming.
UNIVERSAL COLLEGE OF ENGINEERING AND TECHNOLOGY PREPARED BY:- Chirag Parmar ( ) Kashish Soni ( ) Maitrey Bhatt( )
Number Systems Decimal (Base 10) –10 digits (0,1,2,3,4,5,6,7,8,9) Binary (Base 2) –2 digits (0,1) Digits are often called bits (binary digits) Hexadecimal.
ECE 3110: Introduction to Digital Systems BCD, Gray, Character, Action/Event, Serial Data.
Number Systems and Codes. CS2100 Number Systems and Codes 2 NUMBER SYSTEMS & CODES Information Representations Number Systems Base Conversion Negative.
1 EENG 2710 Chapter 1 Number Systems and Codes. 2 Chapter 1 Homework 1.1c, 1.2c, 1.3c, 1.4e, 1.5e, 1.6c, 1.7e, 1.8a, 1.9a, 1.10b, 1.13a, 1.19.
ECE 301 – Digital Electronics Unsigned and Signed Numbers, Binary Arithmetic of Signed Numbers, and Binary Codes (Lecture #2)
Summer 2012ETE Digital Electronics1 Binary Arithmetic of Signed Binary Numbers.
ECE 3110: Introduction to Digital Systems unsigned Multiplication/Division codes.
Number Systems Decimal (Base 10) –10 digits (0,1,2,3,4,5,6,7,8,9) Binary (Base 2) –2 digits (0,1) Digits are often called bits (binary digits) Hexadecimal.
ECE 2110: Introduction to Digital Systems Signed Addition/Subtraction.
Operations on Bits Arithmetic Operations Logic Operations
ECE 331 – Digital System Design Representation and Binary Arithmetic of Negative Numbers and Binary Codes (Lecture #10) The slides included herein were.
ECE 301 – Digital Electronics Representation of Negative Numbers, Binary Arithmetic of Negative Numbers, and Binary Codes (Lecture #11) The slides included.
CEC 220 Digital Circuit Design Binary Codes
Digital Design Basics Analog vs Digital Why we need digital? Reproducibility, economy, programmability… Digital Devices Gates, FFs Combinational, sequential.
Digital Fundamentals Tenth Edition Floyd Chapter 2 © 2008 Pearson Education.
Lecture 3 Combinational Circuits
1 Digital Design Debdeep Mukhopadhyay Associate Professor Dept of Computer Science and Engineering NYU Shanghai and IIT Kharagpur.
Module –I Codes: Weighted and non-weighted codes
Lecture 2 Number Representation, Overflow and Logic Topics Adders Math Behind Excess-3 Overflow Unsigned, signed-magnitude Two’s Complement Gray Code Boolean.
CEC 220 Digital Circuit Design Binary Codes Mon, Aug 31 CEC 220 Digital Circuit Design Slide 1 of 14.
ECE 2110: Introduction to Digital Systems
ECE DIGITAL LOGIC LECTURE 3: DIGITAL COMPUTER AND NUMBER SYSTEMS Assistant Prof. Fareena Saqib Florida Institute of Technology Fall 2016, 01/19/2016.
ECE DIGITAL LOGIC LECTURE 4: BINARY CODES Assistant Prof. Fareena Saqib Florida Institute of Technology Fall 2016, 01/26/2016.
Data Representation COE 301 Computer Organization Dr. Muhamed Mudawar
ECE 3110: Introduction to Digital Systems Signed Number Conversions and operations.
Computer Math CPS120 Introduction to Computer Science Lecture 7.
Number Systems. The position of each digit in a weighted number system is assigned a weight based on the base or radix of the system. The radix of decimal.
1 Integer Representations V1.0 (22/10/2005). 2 Integer Representations  Unsigned integer  Signed integer  Sign and magnitude  Complements  One’s.
Data Representation COE 301 Computer Organization Prof. Muhamed Mudawar College of Computer Sciences and Engineering King Fahd University of Petroleum.
Number Systems Decimal (Base 10) –10 digits (0,1,2,3,4,5,6,7,8,9) Binary (Base 2) –2 digits (0,1) Digits are often called bits (binary digits) Hexadecimal.
ECE 2110: Introduction to Digital Systems
Lec 3: Data Representation
Data Representation.
Number systems and codes
TAO1221 COMPUTER ARCHITECTURE AND ORGANIZATION LAB 6
ECE 331 – Digital System Design
Presentation transcript:

ECE 2110: Introduction to Digital Systems BCD, Gray, Character, Action/Event, Serial Data

2 Previous class Summary Signed Addition/subtraction Overflow Sign extension Unsigned multiplication/division  Shift-and-add  Shift-and-subtract

3 Binary Codes for Decimal Numbers Code: A set of n-bit strings in which different bit strings represent different numbers or other things. Code word: a particular combination of n-bit values  N-bit strings at most contain 2 n valid code words. To represent 10 decimal digits, at least need 4 bits. Excessive ways to choose ten 4-bit words. Some common codes:  BCD: Binary-coded decimal, also known as 8421 code  Excess-3  2421…

4 BCD code 0000:0 ….1001: 9 Packaged-BCD representation:  8 bits (one byte) represent BCD addition  Similar to add 4-bit unsigned binary numbers.  Make correction if a result exceeds 1001 (9). By adding 0110 (6).  Carry into the next digit position may come from either the initial binary addition or the correction-factor addition.

5

6 Weighted code Each decimal digit can be obtained from its code word by assigning a fixed weight to each code-word bit.  BCD (8,4,2,1)  2421 (self-complementing: code word for the 9’s complement of any digit may be obtained by complementing the individual bits of the digit’s code word)

7 Excess-3 code Self-complementing code Not weighted Corresponding BCD code  Binary counters

8 Gray Code Only one bit changes between each pair of successive words. For example:3-bit Gray Code

9

10 How to construct Gray Code Recursively  A 1-bit Gray Code has 2 code words, 0, 1  The first 2 n code words of an (n+1)-bit Gray code equal the code words of an n-bit Gray Code, written in order with a leading 0 appended.  The last 2 n code words equal the code words of an n-bit Gray Code, but written in reverse order with a leading 1 appended.

11 Another method to construct Gray Code The bits of an n-bit binary or Gray-code word are numbered from right to left, from 0 to n-1 Bit i of a Gray code word is  0 if bits i and i+1 of the corresponding binary code words are the same  1: otherwise

12 Other codes Character codes (nonnumeric)  ASCII (7-bit string) Codes for action/condition/states Codes for Detecting and Correcting Errors Codes for Serial Data Transmission

13 Codes for Actions/Conditions/States If there are n different actions, conditions, or states, we can represent them with a b-bit binary code with Ceiling function: the smallest integer greater than or equal to the bracketed quantity.

14 ASCII

15

16 Next… Class Review Exam:  Close books, but you may bring one sheet of notes.  No Calculators are allowed in this exam.