Skip to main content
Log in

A reciprocal confluence tree unit and its applications

  • Part I Computer Science
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

A theorem by Jaeschke is generalized in this paper and a fast and efficient implementation called Reciprocal Confluence Tree unit for implementing the new theorem is sketched. We shall show that it can be used to solve two problems: a hashing algorithm design problem and an access control mechanism design problem.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. R. K. Arora and S. Kaushik,Conversion scheme in residue code, IEEE Proc. Fifth Symp. Computer Arithmetic, May 1981, pp. 152–157.

  2. D. K. Banerji,On the use of residue arithmetic for computation, IEEE Trans. Computers, Vol. C-23, Dec. 1974, pp. 1315–1317.

    Google Scholar 

  3. D. K. Banerji et al.,A high-speed division method in residue arithmetic, IEEE Proc. Fifth Symp. Computer Arithmetic, May 1981, pp. 158–164.

  4. C. C. Chang and C. P. Chen,A key-lock-pair mechanism based on generalized Chinese remainder theorem, Journal of Chinese Institute of Engineers, Vol. 9, No. 4, 1986, pp. 383–390.

    Google Scholar 

  5. R. T. Gregory,Residue arithmetic with rational operands, IEEE Proc. Fifth Symp. Computer Arithmetic, May 1981, pp. 144–145.

  6. G. Jaeschke,Reciprocal hashing: A method for generating minimal perfect hashing functions, Communications of the ACM, Vol. 24, No. 12, Dec. 1981, pp. 829–833.

    Article  Google Scholar 

  7. G. A. Jullien,Residue number scaling and other operations using ROM arrays, IEEE Trans. Computers, Vol. C-27, No. 4, Apr. 1987, pp. 325–336.

    Google Scholar 

  8. E. Kinoshita, H. Kosako and Y. Kojima,Floating-point arithmetic algorithms into the symmetric residue number system, IEEE Trans. Computers. Vol. C-23, No. 1, Jan. 1974, pp. 9–20.

    Google Scholar 

  9. W. J. Leveque,Fundamentals of Number Theory, Reading Mass., Addison-Wesley, 1977.

    Google Scholar 

  10. F. J. Taylor,A VLSI residue arithmetic multiplier, IEEE Trans. Computers, Vol. C-31, No. 6, June 1982, pp. 540–546.

    Google Scholar 

  11. F. J. Taylor,Residue arithmetic: A tutorial with examples, Computer, Vol. 17, No. 5, May 1984, pp. 50–62.

    Google Scholar 

  12. F. J. Taylor and A. S. Ramnarayanan,An efficient residue-to-decimal converter, IEEE Trans. Circuits and Systems, Vol. CAS-28, No. 12, Dec. 1981, pp. 1164–1169.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chang, CC., Lin, CH. A reciprocal confluence tree unit and its applications. BIT 30, 27–33 (1990). https://doi.org/10.1007/BF01932128

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

CR Categories

Keywords

Navigation