首页> 外文会议>IEEE International Symposium on Circuits and Systems >A Fast Algorithm to Reduce 2-Dimensional Assignment Problems to 1-Dimensional Assignment Problems for FPGA-based Fault Simulation
【24h】

A Fast Algorithm to Reduce 2-Dimensional Assignment Problems to 1-Dimensional Assignment Problems for FPGA-based Fault Simulation

机译:一种快速算法,将二维分配问题减少到基于FPGA的故障模拟的1维分配问题

获取原文

摘要

In this paper a polynomial time heuristic algorithm developed for the assignment optimization problem is introduced, which leads to an improved usage of field programmable gate array (FPGA) resources for hardware-based fault injection using an FPGA-based logic emulator. Logic emulation represents a new method of design validation utilizing a reprogrammable prototype of a digital circuit. In the past years various approaches to hardware-based fault injection using a hardware logic emulator have been presented. Some approaches insert additional functions at the fault location, while others utilize the reconfigurability of FPGAs. A common feature of each of these methods is the execution of hardware-based fault simulation using the stuck-at fault model at gate level.
机译:在本文中,引入了开发用于分配优化问题的多项式时间启发式算法,这导致使用基于FPGA的逻辑仿真器的基于硬件的故障注射的现场可编程门阵列(FPGA)资源的使用。逻辑仿真表示利用数字电路的重新编程原型的设计验证的新方法。在过去几年中,已经提出了使用硬件逻辑仿真器的基于硬件的故障注入的各种方法。有些方法在故障位置插入附加功能,而其他方法利用FPGA的可重新配置性。这些方法中的每一种的共同特征是在门级别使用卡住故障模型执行基于硬件的故障仿真。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号