By Topic

BDD/AOG-based algorithm for multiple error rectification in combinational circuits

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

1 Author(s)
A. M. Wahba ; Dept. of Comput. & Syst. Eng., Ain Shams Univ., Cairo, Egypt

This paper presents a new algorithm for multiple error rectification in combinational logic circuits. The method is based on the use of AND/OR graphs and binary decision diagrams. AND/OR graphs are the corner stone of the rectification algorithm, while BDD's are used to build the AND/OR graphs. A completely automated algorithm is presented for tree structured circuits and a semi-automated one for general circuits. The complexity of the algorithm and the execution times are independent of the number of errors

Published in:

Electronics, Circuits and Systems, 2000. ICECS 2000. The 7th IEEE International Conference on  (Volume:2 )

Date of Conference: