• Journal of the Korean Statistical Society
• /
• v.23 no.2
• /
• pp.251-269
• /
• 1994

In this paper we extend Kim and Pollard's cube root asymptotics to other rates of convergence, to establish an asymptotic theory for a multidimensional mode estimator based on uniform kernel with shrinking bandwidths. We obtain rates of convergence depending on shrinking rates of bandwidth and non-normal limit distributions. Optimal decreasing rates of bandwidth are discussed.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.11
• /
• pp.4597-4603
• /
• 2010

A factorization is a very important part of multi-level logic synthesis. The number of literals in a factored form is an estimate of the complexity of a logic function, and can be translated directly into the number of transistors required for implementation. Factored forms are described as either algebraic or Boolean, according to the trade-off between run-time and optimization. A Boolean factored form contains fewer number of literals than an algebraic factored form. In this paper, we present a new method for a Boolean factorization. The key idea is to identify two-cube nonkernel Boolean pairs from given expression. Experimental results on various benchmark circuits show the improvements in literal counts over previous other factorization methods.