BooleanAlgebra-webpageforstaff.pptVIP

* Binary Decoder n inputs 2n outputs Binary Decoder Logic with n input lines and 2n output lines. Only one output is a 1 for any given input. * truth table for 2 to 4 decoder: Note: Each output is a 2-variable minterm (XY, XY, XY or XY) X Y F 0 F 1 F 2 F 3 0 0 1 0 0 0 0 1 0 1 0 0 1 0 0 0 1 0 1 1 0 0 0 1 F0 = XY F1 = XY F2 = XY F3 = XY X Y * 3-to-8-Line Decoder * * * Encoder 2n (or fewer) input lines and n output lines. The output lines generate the binary code corresponding to the input value, assuming only one input is high. An encoder is the reverse function of a decoder * 8-to-3-line Encoder 8-to-3 Encoder * Example: Octal-to-Binary Encoder A0 = A1 = A2 = * Code Converter Example Design a circuit that converts a binary-coded-decimal (BCD) to the seven signals required to drive a seven-segment light-emitting diode (LED) display. Assuming the signal 1 illuminates the segment and a logic-0 signal turns off the segment * * Code Converter Example Derive the Boolean function for each output - e.g., using the following K-map to derive the Boolean function for output a AB CD 00 11 10 01 00 11 10 01 1 0 1 0 0 1 1 0 0 1 1 1 1 0 0 0 a = A’C + A’BD + A’B’D’+ AB’C’ * * * * * * * * C’(0) C(1) A’B’(00) A’B (01) AB (11) AB’ (10) 1 1 1 1 * ???????????????? : ??????? 6 ???? ????????????????????????????????????????????????????????????????? ?????? LED ??????????????????????????????????????????????????????? A B C D E F G * Karnaugh maps with XOR and XNOR XOR : * A B A’ B’ A’B AB’ A’B + AB’ A + B 0 0 1 1 0 0 0 0 0 1 1 0 1 0 1 1 1 0 0 1 0 1 1 1 1 1 0 0 0 0 0 0 Truth table : A’B + AB’ = A + B * XNOR : * A B A’ B’ AB A’B’ AB + A’B’ (A + B)’ 0 0 1 1 0 1 1 1 0 1 1 0 0 0 0 0 1 0 0 1 0 0 0 0 1 1 0 0 1 0 1 1 Truth table :