Note: working on Quine-McClusky now. 
Always wanted a high speed lib for logic reductions ...
Always wanted a high speed lib for logic reductions ...Alright, got Quine-McCluskey implemented. Also implements logred_set_equiv(a,b) which goes through all possible input permutations and confirms "a" behaves the same as "b".
Q-McC is an expensive operation (Q-McC on r05 takes a full second when compiled with -s -O6), so I have not included it in logred_set_reduce().
It reduces r05 (the 6th bit in 32bit addition) from
Code:
r05 (terms= 1120, symbols= 8842, uniqueSymbols=12)
toCode:
r05 (terms= 156, symbols= 1080, uniqueSymbols=12)
It has no effect on c00,c01,..ci
Still don't think you'll find what you're looking for. But have fun!
logred_v7.zip