By Topic

Self-checking logic design for FPGA implementation

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

2 Author(s)
P. K. Lala ; Dept. of Comput. Sci. & Comput. Eng., Univ. of Arkansas, Fayetteville, AR, USA ; A. L. Burress

Field programmable gate arrays (FPGAs) are being increasingly used in many systems including intelligent instrumentation. A synthesis algorithm for generating self-checking combinational logic for implementation on look-up table based FPGAs is presented. The algorithm maps Boolean functions into FPGAs such that self-checking features are automatically incorporated into designs, allowing on-line detection of faults in the combinational function block within any configurable logic block of an FPGA and on the interconnect lines that connect these blocks. This is accomplished by utilizing two types of cells, a functional cell and a checker cell, that generate complementary outputs during normal operation, and outputs of the same value in the presence of a fault. If a fault occurs in any intermediate functional cell, it is automatically propagated to the primary outputs. A checker cell is then used to verify the correctness of the final outputs, thus allowing self-checking.

Published in:

IEEE Transactions on Instrumentation and Measurement  (Volume:52 ,  Issue: 5 )