I'm having trouble finding many examples of the Quine-McCluskey method for simplifying boolean functions to learn from. I was wondering if someone could walk me through the Quine-Mccluskey method for simplifying something like:

$\displaystyle g(a,b,c,d) = a'b'cd'+abcd'+a'bcd+a'b'c'd+a'bc'd+a'bcd'+a'bc'd'+ ab'c'd+ab'cd'+a'b'cd$

I am familiar with the Karnaugh map method, it seemed to be along those lines from the wiki page but I couldn't seem to catch on to what was happening exactly.

Thanks.