Chih-Hung Yen

Learn More
In this paper, a high-speed Baugh-Wooley multiplier using skew-tolerant domino techniques is presented. Compared with the conventional architecture, it is demonstrated that the performance is improved from the simulation results since the conventional multipliers suffer significant timing overhead due to system clock skew and logic path unbalance, which in(More)
Consider a graph G consisting of a vertex set V (G) and an edge set E(G). Let∆(G) and χ(G) denote the maximum degree and the chromatic number of G, respectively. We say that G is equitably ∆(G)-colorable if there exists a proper ∆(G)-coloring of G such that the sizes of any two color classes differ by at most one. Obviously, if G is equitably(More)
A bit permutation network is an s-stage interconnection network composed of dn−1 d × d crossbar switches in each stage. This class of networks includes most of the multistage interconnection networks. Recently, Chang et al. [Networks 33 (1999), 261–267] showed that an sstage d-nary bit permutation network N with dn inputs (outputs) can be characterized by(More)
The conventional architecture suffers significant timing overhead due to system clock skew and logic path unbalance, which in turn decreases the performance of a circuit. This paper presents a design of high-speed Baugh-Wooley multiplier based on skew-tolerant domino. From simulation results, it is demonstrated that the performance is improved.
tensen, P. Wurz, K.-H. Glassmeier, C. Shinohara, T. Girard, G. Heinsohn, R. Furfaro, T. Gardner, D. Cheeseman, R. Beatty, J. Ludwinski, T. Kowalkowski, C. Yen, T. Elliott, E. Turtle, K. Strohbehn, J. Janesick, C. Falco, R. Evans University of Arizona (Tucson,, USGS, SwRI/Boulder, U. Bern, JPL, ASU, IGEP, Microsat Systems Inc.,(More)
A linear k-forest is a forest whose components are paths of length at most k. The linear k-arboricity of a graph G, denoted by lak(G), is the least number of linear k-forests needed to decompose G. In this paper, we completely determine lak(G) when G is a balanced complete bipartite graph Kn,n or a complete graph Kn, and k = 3. © 2007 Elsevier B.V. All(More)
Let G be any graph, and also let ∆(G), χ(G) and α(G) denote the maximum degree, the chromatic number and the independence number of G, respectively. A chromatic coloring of G is a proper coloring of G using χ(G) colors. A color class in a proper coloring of G is maximum if it has size α(G). In this paper, we prove that if a graph G (not necessarily(More)
  • 1