Showing papers on "Elementary function published in 1978"
TL;DR: A pipelined computer architecture for rapid consecutive evaluation of several elementary functions using basic CORDIC algorithms and a new functional efficiency is defined for pipeline architectures which compares favorably to iterative arrays.
7 citations
18 Oct 1978
TL;DR: The purpose of this paper is to summarize proposed specifications for floating-point arithmetic and elementary functions, which are intended to be entirely at the level of a programming language such as Fortran.
Abstract: The purpose of this paper is to summarize proposed specifications for floating-point arithmetic and elementary functions. The topics considered are: the base of the number system, precision control, number representation, arithmetic operations, mother basic operations, elementary functions, and exception handling. The possibility of doing without fixed-point arithmetic is also discussed. The specifications are intended to be entirely at the level of a programming language such as Fortran. The emphasis is on convenience and simplicity from the user's point of view. The specifications are not complete in every detail, but it is intended that they be complete "in spirit" — some further details, especially syntatic details, would have to be provided, but the proposals are otherwise relatively complete.
6 citations
TL;DR: The purpose of this talk is to summarize proposed specifications for floating-point arithmetic and elementary functions, which are intended to be entirely at the level of a programming language such as Fortran.
Abstract: The purpose of this talk is to summarize proposed specifications for floating-point arithmetic and elementary functions. The topics considered are: the base of the number system, precision control, number representation, arithmetic operations, other basic operations, elementary functions, and exception handling. The possibility of doing with-out fixed-point arithmetic is also mentioned.The specifications are intended to be entirely at the level of a programming language such as Fortran. The emphasis is on convenience and simplicity from the user's point of view. Conforming to such specifications would have obvious beneficial implications for the portability of numerical software, and for proving programs correct, as well as attempting to provide facilities which are most suitable for the user. The specifications are not complete in every detail, but it is intended that they be complete “in spirit” - some further details, especially syntactic details, would have to be provided, but the proposals are otherwise relatively complete.
4 citations
TL;DR: Software for the CORDIC algorithm as applied to microprocessors can be used as a universal subroutine to generate several elementary functions and the universality of the actual code applies to each of the elementary functions.
1 citations
TL;DR: In this paper, the authors characterize the sequences of functions satisfying f ≥ 1 for all n =exp(f ≥ 1 + 1) for alln, where n is the number of functions in the function.
Abstract: We characterize those sequences {f
n} of entire functions satisfyingf
n=exp(f
n+1) for alln.
1 citations