• DocumentCode
    1561780
  • Title

    A fast algorithm to reduce 2-dimensional assignment problems to 1-dimensional assignment problems for FPGA-based fault simulation

  • Author

    Sedaghat, Reza

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Ryerson Univ., Ont., Canada
  • Volume
    5
  • fYear
    2003
  • Abstract
    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.
  • Keywords
    circuit optimisation; fault simulation; field programmable gate arrays; simulated annealing; 1-dimensional assignment problems; FPGA-based fault simulation; assignment optimization problem; design validation; fault location; hardware-based fault injection; logic emulator; polynomial time heuristic algorithm; reconfigurability; stuck-at fault model; Circuit faults; Design methodology; Emulation; Field programmable gate arrays; Heuristic algorithms; Logic circuits; Logic design; Polynomials; Programmable logic arrays; Reconfigurable logic;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Circuits and Systems, 2003. ISCAS '03. Proceedings of the 2003 International Symposium on
  • Print_ISBN
    0-7803-7761-3
  • Type

    conf

  • DOI
    10.1109/ISCAS.2003.1206234
  • Filename
    1206234