By Topic

Concurrent Error Detection for Group Look-ahead Binary Adders

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 $31
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)
Langdon, G.G. ; IBM Systems Developnlent Division Laboratory in Endicott, New York, USA ; Tang, C.K.

This paper presents an evaluation of the relative merits of two schemes for performing concurrent error detection in group look-ahead adders. One of the schemes is a residue mod 3 check and the other is a parity prediction check. The Boolean statements that define the operation of group look-ahead adders, concurrent error detection and the Boolean difference serve as background for interpreting the results of the study. The Boolean difference is a tool for calculating the “coverage” of elements in a logical network by error-checking schemes. Some weaknesses in prior studies of coverage calculation are brought to light. Tables showing the number of circuit elements in the various portions of adder and error-checking circuits are given. It is shown that the residue mod 3 check adder is not economical unless the addition operands are already provided with the mod 3 check bits. Thus, a worthwhile comparison of the checking schemes should not proceed without considering the overall data flow checking strategy. In machine organizations with three or more data transfer checks, the parity-checked adder seems to offer a cost advantage.

Note: The Institute of Electrical and Electronics Engineers, Incorporated is distributing this Article with permission of the International Business Machines Corporation (IBM) who is the exclusive owner. The recipient of this Article may not assign, sublicense, lease, rent or otherwise transfer, reproduce, prepare derivative works, publicly display or perform, or distribute the Article.  

Published in:

IBM Journal of Research and Development  (Volume:14 ,  Issue: 5 )