Efficient kernel generation based on implicit cube set representations andits applications

This paper presents a new method that efficiently generates all of the kern els of a sum-of-products expression. Its main feature is the memorization o f the kernel generation process by using a graph structure and implicit cub e set representations. We also show its applications for common logic extra ction. Our extraction method produces smaller circuits through several exte nsions than the extraction method based on two-cube divisors known as best ever.