Adaptive exact optimisation of minimally testable FPRM expansions

An adaptive method to minimise fixed-polarity Reed-Muller expansions, combi ning the advantages of efficient data structures in form of both lookup tab les and ternary decision trees, is presented. The algorithm developed conve rts arrays of cubes to exact solutions based on the desired cost criteria f or the systems of completely specified functions. The method also allows on e to combine the design for testability together with minimisation of hardw are realisation. The algorithm shown is fast, efficient and requires smalle r space and time complexity than known algorithms.