Redundant CORDIC Methods with a Constant Scale Factor for Sine and Cosine Computation
IEEE Transactions on Computers
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)
Pipelined Architecture for Additive Range Reduction
Journal of Signal Processing Systems
High-speed algorithms and architectures for range reduction computation
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
| Hi-index | 14.98 |
In this paper, we present a novel algorithm and the corresponding architecture for performing range reduction, which is a preprocessing task required for the evaluation of some elementary functions such as trigonometric and exponential-based functions. The proposed algorithm introduces a modification to the Modular Range Reduction algorithm which increases the speed of computation and allows us to design an architecture for the floating-point case. The implementation presented admits as an input argument any representable number of the standard single precision IEEE 754 floating-point representation and provides the maximum accuracy to the final result. This supposes a hardware solution to the problem of having an input argument close to a multiple of the constant. A final comparison with other implementations is presented.