It seems that Karnaugh maps and Quine–McCluskey algorithm are used to minimize the general number of gates to represent some truth table (boolean function) with $n$ inputs (usually small $n$) and one output.
My problem is different from the problems the above techniques solve in two aspects:
- Need to consider 2-output-bit rather than 1
- Can use AND, NOT, XOR and need to minimize number of AND where the number of XOR and NOT gates do not matter.
The functions I'm working on have 4 input bits. My question is whether there is a way to determine the minimum number of AND gates for realizing certain function.