This preview shows pages 1–4. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: 1 BME303 Intro. to Computing Logical Op on bit vectors “7” = segments: a, b, c Microprocessor 1 1 1 Register (0x0D) 1 BME303 Intro. to Computing Logical Operations • TRUE=1, FALSE=0 • Bitwise operation A B A AND B A B A OR B A NOT A 1 AND OR NOT 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 BME303 Intro. to Computing Examples of Logical Operations •AND – useful for clearing bits 11000101 AND 00001111 • AND with zero = 0 • AND with one = no change •OR – useful for setting bits • OR with zero = no change • OR with one = 1 AND 00001111 00000101 11000101 OR 00001111 11001111 3 •NOT – unary operation  one argument – flips every bit 11001111 NOT 11000101 00111010 BME303 Intro. to Computing Boolean Algebra • A N AND B = NOT (A AND B) • A N OR B = NOT (A OR B) • Z = f(A,B,C) = (A AND B) OR NOT(C) 4 • Z = f(A,B,C) = AB + C’ 3 BME303 Intro. to Computing Basic Laws of Boolean Algebra Z Y X Z Y X X Y Y X + + = + + + = + ) ( ) ( Z Y X Z Y X X Y Y X ⋅ ⋅ = ⋅ ⋅ ⋅ =...
View
Full
Document
This note was uploaded on 02/02/2011 for the course BME 303 taught by Professor Ren during the Spring '08 term at University of Texas at Austin.
 Spring '08
 Ren

Click to edit the document details