Skip to main content
Log in

Abstract

Recoding is the process of transforming between digit sets. It is used to reduce the cost and delay of the implementation of arithmetic algorithms, such as digit-recurrence and parallel algorithms for multiplication, division/square-root, and in compound operations. We present a simple and systematic basis for developing these recodings.

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. I. Koren,Computer Arithmetic Algorithms, Prentice-Hall, 1993.

  2. M.D. Ercegovac and T. Lang,Division and Square Root: Digit Recurrence Algorithms and Implementations, Kluwer, 1994.

  3. A.D. Booth, “A signed binary multiplication technique,”Quarterly J. Mechan. Appl. Math., Vol. IV, Pt. 2, pp. 236–240, 1951.

    Article  MathSciNet  Google Scholar 

  4. O.L. MacSorley, “High speed arithmetic in binary computers,”Proc. IRE, Vol. 49, pp. 61–91, Jan. 1961.

    Article  MathSciNet  Google Scholar 

  5. L.P. Rubinfield, “A proof of modified Booth's algorithm for multiplication,”IEEE Transactions on Computers, pp. 1014–1015, Oct. 1975.

  6. S. Vassiliadis, E.M. Schwarz, and D.J. Hanrahan, “A general proof for overlapped multiple-bit scanning multiplications,”IEEE Transactions on Computers, Vol. 38, pp. 172–183, Feb. 1989.

    Article  MATH  Google Scholar 

  7. H. Sam and A. Gupta, “A generalized multibit recoding of two's complement binary numbers and its proof with application in multiplier implementations,”IEEE Transactions on Computers, Vol. 39, No. 8, pp. 1006–1015, Aug. 1990.

    Article  Google Scholar 

  8. P.E. Madrid, B. Millar, and E.E. Swartzlander, Jr., “Modified Booth algorithm for high radix fixed-point multiplication,”IEEE Trans. on VLSI Systems, Vol. 1, No. 2, pp. 164–167, June 1993.

    Article  Google Scholar 

  9. B.W.Y. Wei, H. Du, and H. Chen, “A complex-number multiplier using radix-4 digits,”Proc. 12th IEEE Symposium on Computer Arithmetic, pp. 84–90, 1995.

  10. G. Reitwiesner, “Binary arithmetic,” inAdvances in Computers, Academic Press, NY, 1960, Vol. 1, pp. 232–308.

    Google Scholar 

  11. J.O. Penhollow, A Study of Arithmetic Recoding with Applications to Multiplication and Division, Ph.D. Dissertation, Department of Computer Science, University of Illinois, Urbana, Report No. 128, Sept. 1962.

    Google Scholar 

  12. J.E. Robertson, “The correspondence between methods of digital division and multiplier recoding procedures,”IEEE Transactions on Computers, Vol. C-19, pp. 692–701, 1970.

    Article  MATH  Google Scholar 

  13. F.A. Rohatsch, A Study of Transformations Applicable to the Development of Limited Carry-Borrow Propagation Adders, Ph.D. Dissertation, Department of Computer Science, University of Illinois, Urbana, Report No. 226, June 1, 1967.

    Google Scholar 

  14. T.M. Carter and J.E. Robertson, “The set theory of arithmetic decomposition,”IEEE Transactions on Computers, Vol. 39, No. 8, pp. 993–1005, Aug. 1990.

    Article  Google Scholar 

  15. P. Kornerup, “Digit set conversions: Generalizations and applications,”IEEE Transactions on Computers, Vol. 43, No. 5, pp. 622–629, May 1994.

    Article  MathSciNet  Google Scholar 

  16. A.A. Avizienis, “Signed-digit number representations for fast parallel arithmetic,”IRE Trans. Electron. Comput., Vol. EC-10, No. 9, pp. 389–400, Sept. 1961.

    Article  MathSciNet  Google Scholar 

  17. J. Bruguera and T. Lang, “Implementation of the FFT butterfly with Carry-Save arithmetic,” submitted to theIEEE Transactions on Circuits and Systems, 1995.

  18. M.D. Ercegovac, T. Lang, and P. Montuschi, “Very high radix division with prescaling and selection by rounding,”Trans. on Computers, Vol. 43, No. 8, pp. 909–918, Aug. 1994.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ercegovac, M.D., Lang, T. On recoding in arithmetic algorithms. J VLSI Sign Process Syst Sign Image Video Technol 14, 283–294 (1996). https://doi.org/10.1007/BF00929621

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00929621

Keywords

Navigation