By Topic

Efficient design of totally self-checking checkers for all low-cost arithmetic codes

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
$33 $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

3 Author(s)
D. Nikolos ; Comput. Lab., Athens Univ., Greece ; A. M. Paschalis ; G. Philokyprou

A method is proposed that is based on the partitioning of the input code variables into two sections, each section representing the binary form of a number Z1 and Z2, respectively. For a code with check base A =2m-1, two m-bit end-around carry adder trees calculate the modulo m residue of Z1 and Z2, while a totally self-checking (TSC) translator maps the output of the pair of trees onto m-variable two-rail code. A TSC two-rail checker maps the m-variable two-rail code onto one-out-of-two code. The checkers present significant improvement in the implementation cost, number of gate levels, and reliability over TSC checkers previously proposed in the literature

Published in:

IEEE Transactions on Computers  (Volume:37 ,  Issue: 7 )