期刊文献+

基于输入分解输出匹配的多态自检电路进化设计

Evolutionary Design of Polymorphic Self-checking Circuits Based on Inputs Decomposition and Outputs Matching
下载PDF
导出
摘要 针对进化方法在多态自检电路设计方面存在的扩展性问题,该文提出了一种基于输入分解输出匹配的多态自检电路进化设计方法。该方法将原始电路分解为可进化生成部分和固定部分,由此减少待进化设计电路的输入个数以及适应度评价时真值表输入输出组合数量,从而降低电路进化复杂度;在适应度评价阶段,当电路输出位与理想输出匹配度小于1/2时,通过添加非门的形式提高候选电路适应度和种群多样性,防止最优结构的丢失。进化设计实验将多态门和普通门相结合,进行了两种多态自检加法器的设计。结果表明,与传统多态自检电路进化设计方法相比所提方法进化代数分别减少了47.9%和89.1%,单个测试参量下故障覆盖率分别提高了75.7%和79.7%,具有收敛速度快、扩展性好、故障覆盖率高的优点。 To solve the problem of scalability in designing polymorphic self-checking circuits using evolutionary design,a new method based on inputs decomposition and outputs matching is proposed.The system is decomposed into evolvable part and fixed part,and the number of input-output combinations can be decreased by decomposing the inputs of the system,thus the complexity of evolution is reduced.The NOT gate is added to outputs of the candidate circuits when the matching degree of the outputs is lower than 1/2 compared with desired outputs in the stage of fitness evaluation.The fitness as well as the diversity of the population is increased,and the optimum structure is protected from being eliminated.The evolutionary design experiments for two kind of self-checking adders are conducted by combining the polymorphic gates with ordinary gates.The results show that the generation of evolution is decreased by 47.9% and 89.1% while the fault coverage of single test vector is decreased by 75.7% and 79.7% compared with conventional method in designing polymorphic self-checking circuits.The proposed method enjoys advantages of faster convergence,better scalability and higher fault coverage.
出处 《电子与信息学报》 EI CSCD 北大核心 2012年第6期1494-1500,共7页 Journal of Electronics & Information Technology
基金 国家自然科学基金(61071163) 航空基金(2009ZC52038) 中国博士后基金(20100481143) 南京理工大学自主科研专项计划(2010ZYTS028)资助课题
关键词 大规模集成电路 多态电路 自检电路 进化设计 扩展性 VLSI Polymorphic circuits Self-checking circuits Evolutionary design Scalability
  • 相关文献

参考文献16

  • 1Dutt S, Verma V, and Suthar V. Built-in-Self-Test of FPGAs with provable diagnosabilities and high diagnostic coverage with application to online testing[J]. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2008, 27(2): 309-326.
  • 2Joshi N, Wu K J, Sundararajan J, et al.. Concurrent error detection for involutional functions with applications in fault-tolerant cryptographic hardware design[J]. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2006, 25(6): 1163-1169.
  • 3Vasudevan D P, Lala P K, and Parkerson J P. Self-checking carry-select adder design based on two-rail encoding[J]. IEEE Transactions on Circuits and Systems I: Regular Papers, 2007 54(12): 2696-2705.
  • 4Garvie M. Reliable electronics through artificial evolution [D] [Ph.D. disertation], University of Sussex, 2005.
  • 5Sekanina L. Evolution of polymorphic self-checking circuits [C]. Proc. of the 7th Conference on Evolvable Systems: From Biology to Hardware, Wuhan, China, September 21-23, 2007, 4684: 186-197.
  • 6Ruzicka R, Sekanina L, and Prokop R. Physical demonstration of polymorphic self-checking circuits[C]. Proc. of 14th IEEE International On-Line Testing Symposium, Rhodes, Greece, July 7-9, 2008: 31-36.
  • 7Mashayekhi M, Ardakani H H, and Omidian A. A new efficient scalable BIST full adder using polymorphic gates[C]. Proceedings of World Academy of Science, Engineering and Technology, 2010, 61: 283-286.
  • 8Gajda Z and Sekanina L. Gate-level optimization of polymorphic circuits using Cartesian genetic programming [C]. Proceedings of 2009 IEEE Congress on Evolutionary Computation, Trondheim, Norway, May, 18-21, 2009:1 6.
  • 9Gajda Z and Sekanina L. On evolutionary synthesis of compact polymorphic combinational circuits[J]. Journal of Multiple-Valued Logic and Soft Computing, 2011, 17(6): 607-631.
  • 10Yao X and Higuichi T. Promises and challenges of evolvable hardware[J]. IEEE Transactions on Systems, Man and Cybernetics--Part C: Applications and Reviews, 2005, 14(3): 549-553.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部