
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
David M. Mandelbaum, Stefanie G. Mandelbaum, "A Fast, Efficient ParallelActing Method of Generating Functions Defined by Power Series, Including Logarithm, Exponential, and Sine, Cosine," IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 1, pp. 3345, January, 1996.  
BibTex  x  
@article{ 10.1109/71.481596, author = {David M. Mandelbaum and Stefanie G. Mandelbaum}, title = {A Fast, Efficient ParallelActing Method of Generating Functions Defined by Power Series, Including Logarithm, Exponential, and Sine, Cosine}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {7}, number = {1}, issn = {10459219}, year = {1996}, pages = {3345}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.481596}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  A Fast, Efficient ParallelActing Method of Generating Functions Defined by Power Series, Including Logarithm, Exponential, and Sine, Cosine IS  1 SN  10459219 SP33 EP45 EPD  3345 A1  David M. Mandelbaum, A1  Stefanie G. Mandelbaum, PY  1996 KW  Arrays KW  cosine KW  exponential KW  functions KW  logarithm KW  multinomials KW  multiplier tree KW  partitions KW  power series KW  sine. VL  7 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—A fundamental parallel procedure of implementing certain algorithms is by means of trees and arrays, [1]. A method of generating any function defined by a power series in a fast, efficient parallelacting manner using trees and arrays is described. The power series considered can be written as f(Y) = a_{0} + a_{1}Y + a_{2}Y
[1] F.T. Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes.San Mateo, Calif.: Morgan Kaufmann, 1992.
[2] R. Stefanelli,"A suggestion for a highspeed parallel binary divider," IEEE Trans. Computers, vol. 21, no. 1, pp. 4245, Jan. 1972.
[3] D.M. Mandelbaum,“A systematic method for division with high average bit skipping,” IEEE Trans. Computers, vol. 39, pp. 127130, Jan. 1990.
[4] E.M. Schwarz and M.J. Flynn,“Cost efficient high radix division,” J. VLSI Signal Processing, pp. 293305, Aug. 1991.
[5] D. Knuth, The Art of Computer Programming, Vol. 2, AddisonWesley, Reading, Mass., 1998.
[6] J.N. Mitchell Jr.,"Computer multiplication and division using binary logarithm," IRE Trans. Electronic Computers, vol. 11, pp. 512517, Aug. 1962.
[7] H.Y. Lo and Y. Aoki,"Generation of a precise binary logarithm with difference grouping programmable logic array," IEEE Trans. Computers, vol. 34, no. 8, pp. 681692, Aug. 1985.
[8] I. Niven and H.S. Zuckerman, An Introduction to the Theory of Numbers. New York: J. Wiley, 1958.
[9] K. Hwang,, Computer Arithmetic, Principles, Architecture, and Design.New York: John Wiley&Sons, 1979.
[10] G. Chrystal, Algebra, Part II. New York: Chelsea, 1952.
[11] D.M. Mandelbaum,“Some results on a SRT type division scheme,” IEEE Trans. Computers, vol. 42, pp. 102106, Jan. 1993.
[12] E.M. Schwarz and M.J. Flynn, "Approximating the Sine Function with Combinational Logic," Proc. 26th Asilomar Conf. Signals, Systems, and Computers, vol. 1, pp. 386390, Oct. 1992.
[13] E.M. Schwarz and M.J. Flynn,“Hardware starting approximation for the square root operation,” Proc. IEEE 11th Symp. Computer Arithmetic, pp. 10311, 1993.
[14] A. Neumaier, Interval Methods for Systems of Equations. London: Cambridge Univ. Press, 1990.
[15] E.M. Schwarz,“Highradix algorithms for highorder arithmetic expressions,” doctorial dissertation, Stanford Univ., Jan. 1993.
[16] E.M. Schwarz and M.J. Flynn,"Using a floatingpoint multiplier to sum signed Boolean elements," Technical Report CSLTR92540, Stanford Univ., Aug. 1992
[17] A. Nijenhuis and H. Wilf, Combinatorial Algorithms: For Computers and Calculators, 2nd ed., Academic Press, New York, 1978, p. 56.
[18] P.T.P. Tang, "TableDriven Implementation of the Logarithm Function in IEEE FloatingPoint Arithmetic," ACM Trans. Math. Software, vol. 16, no. 4, pp. 378400, 1990.
[19] D. Wong and M. Flynn,“Fast division using accurate quotient approximations to reduce the number of iterations,” IEEE Trans. Computers, vol. 41, pp. 981995, Aug. 1992.
[20] T.R.N. Rao, Error Coding for Arithmetic Processors.New York: Academic Press, 1974.
[21] C. Hastings Jr., Approximations for Digital Computers. Princeton, N.J.: Princeton Univ. Press, 1955.
[22] P.M. Farmwald,"High bandwidth evaluation of elementary functions," Proc. Fifth Symp. Computer Arithmetic, pp. 139142, 1981.
[23] J. Child,"RISC and pentium drive demand for SRAMs that are the fastest of the fast," Computer Design, vol. 33, no. 4, pp. 4754, 1994.