logicex - CS2204 DIGITAL LOGIC STATE MACHINE DESIGN FALL...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Polytechnic Institute of NYU Page 1 of 2 Handout No : 7 October 1, 2009 Function f(A, B, C, D) in Different Representations CS2204 DIGITAL LOGIC & STATE MACHINE DESIGN FALL 2009 f(A, B, C, D) M(0,2,4,6,8,10,11,12,14) = The maxterm list : f(A,B,C,D) A A B B C C D D Digital Circuit Black Box : Double-rail Inputs f(A,B,C,D) A B C D Double-rail Inputs Black Box : A B C D f(A, B, C, D) 0 0 0 0 0 0 0 0 1 1 0 0 1 0 0 0 0 1 1 1 0 1 0 0 0 0 1 0 1 1 0 1 1 0 0 0 1 1 1 1 1 0 0 0 0 1 0 0 1 1 1 0 1 0 0 1 0 1 1 0 1 1 0 0 0 1 1 0 1 1 1 1 1 0 0 1 1 1 1 1 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 Truth Table : f (A, B, C, D) = A B C D + A B C D + A B C D + A B C D + A B C D + A B C D + A B C D The canonical SOP expression : f(A, B, C, D) =(A+B+C+D)(A+B+ C+D)(A+ B+C+D)(A+ B+ C+D)( A+B+C+D)( A+B+ C+D)( A+B+ C+ D)( A+ B+C+D)( A+ B+ C+D) The canonical POS expression : f(A, B, C, D) m(1,3,5,7,9,13,15) = The minterm list : f(A, B, C, D) = D(AB + C) + ABCD + A B D A nonminimal expression for function f = ABD +
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/02/2011 for the course CS 2204 taught by Professor Hadimioglu during the Spring '10 term at NYU Poly.

Page1 / 2

logicex - CS2204 DIGITAL LOGIC STATE MACHINE DESIGN FALL...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online