Back to search

McMaster University

A Formal Approach to Concurrent Error Detection in FPGA LUTs

Abstract

dc:description.abstract

In this thesis we discuss a formal approach to the design of concurrent error detection (CED) logic in field-programmable gate arrays (FPGAs). Single event upsets (SEUs) occurring in look-up table (LUT) configuration bits are considered as the fault model. Our approach involves representing the LUT network of the design implemented in the FPGA with constraints to model the presence of SEUs as a boolean formula in conjunctive normal form. A quantified boolean formula (QBF) based approach to designing CED logic based on parity check codes is found to be infeasible for designs of a realistic size. It is shown that a satisfiability (SAT) solver can be used to find variable assignments that indicate which circuit outputs can be corrupted by upset events in the specified fault model. An algorithm is presented to automatically generate a parity check code, which will identify with one clock cycle detection latency a malfunction caused by an SEU. The resulting parity check logic can be verified using a SAT solver and it is shown to require fewer LUT resources than duplication for most circuits.

Degree

thesis:*
Department dc:contributor.department
Computing and Software
Year dc:date.issued
2012

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Bergstra, Jameson P.
Advisors dc:contributor.advisor
  • Lawford, Mark
  • Nicolici, Nicola

Subjects

dc:subject × 5

Identifiers

dc:identifier.*
Dc Identifier Other
opendissertations/7431
8485
3344563

Chain of custody

source
Harvested from
McMaster University
Base URL
macsphere.mcmaster.ca/server/oai/request
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
citation

Bergstra, Jameson P.. A Formal Approach to Concurrent Error Detection in FPGA LUTs. 2012. http://hdl.handle.net/11375/12555