PL EN


Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
Tytuł artykułu

Pipelined division of signed numbers with the use of residue arithmetic in FPGA

Treść / Zawartość
Identyfikatory
Warianty tytułu
Języki publikacji
EN
Abstrakty
EN
An architecture of a pipelined signed residue divider for small number ranges is presented. The divider makes use of the multiplicative division algorithm where initially the reciprocal of the divisor is calculated and subsequently multiplied by the dividend. The divisor represented in the signed binary form is used to compute the approximated reciprocal in the residue form by the table look-up. In order to reduce the needed length of the look-up table address, a reciprocal computation algorithm based on segmentation of the divisor into two segments is used. The signed approximate reciprocal, transformed to the residue representation, is stored in look-up tables division and multiplied by the dividend in the residue form. The obtained quotient is scaled. The pipelined realization of the divider in the FPGA environment is also shown.
Rocznik
Tom
Strony
455--464
Opis fizyczny
Bibliogr. 14 poz., rys.
Twórcy
autor
  • Gdansk University of Technology, 80-233 Gdańsk, ul. Narutowicza 11/12
autor
  • Gdansk University of Technology, 80-233 Gdańsk, ul. Narutowicza 11/12
autor
  • Gdansk University of Technology, 80-233 Gdańsk, ul. Narutowicza 11/12
Bibliografia
  • [1] Szabo N.S., Tanaka R.I.: Residue Arithmetic and its Applications to Computer Technology, McGraw-Hill, New York, 1967.
  • [2] Soderstrand M. et al., Residue Number System Arithmetic, Modern Applications in Digital Signal Processing, IEEE Press, NY, 1986.
  • [3] Omondi A., Premkumar B., Residue Number Systems: Theory and Implementation, London, Imperial College Press, 2007.
  • [4] Jenkins W.K., Krogmeier J.V.: The design of dual-mode complex signal processors based on quadratic modular number codes, IEEE Trans. on Circuits and Systems, Volume 34, Number 4, pp. 354-364, 1987.
  • [5] Keir, Y.A, Cheney P.W., Tanenbaum M.: Division and overflow detection in residue number systems, IRE Trans. Electron. Comput., Volume EC-11, pp. 501-507, 1962.
  • [6] Kinoshita E., Kosako H., Koyima Y.: General division in symmetric residue number systems, IEEE Trans. on Computers, Volume C-22, pp. 134-142, 1973.
  • [7] Banerji D.K., Cheung T.Y., Ganesan V.: A high speed division method in residue arithmetic, Proc. of 5th IEEE Symp. on Comput. Arithm., pp. 331-342, 1981.
  • [8] Lin, M. L., Leiss, E., McInnis B.: Division and sign detection algorithms for residue number systems, Comput. Math. Appl. Volume 10, Number4/5, pp. 331-342, 1984.
  • [9] Chren W.A., Jr.: A new residue number system division algorithm, Comput. Math. Appl., vol.19, Number 7, pp. 13-29, 1990.
  • [10] Lu M, Chiang Jen-Shiun: A novel division algorithm for the residue number system, IEEE Trans. on Comput., Volume C-41, pp. 1026-1032, 1992.
  • [11] Hiasat A.A., Zohdy,H.A.A.: Semi-custom VLSI design and implementation of a new efficient RNS division algorithm, Computer Journal, Volume 42, Number3, pp. 232-240, 1999.
  • [12] Talameh S., Siy P.: Arithmetic division in RNS using Galois field GF(p), Comput. Math. Appl., Volume 39, pp. 227-238, 2000.
  • [13] Hitz, M.A., Kaltofen, E: Integer division in residue number system, IEEE Trans. on Computers, Volume C-44, pp. 983-989, 1995.
  • [14] Czyżak, M.: Noniterative small range residue division, RADIOELEKTRONIKA May 14-16, Bratislava, pp.111-114, 2002.
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-1febfb9f-6d36-45dc-8a39-2e8402fafe86
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.