COMS W1004 Lecture Notes - Lecture 11: Parity Bit, Simon & Garfunkel, Boolean Expression
24 Feb 2016
School
Department
Course
Professor
Document Summary
Midterm next thursday, 3/3: chapters 4-5 on s&g, no need to read about coders and multiplexors. List of words need to know, cannon will post on courseworks. Review session given by tas on thursday, 2/25: circuits (continued, use sum of products algorithm. Take 3 inputs and provide a single output, total number of 1"s must be odd, so either one or three 1"s. Serves as error detection, message received should also have the same # of odd 1"s. The odd parity bit could be every how many # of bits, e. g. appears every. 28 bits: bits added automatically by software. b is first digit being added, cin is second digit being added, d is output digit, cout is the digit carried over. a. 0: make boolean expression, d= (a and b and cin) or (not a and b and cin) or (a and not b and cin) or (a and b and not cin)
