Question

Problem: The purpose of this lab is to introduce concepts of boolean logic reduction including the use of boolean algebra reduction techniques as well as karnaugh map reduction techniques. Assignment: Consider the following equation: f(A,B,B,D)-ABCD ACDACD A BDACD BCD For this equation, you will need to complete the following objectives: Reduce the equation using boolean algebra (show all work) Reduce the equation using karnaugh mapping techniques Draw the truth table for this circuit -Draw the circuit diagram needed to implement this design Build the digital circuit necessary to implement this logic

the answer on the cheeg is not right. i want a new answer

Answer 1

f = A^- B^- C^- D^- + A C^- D^- + A^- C D^- + ABD + A C D^- + BCD. = A^- B^- C^- D^- + AD^- (C + C^-) + A^- C D^- + ABD + B (1) = A^- D^- (B^- C^- + C) A D^- + ABD + BCD. = A^- D^- (C + B^-) + A D^- + ABD + BCD. = A^- D^- (C + B^-) + A (D^- + BD) + BCD = A^- C D^- + A^- B^- D^- + A D^- + AB + BCD. \r\n given function: - f (A, B, C, D) = A^- B^- C^- D^- + A C^- D^- + A^- C D^- + A C D^- + BCD + ABD Truth Table: - \r\n F = > A^- B^- C^- D^- + A C^- D^- (B + B^-) + A^- C D^- (B + B^-) + A C D^- (B + B^-) + ABD