Problem Quine-McClusky

Hi everyone,

I'd kindly ask some help with a problem using Quine-McClusky method. I'm following the instruction on this web site:

Below I write the true table of the function that I'm trying to minimize:

ROW ABCD OUTPUT

00 0000 1 01 0001 0 02 0010 0 03 0011 1 04 0100 0 05 0101 1 06 0110 0 07 0111 1 08 1000 0 09 1001 0 10 1010 0 11 1011 1 12 1100 0 13 1101 1 14 1110 0 15 1111 1

Step one: build a second table that contains only the minterms that require the output to be true ROW ABCD OUTPUT

00 0000 1 03 0011 1 05 0101 1 07 0111 1 11 1011 1 13 1101 1 15 1111 1

Matching up entries:

### 0000 ### ### 0011 ### Matching: 0111 : 0111 03,07 0x11 OK Matching: 1011 : 1011 03,11 x011 OK ### 0101 ### Matching: 0111 : 0111 05,07 01x1 OK Matching: 1101 : 1101 05,13 x101 1