Jump to content
Electronics-Lab.com Community

cahlucas

Members
  • Content Count

    2
  • Joined

  • Last visited

  1. Hello everyone, In connection with the development of a program for Boolean minimization, think e.g. to Quine-McCluskey, I need examples and their correct solution so that I can check my program for correct operation. The number of variables may not exceed 20, and preferably between 4 and 10. The examples may be presented in this form (see the truth table below): X {A, B, C, D} = Σ {2,4,5,6,9,10,13,14}, with the solution: CD'+A'BC'+AC'D (C AND (NOT D) OR (NOT A) AND B AND (NOT C) OR A AND (NOT C) AND D). I would like to receive a response from you. Kind regards, Karel. i A B C D X 0
  2. Hello everyone, For a programming project I am dealing with Boolean algebra which I cannot figure out. It's about minimizing gate logic using Petricks method. For those of you who are not familiar with this, I have added a link at the bottom. The part that I can't figure out is just after the part where it says: = (K + LM) (N + LQ) (P + MQ). I cannot follow how the Bolean algebra ends up on this, given the formulas in the text. I hope that maybe someone among you is very adept at this and can explain it to me. Thanks in advance. Kind regards, Karel. https://en.wikipedia.org/wiki/
×
  • Create New...