I mentioned some months ago a logic minimizer I developed. I've posted it on SourceForge at: https://sourceforge.net/p/ftllm/code/ci/master/tree/
It has a precomputed table of local minimizations it can make and applies them iteratively until it can't make the circuit smaller. Because the reduction table is pre-computed (based on exhaustive search), we can extend it to include arbitrary gates, including XOR (already there) and gates with more than 2 inputs and therefore do reductions of arbitrary complexity, as long as they can be done two levels of logic at a time. -- Timothy Normand Miller, PhD Assistant Professor of Computer Science, Binghamton University http://www.cs.binghamton.edu/~millerti/ Open Graphics Project
_______________________________________________ Open-graphics mailing list [email protected] http://lists.duskglow.com/mailman/listinfo/open-graphics List service provided by Duskglow Consulting, LLC (www.duskglow.com)
