Non-disjoint decomposition of logic functions in Reed-Muller spectral domain

The paper deals with the problems of input variables assigning to the free set bounded set and common set during logic function non-disjoint decomposition. The Ashenhurst and Curtis decompositions are considered with respect to implementation of logic functions in LUT based FPGA. The method of finding profitable common variables set (from the point of view of non-disjoint decomposition) is based on utilization of Logic Differential Calculus and authors experiences. The decomposition is carried out in Reed-Muller spectral domain because the Boolean differentials are easy calculated from Reed-Muller form of logic function which is obtained as reverse Reed-Muller transform. The results of decomposition are very promising.