By Topic

On C-testability of carry free dividers

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

2 Author(s)
Aziz, S.M. ; Sch. of Electr. & Inf. Eng., Univ. of South Australia, Mawson Lakes Campus'', SA, Australia ; Carr, S.J.

This paper examines the C-testability of a carry-free divider architecture that uses a radix-2 number system. This divider is extremely fast in comparison to the traditional carry-propagate method of division. It has a computational time of the order of O(W), while carry-propagate division has a time of the order of O(W). The results of the investigation presented here show that the architecture requires the addition of a significant amount of logic circuitry for correct functionality and uniformity of the inputs and outputs. This paper presents the logic blocks required to turn the architecture into one that can be implemented in hardware and examines the effects of these changes on the computation time and testability

Published in:

Electronic Design, Test and Applications, 2002. Proceedings. The First IEEE International Workshop on

Date of Conference: