By Topic

Expediting GA-Based Evolution Using Group Testing Techniques for Reconfigurable Hardware

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 $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)
Oreifej, R.S. ; Coll. of Electr. Eng. & Comput. Sci., Central Florida Univ., Orlando, FL ; Sharma, C.A. ; DeMara, R.F.

Autonomous repair and refurbishment of reprogrammable logic devices using genetic algorithms can improve the fault tolerance of remote mission-critical systems. The goal of increasing availability by minimizing the repair time is addressed in this paper using a CGT-pruned genetic algorithm. The proposed method utilizes resource performance information obtained using combinatorial group testing (CGT) techniques to evolve refurbished configurations in fewer generations than conventional genetic algorithms. A 3-bit times 2-bit multiplier circuit was evolved using both conventional and CGT-pruned genetic algorithms. Results show that the new approach yields completely refurbished configurations 37.6% faster than conventional genetic algorithms. In addition it is demonstrated that for the same circuit, refurbishment of partially-functional configurations is a more tractable problem than designing the configurations when using genetic algorithms as results show the former to take 80% fewer generations

Published in:

Reconfigurable Computing and FPGA's, 2006. ReConFig 2006. IEEE International Conference on

Date of Conference:

Sept. 2006