# Chapter1_2 - Chapter 1 (Lect 2) Binary Codes BCD Gray ASCII...

This preview shows pages 1–6. Sign up to view the full content.

Chapter 1 (Lect 2) Binary Codes BCD Gray ASCII Digital Storage and Registers Binary Logic Definitions Truth Table Gates

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Binary Codes Code consisting of 1 and 0, high and low, on and off, … two distinct states. Represent not only numbers but also information create unique symbols for a set of elements For n-bits, 2 n distinct items or states can be represented by the code For example let n = 2, <Tom Joe Lisa Jim> How many n’s needed for <Tom Joe Lisa Jim Larry>
BCD (Binary Coded Decimal) Code Code to represent decimal numbers, not binary numbers, although they are coded with binary bits 25 = 345.6 = 1010 0001 0011 =

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
BCD Code Addition Line them up just like decimal Carry digits go to the next group if sum is out of range, greater than 1001, add 6 (0110) to correct Add 2516 + 2693 (0010 0101 0001 0110) + (0010 0110 1001 0011) 0010 0101 0001 0110 + 0010 1001 0011 EXAMPLE 1
Gray Code Useful for representing continuous data stream, ran through AD converter Key--requires only one bit change between adjacent values Faster sampling

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 12/15/2011 for the course E 202 taught by Professor Staff during the Fall '11 term at University of Alabama - Huntsville.

### Page1 / 14

Chapter1_2 - Chapter 1 (Lect 2) Binary Codes BCD Gray ASCII...

This preview shows document pages 1 - 6. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online