Skip to main content
Log in

Pipelined Architecture for Additive Range Reduction

  • Published:
Journal of Signal Processing Systems Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Figure 1
Figure 2
Figure 3
Figure 4

Similar content being viewed by others

References

  1. Muller, J. M. (1997). Elementary functions, algorithms and implementation. Boston: Birkhauser.

    MATH  Google Scholar 

  2. Brisebarre, N., Defour, D., Kornerup, P., Muller, J. M., & Revol, N. (2005). A new range-reduction algorithm. IEEE Transactions on Computers, 54, 331–339 (March).

    Article  Google Scholar 

  3. Cody, W., & Waite, W. (1980). Software manual for the elementary functions. Englewood Cliffs, NJ: Prentice-Hall.

    MATH  Google Scholar 

  4. Daumas, M., Mazenc, C., Merrheim, X., & Muller, J. M. (1995). Modular range reduction: a new algorithm for fast and accurate computation of the elementary functions. Universal Journal of Computer Science, 1, 162–175 (March).

    MATH  MathSciNet  Google Scholar 

  5. Payne, M., & Hanek, R. (1983). Radian reduction for trigonometric functions. SIGNUM Newsletter, 18, 19–24.

    Article  Google Scholar 

  6. Villalba, J., Lang, T., & González, M. A. (2006). Double-residue modular range reduction for floating-point hardware implementations. IEEE Transactions on Computers, 55, 254–267 (March).

    Article  Google Scholar 

  7. Koc, C. K., & Hung, C. Y. (1998). Fast algorithm for modular reduction. In IEEPCDT: IEE proceedings on computers and digital techniques (Vol. 145). Piscataway: IEEE.

    Google Scholar 

  8. Ercegovac, M. D., & Lang, T. (2004). Digital arithmetic. San Francisco, CA: Morgan Kaufmann.

    Google Scholar 

  9. Kahan, W. (1996). Lecture notes on the status of IEEE 754. http://http.cs.berkeley.edu/~wkahan/ieee754status/ieee754.ps.

  10. Smith, R. A. (1995). A continued-fraction analysis of trigonometric argument reduction. IEEE Transactions on Computers, 44(11), 1348–1351 (November).

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Francisco J. Jaime.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jaime, F.J., Villalba, J., Hormigo, J. et al. Pipelined Architecture for Additive Range Reduction. J Sign Process Syst Sign Image Video Technol 53, 103–112 (2008). https://doi.org/10.1007/s11265-008-0166-x

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11265-008-0166-x

Keywords

Navigation