#### Filter Results:

#### Publication Year

1995

2015

#### Publication Type

#### Co-author

#### Publication Venue

#### 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)

The binary 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 for large-scale parallel… (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 hyper-cube is not a good candidate for an interconnection network for a very large parallel computer that might contain… (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 " non-restoring " is on the " partial remainder " , not on " each bit of the square root " , with each iteration. Second, it only… (More)

- Yamin Li, Shietung Peng, Wanming Chu
- 2002

The hypercube has been widely used as the interconnec-tion 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),… (More)

In this paper, we propose a new universal network, called recursive dual-net (RDN), as a potential candidate for the interconnection network of su-percomputers 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) 2 k /2 nodes with… (More)

- Yamin Li, Wanming Chu
- FCCM
- 1996

This paper describes a pipelined processor (named Aizup) design and implementation for the exercise of Computer Architecture/Organization Education at the University of Aizu. The Aizup pipeline has four stages and deals with data dependency and control dependency. The Aizup was designed at Cadence environment and implemented on Xilinx XC4006PC84 FPGA chip.… (More)

This paper introduces a new interconnection network for very large parallel computers called metacube (MC). An MC network has a 2-level cube structure. An MC(k, m) network connects 2 m2 k +k nodes with m + k links per node, where k is the dimension of a high-level cube and m is the dimension of low-level cubes (clusters). An MC network is a symmetric… (More)

Overlay multicast protocols construct a virtual mesh spanning all member nodes of a multicast group. It employs standard unicast routing and forwarding to fulfill multicast functionality. The advantages of this approach are robust-ness and low overhead. However, efficiency and stability are the issues that must be addressed in the mobile ad hoc network… (More)