Skip to main content

Table-Based Division by Small Integer Constants

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7199))

Abstract

Computing cores to be implemented on FPGAs may involve divisions by small integer constants in fixed or floating point. This article presents a family of architectures addressing this need. They are derived from a simple recurrence whose body can be implemented very efficiently as a look-up table that matches the hardware resources of the target FPGA. For instance, division of a 32-bit integer by the constant 3 may be implemented by a combinatorial circuit of 48 LUT6 on a Virtex-5. Other options are studied, including iterative implementations, and architectures based on embedded memory blocks. This technique also computes the remainder. An efficient implementation of the correctly rounded division of a floating-point constant by such a small integer is also presented.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. de Dinechin, F., Pasca, B.: Designing custom arithmetic data paths with FloPoCo. IEEE Design & Test of Computers 28(4) (August 2011)

    Google Scholar 

  2. Ercegovac, M.D., Lang, T.: Digital Arithmetic. Morgan Kaufmann (2003)

    Google Scholar 

  3. Artzy, E., Hinds, J.A., Saal, H.J.: A fast division technique for constant divisors. Communications of the ACM 19, 98–101 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  4. de Dinechin, F.: Multiplication by rational constants. IEEE Transactions on Circuits and Systems II (to appear, 2012)

    Google Scholar 

  5. Li, S.-Y.R.: Fast constant division routines. IEEE Transactions on Computers C-34(9), 866–869 (1985)

    Google Scholar 

  6. Srinivasan, P., Petry, F.: Constant-division algorithms. IEE Proc. Computers and Digital Techniques 141(6), 334–340 (1994)

    Article  MATH  Google Scholar 

  7. Doran, R.W.: Special cases of division. Journal of Universal Computer Science 1(3), 67–82 (1995)

    MathSciNet  Google Scholar 

  8. Paplinski, A.: CSE2306/1308 Digital Logic Lecture Note, Lecture 8. Clayton School of Information Technology Monash University, Australia (2006)

    Google Scholar 

  9. Muller, J.-M., Brisebarre, N., de Dinechin, F., Jeannerod, C.-P., Lefèvre, V., Melquiond, G., Revol, N., Stehlé, D., Torres, S.: Handbook of Floating-Point Arithmetic. Birkhauser, Boston (2009)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

de Dinechin, F., Didier, LS. (2012). Table-Based Division by Small Integer Constants. In: Choy, O.C.S., Cheung, R.C.C., Athanas, P., Sano, K. (eds) Reconfigurable Computing: Architectures, Tools and Applications. ARC 2012. Lecture Notes in Computer Science, vol 7199. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28365-9_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-28365-9_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-28364-2

  • Online ISBN: 978-3-642-28365-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics