Optimal universal logic modules for the synthesis of arbitrary logic functions

It is well known that any n-variable logic function can be realized by a 2^n-1-input multiplexer (universal logic module). A computationally simple condition to determine whether a given n-variable logic function is realizable by a multiplexer having 2^n-2 or fewer inputs is formulated, and an algorithm for finding the set of control variables for an optimal multiplexer realization is presented