Elementary functions: algorithms and implementation
Elementary functions: algorithms and implementation
A Continued-Fraction Analysis Of Trigonometric Argument Reduction
IEEE Transactions on Computers
A New Range-Reduction Algorithm
IEEE Transactions on Computers
Radian reduction for trigonometric functions
ACM SIGNUM Newsletter
Software Manual for the Elementary Functions (Prentice-Hall series in computational mathematics)
Software Manual for the Elementary Functions (Prentice-Hall series in computational mathematics)
Double-Residue Modular Range Reduction for Floating-Point Hardware Implementations
IEEE Transactions on Computers
High-speed algorithms and architectures for range reduction computation
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Hi-index | 0.00 |
Range reduction is a crucial step for the accuracy in trigonometric functions evaluation. A new pipelined architecture to deal with range reduction for floating point representation is presented in this paper. The algorithm is based on a look-up table storing the corresponding powers of 2 mod A. The overall design has been optimized for a modulo equal to 2驴, which is the most widely used due to trigonometric functions requirements. We provide an evaluation of different configurations and a full error propagation study which ensures an accuracy of one unit in the last place.