Adaptive exact optimisation of minimally testable FPRM expansions

An adaptive method to minimise fixed-polarity Reed-Muller expansions, combining the advantages of efficient data structures in form of both lookup tables and ternary decision trees, is presented. The algorithm developed converts arrays of cubes to exact solutions based on the desired cost criteria for the systems of completely specified functions. The method also allows one to combine the design for testability together with minimisation of hardware realisation. The algorithm shown is fast, efficient and requires smaller space and time complexity than known algorithms