@inproceedings{80ddc94c4b8c458c92f08744ef051bfc,

title = "C-testable carry-free divider",

abstract = "In this paper, the design of a C-testable, high-performance carry-free array divider is presented. A radix-2 redundant number based carry-free divider is considered and 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 that used carry propagate adders/subtractors. These dividers are slow because of their O(W2) computation time (where W is the word-length of the divider). High-performance carry-free dividers use carry-free redundant arithmetic adders/subtractors. Due to this feature, they have O(W) computation time. The on-the-fly 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 exhaustively testing all possible combinations at its inputs. Testing of high-performance carry-free dividers is important and has not been addressed before.",

author = "Srinivas, {H. R.} and B. Vinnakota and Parhi, {Keshab K.}",

year = "1993",

month = dec,

day = "1",

language = "English (US)",

isbn = "0818642300",

series = "Proceedings - IEEE International Conference on Computer Design: VLSI in Computers and Processors",

publisher = "Publ by IEEE",

pages = "206--213",

editor = "Anon",

booktitle = "Proceedings - IEEE International Conference on Computer Design",

note = "Proceedings of the 1993 IEEE International Conference on Computer Design: VLSI in Computers & Processors ; Conference date: 03-10-1993 Through 06-10-1993",

}