Elementary functions: algorithms and implementation
Elementary functions: algorithms and implementation
A Continued-Fraction Analysis Of Trigonometric Argument Reduction
IEEE Transactions on Computers
Radian reduction for trigonometric functions
ACM SIGNUM Newsletter
Automating custom-precision function evaluation for embedded processors
Proceedings of the 2005 international conference on Compilers, architectures and synthesis for embedded systems
Double-Residue Modular Range Reduction for Floating-Point Hardware Implementations
IEEE Transactions on Computers
Pipelined Architecture for Additive Range Reduction
Journal of Signal Processing Systems
Design Method for Numerical Function Generators Using Recursive Segmentation and EVBDDs
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
High-speed algorithms and architectures for range reduction computation
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Modulo intervals: a proposed notation
ACM SIGACT News
| Hi-index | 14.99 |
Range-reduction is a key point for getting accurate elementary function routines. We introduce a new algorithm that is fast for input arguments belonging to the most common domains, yet accurate over the full double-precision range.