By Topic

A dual-field modular division algorithm and architecture for application specific hardware

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Tawalbeh, L.A. ; Dept. of Electr. Eng. & Comput. Sci., Oregon State Univ., Corvallis, OR, USA ; Tenca, A.F. ; Park, S. ; Koc, C.K.

This paper presents a dual-field modular division (inversion) algorithm and its hardware design. The algorithm is based on the Extended Euclidean and the Binary GCD algorithms. The use of counters to keep track of the difference between field elements in this algorithm eliminates the need for comparisons which are usually expensive and time-consuming. The algorithm has simple control flow and arithmetic operations making it suitable for application specific hardware implementation. The proposed architecture uses a scheduling method to reduce the number of hardware resources without significantly increasing the total execution time. Its datapath efficiently supports all the operations in the algorithm and uses carry-save unified adders for reduced critical path delay, making the proposed architecture faster than other previously proposed designs. Experimental results using synthesis for AMI 0.5 μm CMOS technology are shown and compared with other dividers.

Published in:

Signals, Systems and Computers, 2004. Conference Record of the Thirty-Eighth Asilomar Conference on  (Volume:1 )

Date of Conference:

7-10 Nov. 2004