Discrete Basis and Computation of Elementary Functions

Authors:
Jean-Michel Muller
Affiliations:
Univ. de Grenoble, Saint-Martin D'He`res Cedex, France
Venue:
IEEE Transactions on Computers
Year:
1985

Citing 0
Cited 6

Expanding the Range of Convergence of the CORDIC Algorithm

IEEE Transactions on Computers
Computing Functions cos/sup -1/ and sin/sup -1/ Using CORDIC

IEEE Transactions on Computers
The CORDIC Algorithm: New Results for Fast VLSI Implementation

IEEE Transactions on Computers
Numerical Accuracy and Hardware Tradeoffs for CORDIC Arithmetic for Special-Purpose Processors

IEEE Transactions on Computers
BKM: A New Hardware Algorithm for Complex Elementary Functions

IEEE Transactions on Computers
Reconfigurable Computing: The Theory and Practice of FPGA-Based Computation

Reconfigurable Computing: The Theory and Practice of FPGA-Based Computation

Quantified Score

Hi-index	15.00

Visualization

Abstract

We give necessary and sufficient conditions in order that the infinite product or sum of the terms of a positive decreasing sequence generates the reals in a given interval.