A rapid granular method for minimization of Boolean functions is proposed in this paper. Firstly, the Boolean function is changed into the sum of products. Secondly, truth table was got and statistic information under different knowledge space was computed as heuristic information for function minimization. Thirdly, information granules with different granularity were found according to the heuristic information. Finally, if all the terms in information granules have covered the universe, they will be the desired result. The algorithm was realized by
and experiments have shown its high efficiency.