This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Improved Vector-Reduction Method
February 1991 (vol. 40 no. 2)
pp. 214-217

A pipelined vector-reduction method that is based on L.M. Ni and K. Hwang's (1985) symmetric and asymmetric reduction methods is discussed. It is shown that the proposed method is the fastest among known pipelined vector-reduction methods.

[1] D. J. Kuck,The Structure of Computers and Computations, vol. 1. New York: Wiley, 1978.
[2] P. M. Kogge,The Architecture of Pipelined Computers. New York: McGraw-Hill, 1981.
[3] L. M. Ni and K. Hwang, "Vector reduction methods for arithmetic pipelines,"IEEE Trans. Comput., vol. C-34, no. 5, May 1985.
[4] H. X. Lin and H. J. Sips, "Vector-reduction algorithms and architectures,"J. Parallel Distributed Comp., vol. 5, no. 2, 1988.

Index Terms:
symmetric reduction methods; pipelined vector-reduction method; asymmetric reduction methods; digital arithmetic; pipeline processing.
Citation:
H.J. Sips, H. Lin, "An Improved Vector-Reduction Method," IEEE Transactions on Computers, vol. 40, no. 2, pp. 214-217, Feb. 1991, doi:10.1109/12.73591
Usage of this product signifies your acceptance of the Terms of Use.