A fast, efficient parallel-acting method of generating functions defined by power series, including logarithm, exponential, and sine, cosine

IEEE Transactions on Parallel and Distributed Systems

Volumn 7, Issue 1, 1996, Pages 33-45

  Mandelbaum, David M ^a   Mandelbaum, Stefanie G ^a  

^a NONE   (United States)

Author keywords

Arrays; Cosine; Exponential; Functions; Logarithm; Multinomials; Multiplier tree; Partitions; Power series; Sine

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTER HARDWARE; DATA STRUCTURES; DIGITAL ARITHMETIC; FUNCTIONS; LOGIC GATES; MATHEMATICAL TRANSFORMATIONS; PARALLEL ALGORITHMS;

BINARY FRACTION; BOOLEAN LOGIC METHODS; COSINE FUNCTION; EXPONENTIAL FUNCTION; FUNCTION GENERATION; LOGARITHMIC FUNCTION; PARALLEL MULTIPLICATION; POWER SERIES; SINE FUNCTION;

PARALLEL PROCESSING SYSTEMS;

EID: 0029776522     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.481596     Document Type: Article

References (23)

1. F.T. Leighton, Introduction to Parallel Algorithm and Architectures: Arrays, Trees, Hypercubes. San Mateo, Calif.: Morgan Kaufmann, 1992.
2. R. Stefanelli, "A suggestion for a high-speed parallel binary divider," IEEE Trans. Computers, vol. 21, no. 1, pp. 42-45, Jan. 1972.
3. D.M. Mandelbaum, "A systematic method for division with high average bit skipping," IEEE Trans. Computers, vol. 39, no. 1, pp. 127-130, Jan. 1990.
4. E.M. Schwarz and M.J. Flynn, "Cost-efficient high-radix division," J. VLSI Signal Processing, Aug. 1991.
5. D.E. Knuth, The Art of Computer Programming, vol. 2, Section 4.7, Seminumerical Algorithms. Reading Mass.: Addison-Wesley, 1969.
6. J.N. Mitchell Jr., "Computer multiplication and division using binary logarithm," IRE Trans. Electronic Computers, vol. 11, pp. 512-517, 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. 681-692, 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: J. 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, no. 1, pp. 102-106, Jan. 1993.
12. E.M. Schwarz and M.J. Flynn, "Approximating the sine function," Proc. 26th Asilomar Conf. Signals, Systems, and Computers, Oct. 27, 1992.
13. E.M. Schwarz and M.J. Flynn, "Hardware starting approximation for the square root operation," Proc. 11th Symp. Computer Arithmetic, 1993.
14. A. Neumaier, Interval Methods for Systems of Equations. London: Cambridge Univ. Press, 1990.
15. E.M. Schwarz, "High-radix algorithms for high-order arithmetic operations," PhD thesis, Stanford Univ., Jan. 1993.
16. E.M. Schwarz and M.J. Flynn, "Using a floating-point multiplier to sum signed Boolean elements," Technical Report CSL-TR-92-540, Stanford Univ., Aug. 1992
17. A. Nijenhuis and H.S. Wilf, Combinatorial Algorithms: For Computers and Calculators, second edition. Orlando, Fla.: Academic Press, 1978.
18. P.T.P. Tang, "Table-driven implementation of the logarithm function in IEEE floating-point arithmetic," ACM Trans. Math. Software, vol. 16, no. 4, pp. 378-400, Dec. 1990.
19. D. Wong and M.J. Flynn, "Fast division using accurate quotient approximations to reduce the number of iterations," IEEE Trans. Computers, vol. 41, no. 8, pp. 981-995, 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. 139-142, 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. 47-54, 1994.