By Topic

Fast and Efficient Totally Self-Checking Checkers for m-out-of-(2m ± 1) 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)
C. Halatsis ; Digital Systems Laboratory, Computer Center, NRC "Democritos," Aghia Paraskevi Attikis ; N. Gaitanis ; M. Sigala

This note is concerned with the design of fast totally self-checking checkers for m-out-of-(2m ± 1) codes. The new method uses only three levels of gates, and is based on the partitioning of the input lines into m blocks of two lines per block except for the last block. A first level of two-input AND and OR gates realizes the majority functions T(ki ≥ 1) and T(ki ≥ 2). These are combined through AND gates of a second level into the so-called product functions, one for each class of input codewords that have jl, j2,···, jm 1's in the corresponding blocks of the input lines. Finally, two OR gates (third level) partition the product functions into two. The property of totally self-checking operation is achieved through the proper partitioning of the product functions into two classes. This note presents a systematic method of such partitioning. Also, the note determines the cost of these checkers and compares them to previous designs.

Published in:

IEEE Transactions on Computers  (Volume:C-32 ,  Issue: 5 )