Fault tolerance in reversible logic

In recent years reversible logic has offered a promising alternative to traditional logic circuits. Reversible logic introduces a mechanism which allows theoretically zero energy dissipation by eliminating the possibility of information loss. However, it is also desirable that all computation should ideally be done in a fault tolerant manner. To address this we propose techniques to achieve fault tolerance in reversible logic based on a passive hardware redundancy technique. We propose two new designs for a reversible majority voter circuit that can be used to implement fault masking. Comparisons to existing designs are presented in terms of cost metrics such as gate count, garbage outputs, constant inputs, and quantum cost. Comparative failure probability analysis of the proposed voter circuits is also provided. Simulation results of the voter circuit failure probabilities over different numbers of trials are also presented. Our approach can be used to determine the circuit failure probability by using the gate failure probabilities. The proposed methodology can provide useful information for future reversible gate fabrication and designing future fault tolerant reversible circuits

Synthesis, testing and tolerance in reversible logic

In recent years, reversible computing has established itself as a promising research area and emerging technology. This thesis focuses on three important areas of reversible logic, which is an area of reversible computing. Firstly, this thesis proposes a transformation based synthesis approach for realizing conservative reversible functions using SWAP and Fredkin gates. This thesis also proposes ten templates for optimizing SWAP and Fredkin gates-based reversible circuits. Secondly, this thesis proposes an approach for the design of online testable reversible circuits. A reversible circuit composed of NOT, CNOT and Toffoli gates can be made online testable by adding two sets of CNOT gates and a single parity line. Finally, we have proposed an approach to achieve fault tolerance in reversible circuits. A design of a 3-bit reversible majority voter circuit is presented. This voter circuit can be used to design fault tolerant reversible circuits

FPGA BASED SELF-HEALING STRATEGY FOR SYNCHRONOUS SEQUENTIAL CIRCUITS

The paper develops an efficient mechanism with a view to healing bridging faults in synchronous sequential circuits. The scheme inserts faults randomly into the system at the signal levels, encompasses ways to intrigue the state of the signals and carries it with steps to rig out the true values at the primary output lines. The attempts espouse the ability of the methodology to explore the occurrence of a variety of single and multiple bridging faults and arrive at the true output. The approach enables to detect the occurrence of wired-OR and wired AND bridging faults in the combinational part of the serial binary adder as the CUT and heal both the inter and intra-gate faults through the use of the proposed methodology. It allows claiming a lower area overhead and computationally a sharp increase in the fault coverage area over the existing Triple Modular Redundancy (TMR) technique. The Field Programmable Gate Arrays (FPGA) based Spartan architecture operates through Very High-Speed Integrated Circuit Hardware Description Language (VHDL) to synthesize the Modelsim code for validating the simulation exercises. The claim incites to increase the reliability of the synchronous sequential circuits and espouse a place for the use of the strategy in the digital world

Quality and Quantity in Robustness-Checking Using Formal Techniques

Fault tolerance is one of the main challenges for future technology scaling to tolerate transient faults. Various techniques at design level are available to catch and handle transient faults, e.g., Triple Modular Redundancy. An important but missing step is to verify the implementation of those techniques since the implementation might be buggy itself. The thesis is focusing on formally verifying digital circuits with respect to fault-tolerant aspects. It considers transient faults and basically checks whether these faults can influence the output behavior of sequential circuits for any kind of scenarios. As a result the designer is pin-pointed directly to critical parts of the design and gets a prove about the absence of faulty behavior for non-critical parts. The focus of the verification is completeness with respect to the analysis. Three issues need to be adequately addressed: 1) cover all input stimuli, 2) all possible transient faults, and, 3) all possibly exponential long (wrt. to number of state bits) propagation paths. All three issues are addressed in different engines. A tool called RobuCheck has been implemented and evaluated on different academic benchmarks from ITC'99 and industrial benchmarks from IBM

Techniques for the realization of ultra- reliable spaceborne computer Final report

Bibliography and new techniques for use of error correction and redundancy to improve reliability of spaceborne computer

Fault and Defect Tolerant Computer Architectures: Reliable Computing With Unreliable Devices

This research addresses design of a reliable computer from unreliable device technologies. A system architecture is developed for a fault and defect tolerant (FDT) computer. Trade-offs between different techniques are studied and yield and hardware cost models are developed. Fault and defect tolerant designs are created for the processor and the cache memory. Simulation results for the content-addressable memory (CAM)-based cache show 90% yield with device failure probabilities of 3 x 10(-6), three orders of magnitude better than non fault tolerant caches of the same size. The entire processor achieves 70% yield with device failure probabilities exceeding 10(-6). The required hardware redundancy is approximately 15 times that of a non-fault tolerant design. While larger than current FT designs, this architecture allows the use of devices much more likely to fail than silicon CMOS. As part of model development, an improved model is derived for NAND Multiplexing. The model is the first accurate model for small and medium amounts of redundancy. Previous models are extended to account for dependence between the inputs and produce more accurate results

Statistical Effective Fault Attacks: The other Side of the Coin

The introduction of Statistical Ineffective Fault Attacks (SIFA) has led to a renewed interest in fault attacks. SIFA requires minimal knowledge of the concrete implementation and is effective even in the presence of common fault or power analysis countermeasures. However, further investigations reveal that undesired and frequent ineffective events, which we refer to as the noise phenomenon, are the bottleneck of SIFA that can considerably diminish its strength. This includes noise associated with the attack’s setup and caused by the countermeasures utilized in the implementation. This research aims to address this significant drawback. We present two novel statistical fault attack variants that are far more successful in dealing with these noisy conditions. The first variant is the Statistical Effective Fault Attack (SEFA), which exploits the non-uniform distribution of intermediate variables in circumstances when the induced faults are effective. The idea behind the second proposed method, dubbed Statistical Hybrid Fault Attacks (SHFA), is to take advantage of the biased distributions of both effective and ineffective cases simultaneously. Our experimental results in various case studies, including noise-free and noisy setups, back up our reasoning that SEFA surpasses SIFA in several instances and that SHFA outperforms both or is at least as efficient as the best of them

StaTI: Protecting against Fault Attacks Using Stable Threshold Implementations

Fault attacks impose a serious threat against the practical implementations of cryptographic algorithms. Statistical Ineffective Fault Attacks (SIFA), exploiting the dependency between the secret data and the fault propagation overcame many of the known countermeasures. Later, several countermeasures have been proposed to tackle this attack using error detection methods. However, the efficiency of the countermeasures, in part governed by the number of error checks, still remains a challenge. In this work, we propose a fault countermeasure, StaTI, based on threshold implementations and linear encoding techniques. The proposed countermeasure protects the implementations of cryptographic algorithms against both side-channel and fault adversaries in a non-combined attack setting. We present a new composable notion, stability, to protect a threshold implementation against a formal gate/register-faulting adversary. Stability ensures fault propagation, making a single error check of the output suffice. To illustrate the stability notion, first, we provide stable encodings of the XOR and AND gates. Then, we present techniques to encode threshold implementations of S-boxes, and provide stable encodings of some quadratic S-boxes together with their security and performance evaluation. Additionally, we propose general encoding techniques to transform a threshold implementation of any function (e.g., non-injective functions) to a stable one. We then provide an encoding technique to use in symmetric primitives which encodes state elements together significantly reducing the encoded state size. Finally, we used StaTI to implement a secure Keccak on FPGA and report on its efficiency

NOVEL METHODS FOR PERMANENT MAGNET DEMAGNETIZATION DETECTION IN PERMANENT MAGNET SYNCHRONOUS MACHINES

Monitoring and detecting PM flux linkage is important to maintain a stable permanent magnet synchronous motor (PMSM) operation. The key problems that need to be solved at this stage are to: 1) establish a demagnetization magnetic flux model that takes into account the influence of various nonlinear and complex factors to reveal the demagnetization mechanism; 2) explore the relationship between different factors and demagnetizing magnetic field, to detect the demagnetization in the early stage; and 3) propose post-demagnetization measures. This thesis investigates permanent magnet (PM) demagnetization detection for PMSM machines to achieve high-performance and reliable machine drive for practical industrial and consumer applications. In this thesis, theoretical analysis, numerical calculation as well as experimental investigations are carried out to systematically study the demagnetization detection mechanism and post-demagnetization measures for permanent magnet synchronous motors. At first a flux based acoustic noise model is proposed to analyze online PM demagnetization detection by using a back propagation neural network (BPNN) with acoustic noise data. In this method, the PM demagnetization is detected by means of comparing the measured acoustic signal of PMSM with an acoustic signal library of seven acoustical indicators. Then torque ripple is chosen for online PM demagnetization diagnosis by using continuous wavelet transforms (CWT) and Grey System Theory (GST). This model is able to reveal the relationship between torque variation and PM electromagnetic interferences. After demagnetization being detected, a current regulation strategy is proposed to minimize the torque ripples induced by PM demagnetization. Next, in order to compare the demagnetization detection accuracy, different data mining techniques, Vold-Kalman filtering order tracking (VKF-OT) and dynamic Bayesian network (DBN) based detection approach is applied to real-time PM flux monitoring through torque ripple again. VKF-OT is introduced to track the order of torque ripple of PMSM running in transient state. Lastly, the combination of acoustic noise and torque is investigated for demagnetization detection by using multi-sensor information fusion to improve the system redundancy and accuracy. Bayesian network based multi-sensor information fusion is then proposed to detect the demagnetization ratio from the extracted features. During the analysis of demagnetization detection methods, the proposed PM detection approaches both form torque ripple and acoustic noise are extensively evaluated on a laboratory PM machine drive system under different speeds, load conditions, and temperatures

Resilience of an embedded architecture using hardware redundancy

In the last decade the dominance of the general computing systems market has being replaced by embedded systems with billions of units manufactured every year. Embedded systems appear in contexts where continuous operation is of utmost importance and failure can be profound. Nowadays, radiation poses a serious threat to the reliable operation of safety-critical systems. Fault avoidance techniques, such as radiation hardening, have been commonly used in space applications. However, these components are expensive, lag behind commercial components with regards to performance and do not provide 100% fault elimination. Without fault tolerant mechanisms, many of these faults can become errors at the application or system level, which in turn, can result in catastrophic failures. In this work we study the concepts of fault tolerance and dependability and extend these concepts providing our own definition of resilience. We analyse the physics of radiation-induced faults, the damage mechanisms of particles and the process that leads to computing failures. We provide extensive taxonomies of 1) existing fault tolerant techniques and of 2) the effects of radiation in state-of-the-art electronics, analysing and comparing their characteristics. We propose a detailed model of faults and provide a classification of the different types of faults at various levels. We introduce an algorithm of fault tolerance and define the system states and actions necessary to implement it. We introduce novel hardware and system software techniques that provide a more efficient combination of reliability, performance and power consumption than existing techniques. We propose a new element of the system called syndrome that is the core of a resilient architecture whose software and hardware can adapt to reliable and unreliable environments. We implement a software simulator and disassembler and introduce a testing framework in combination with ERA’s assembler and commercial hardware simulators