The Algorithm for Logic Function High-order c-Partial Boolean Derivative

To cope with the problem that the existing algorithms were unable to calculate the high-order c-partial derivative of the Boolean functions with large number of inputs,an effective algorithm based on the bit-wise operation was proposed.And the calculation of the high-order c-partial derivative was finished by the product terms expansion using bit-wise operation,rather than by the definition.Further,in order to accelerate the calculation speed,the logic function was divided into two parts according to the variables whether they were needed to be expanded or not.The proposed algorithm was implemented in C and tested under MCNC benchmarks.The experimental results show that the proposed algorithm can carry out the results quickly for the large functions.And its running time is related to the result of function decomposition,but less affected by the number of input variables.