#### Filter Results:

- Full text PDF available (53)

#### Publication Year

1995

2017

- This year (3)
- Last 5 years (15)
- Last 10 years (42)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Yamin Li, Wanming Chu
- FCCM
- 1997

Square root operation is hard to implement on FPGAs because of the complexity of the algorithms. In this paper, we present a non-restoring square root algorithm and two very simple single precision floating point square root implementations based on the algorithm on FPGAs. One is low-cost iterative implementation that uses a traditional adder/subtractor.… (More)

- Yamin Li, Shietung Peng, Wanming Chu
- The Journal of Supercomputing
- 2004

The hypercube, or n-cube, has been widely used as the interconnection network in parallel computers. However, the major drawback of the hypercube is the increase in the number of communication links for each node with the increase in the total number of nodes in the system. This paper introduces a new interconnection network, namely dual-cube, for… (More)

- Yamin Li, Wanming Chu
- 1996

In this paper, we present a new non-restoring square root algorithm that is very efficient to implement. The new algorithm presented here has the following features unlike other square root algorithms. First, the focus of the “nonrestoring” is on the “partial remainder”, not on “each bit of the square root”, with each iteration. Second, it only requires one… (More)

- Yamin Li, Shietung Peng, Wanming Chu
- 2002

The hypercube has been widely used as the interconnection network (IN) in parallel computers. However, the major drawback of the hypercube is the increase in the number of communication links for each node with the increase in the total number of nodes in the system. A dual-cube DC(m) has m + 1 links per node where m is the degree of a cluster (m-cube), one… (More)

- Yamin Li, Wanming Chu
- ICCD
- 1997

In this paper, we present a parallel-array implementation of a new non-restoring square root algorithm (PASQRT). The carry-save adder (CSA) is used in the parallel array. The PASQRT has several features unlike other implementations. First, it does not use redundant representation for square root result. Second, each iteration generates an exact resulting… (More)

- Wanming Chu, Yamin Li
- ACAC
- 2000

Hardware square-root units require large numbers of gates even for iterative implementations. In this paper, we present four low-cost high-performance fullypipelined n-select implementations (nS-Root) based on a non-restoring-remainder square root algorithm. The nSRoot uses a parallel array of carry-save adders (CSAs). For a square root bit calculation, a… (More)

- Kenji Watanabe, Wanming Chu, Yamin Li
- ACSAC
- 2001

Java bytecodes can be executed with the following three methods: a Java interpretor running on a particular machine interprets bytecodes; a Just-In-Time (JIT) compiler translates bytecodes to the native primitives of the particular machine and the machine executes the translated codes; and a Java processor executes bytecodes directly. The first two methods… (More)

- Yamin Li, Shietung Peng, Wanming Chu
- Sixth International Conference on Parallel and…
- 2005

In this paper, we propose a distributed broadcasting algorithm for wireless ad hoc networks. In the algorithm, an efficient strategy is used to determine the forward status of a node by just checking whether there exists a ring that contains all its neighbors. The proposed algorithm is more efficient than the existing broadcasting algorithms in the… (More)

- Yamin Li, Shietung Peng, Wanming Chu
- 2002

The hypercube has been widely used as the interconnection network for parallel computers. However, in hypercubes, the number of communication links for each node is a logarithmic function of the total number of nodes. Therefore, the hypercube is not a good candidate for an interconnection network for a very large parallel computer that might contain… (More)

- Yamin Li, Shietung Peng, Wanming Chu
- ICA3PP
- 2009

In this paper, we propose a new universal network, called recursive dual-net (RDN), as a potential candidate for the interconnection network of supercomputers with very large scale. The recursive dual-net is based on a recursive dual-construction of a base network. A k-level dual-construction for k > 0 creates a network containing (2m) k /2 nodes with… (More)