A C-testable carry-free divider

Abstract

In this paper, the design of a C-testable, highperformance carry-free array divider is presented. A radix-2 redundant number based carry-free divider is considered and is modified to make it C-testable, i.e., it can be exhaustively tested using a constant number of test vectors irrespective of its word-length. Previous C-testable designs considered dividers which used carry-propagate adderskubtractors. These dividers are slow because of their O(W2) computation time (where IT' is the word-length of the divider). High-performance carry-free dividers use carry-free redundant arithmetic adderdsubtractors. Due to this feature, they have O(W) computation time. The on-the-Jly converter used by carry-free dividers to convert the redundant quotient to two's-complement form is shown to be not C-testable. It is modified to be linear-testable (in word-length) instead of exponential time required for exhaustive testing of all possible combinations at its inputs. We conclude that the number of test vectors needed is 99 for C-testing of the divider array and (3W + 10) for linear testing of the converter. The hardware overhead required to make the divider C-testable and the on-theJly converter linear testable is also shown to be nominal.