Convolutional Code Based Concurrent Error Detection in Finite State Machines Konstantinos N. Rokas Advisor: Prof. Yiorgos Makris.

Slides:



Advertisements
Similar presentations
Introduction to Sequential Circuits
Advertisements

Lecture 21 State minimization via implication charts.
CS1Q Computer Systems Lecture 12 Simon Gay. Lecture 12CS1Q Computer Systems - Simon Gay 2 Design of Sequential Circuits The systematic design of sequential.
Functions and Functional Blocks
VIII - Working with Sequential Logic © Copyright 2004, Gaetano Borriello and Randy H. Katz 1 Finite state machine optimization State minimization  fewer.
TOPIC : Finite State Machine(FSM) and Flow Tables UNIT 1 : Modeling Module 1.4 : Modeling Sequential circuits.
Modern VLSI Design 4e: Chapter 5 Copyright  2008 Wayne Wolf Topics n State assignment. n Power optimization of sequential machines. n Design validation.
FTP Biostatistics II Model parameter estimations: Confronting models with measurements.
LEONARDO INSIGHT II / TAP-MM ASTEP - Basic Test Concepts © J. M. Martins Ferreira - University of Porto (FEUP / DEEC)1 Basic test concepts J. M. Martins.
Finite State Machine Chapter 10 RTL Hardware Design by P. Chu.
9. Fault Modeling Reliable System Design 2011 by: Amir M. Rahmani.
1 EE 587 SoC Design & Test Partha Pande School of EECS Washington State University
II. Linear Block Codes. © Tallal Elshabrawy 2 Last Lecture H Matrix and Calculation of d min Error Detection Capability Error Correction Capability Error.
Self-Checking Circuits
DSD 2007 Concurrent Error Detection for FSMs Designed for Implementation with Embedded Memory Blocks of FPGAs Andrzej Krasniewski Institute of Telecommunications.
CS 151 Digital Systems Design Lecture 25 State Reduction and Assignment.
ECE 331 – Digital System Design
Strong Error Detection for Control Units Against Advanced Attackers Kahraman Daglar Akdemir Advisor: Berk Sunar Electrical and Computer Engineering MOTIVATION.
X-Compaction Itamar Feldman. Before we begin… Let’s talk about some DFT history: Design For Testability (DFT) has been around since the 1960s. The technology.
Equivalence, DFA, NDFA Sequential Machine Theory Prof. K. J. Hintz Department of Electrical and Computer Engineering Lecture 2 Updated and modified by.
Sequential Circuit Design. 2 State Optimization Equivalent States:  Two states are equivalent if, for each member of the set of inputs,  they give exactly.
Finite State Machine Minimization Advanced Methods based on triangular table and binate covering.
Asynchronous Machines
Give qualifications of instructors: DAP
Contemporary Logic Design Finite State Machine Design © R.H. Katz Transparency No Chapter #8: Finite State Machine Design Finite State.
Spring 2002EECS150 - Lec0-intro Page 1 EECS150 - Digital Design Lecture 9 - Finite State Machines 1 February 19, 2002 John Wawrzynek.
Spring 2002EECS150 - Lec15-seq2 Page 1 EECS150 - Digital Design Lecture 15 - Sequential Circuits II (Finite State Machines revisited) March 14, 2002 John.
Modern VLSI Design 2e: Chapter 5 Copyright  1998 Prentice Hall PTR Topics n State assignment. n Power optimization of sequential machines. n Design validation.
Contemporary Logic Design FSM Optimization © R.H. Katz Transparency No Chapter #9: Finite State Machine 9.4 Choosing Flip-Flops 9.5 Machine Partitioning.
Sequential Testing Two choices n Make all flip-flops observable by putting them into a scan chain and using scan latches o Becomes combinational testing.
ENGIN112 L25: State Reduction and Assignment October 31, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 25 State Reduction and Assignment.
Clocked Synchronous State Machine Design
IKI c-Synthesis of Sequential Logic Bobby Nazief Semester-I The materials on these slides are adopted from: Prof. Daniel Gajski’s transparency.
CS3350B Computer Architecture Winter 2015 Lecture 5.2: State Circuits: Circuits that Remember Marc Moreno Maza [Adapted.
ECE 331 – Digital Systems Design Sequential Logic Circuits: FSM Design (Lecture #20)
DYNAMIC TEST SET SELECTION USING IMPLICATION-BASED ON-CHIP DIAGNOSIS Nicholas Imbriglia, Nuno Alves, Elif Alpaslan, Jennifer Dworak Brown University NATW.
Unit V Fault Diagnosis.
Combinatorial Algorithms Unate Covering Binate Covering Graph Coloring Maximum Clique.
Unit 14 Derivation of State Graphs
Logic Synthesis For Low Power CMOS Digital Design.
TELSIKS 2005 Concurrent error detection in FSMs using transition checking technique G. Lj. Djordjevic, T. R. Stankovic and M. K. Stojcev Department of.
Modern VLSI Design 3e: Chapter 5,6 Copyright  2002 Prentice Hall PTR Adapted by Yunsi Fei Topics n Sequential machine (§5.2, §5.3) n FSM construction.
EKT 221/4 DIGITAL ELECTRONICS II  Registers, Micro-operations and Implementations - Part3.
Introduction to Sequential Logic Design Finite State-Machine Design.
1 © 2014 B. Wilkinson Modification date: Dec Sequential Logic Circuits Previously, we described the basic building blocks of sequential circuits,
Introduction to State Machine
1 Note on Testing for Hardware Components. 2 Steps in successful hardware design (basic “process”): 1.Understand the requirements (“product’) 2.Write.
FINITE STATE MACHINES (FSMs)
DLD Lecture 26 Finite State Machine Design Procedure.
Digital Logic Design.
Detecting Errors Using Multi-Cycle Invariance Information Nuno Alves, Jennifer Dworak, and R. Iris Bahar Division of Engineering Brown University Providence,
Timo O. Korhonen, HUT Communication Laboratory 1 Convolutional encoding u Convolutional codes are applied in applications that require good performance.
Data Communications and Networking
R. Johnsonbaugh Discrete Mathematics 5 th edition, 2001 Chapter 10 Automata, Grammars and Languages.
Arithmetic-Logic Units. Logic Gates AND gate OR gate NOT gate.
Synchronous Counter Design
ECE DIGITAL LOGIC LECTURE 15: COMBINATIONAL CIRCUITS Assistant Prof. Fareena Saqib Florida Institute of Technology Fall 2015, 10/20/2015.
Paper by F.L. Kastensmidt, G. Neuberger, L. Carro, R. Reis Talk by Nick Boyd 1.
DS - IX - NFT - 0 HUMBOLDT-UNIVERSITÄT ZU BERLIN INSTITUT FÜR INFORMATIK DEPENDABLE SYSTEMS Vorlesung 9 NETWORK FAULT TOLERANCE Wintersemester 99/00 Leitung:
1 Lecture #14 EGR 277 – Digital Logic Self-starting counters Counters are considered to be self-starting if all unused counts eventually lead to the correct.
EMT 351/4 DIGITAL IC DESIGN Verilog Behavioral Modeling  Finite State Machine -Moore & Mealy Machine -State Encoding Techniques.
Pusat Pengajian Kejuruteraan Mikroelektronik EMT 351/4 DIGITAL IC DESIGN Verilog Behavioural Modeling (Part 4) Week #
Truth Table and Fault Matrix By Dr. Amin Danial Asham.
Self-Checking Circuits
Synthesis of sequential circuits
EGR 2131 Unit 12 Synchronous Sequential Circuits
ECE 352 Digital System Fundamentals
ECE 352 Digital System Fundamentals
CSE 370 – Winter Sequential Logic-2 - 1
Presentation transcript:

Convolutional Code Based Concurrent Error Detection in Finite State Machines Konstantinos N. Rokas Advisor: Prof. Yiorgos Makris

2 Finite State Machine Model Automaton View: State Register (D Flip-Flops) Hardware View: Combinational Next State Logic Input State Next State S1 S2 S5S4 S3 In=1 In=0

3 Concurrent Error Detection FSM Circuit Normal Functionality Concurrent Error Detection Functionality inputs outputs Concurrent Error Detection Output Objective: Obtain an Indication of the Operational Health of the Circuit during Normal Functionality What Can go Wrong? Permanent Faults Intermittent Faults Transient Faults Why do we care? Circuit Reliability & Dependability

4 Non-Intrusive CED – Minimize Delay Basic Principle: Leave Original FSM Intact (Controller Circuits Highly Optimized for Speed) Combinational Next State Logic Input State Register Next State State Simplest Approach: Duplication Duplicate Next State Logic Duplicate Register Next State State Comparator Concurrent Error Detection Output

5 Unrestricted Error Model S1 S2 S5S4 S3 In=1 In=0 Assumption: Malfunctions May Transform a Transition into Any Other Transition Implication (Meyer ’67): Any Concurrent Error Detection for the Unrestricted Model will be as Complex as Duplication S1 S2 S5S4 S3 From S1 on In=1, GM=>S2, BM=> {S1, S3, S4, S5}

6 Restricted Error Model Assumption: Hardware Malfunction Model Pinpoints Set of Erroneous Transitions “Stuck-at” Fault Model: Every Line in the Circuit may be Stuck Permanently at Logic ‘1’ or Logic ‘0’ Standard Industry Model, Acceptable but not Exact Any Model May be Used S1 S2 S5S4 S3 In=1 In=0 S1 S2 S3 From S1 on In=1, GM=>S2, BM=> {S1, S3} DC=> {S4, S5}

7 Convolutional Code-Based Solution State Register (D Flip-Flops) Combinational Next State Logic Next State Input State Key output Logic Error Detecting convolutional Decoder Fault

8 Convolutional Code-How it works Codeword 1->1->6 is a valid codeword (occurs when input to code is B->C->D->C) S1 Key=6 S2S3S2 Key=1 Codeword 1->1->1 is an invalid codeword Fault will be detected with latency 1! A B C D A B C D U2 U1 Transition matrix S1 S2 Key=1 Erroneous transition PROBLEM: How do we assign keys?

9 Working through an example An FSM with 8 states has the following next state logic: Need to consider a restricted Error model. Consider the stuck-at fault model.

10 Graph of Faulty transitions If S1 S2 S3 then S2S3 GM BM Graph for the previous example: Next step: Identify coloring so that connected states have different colors

11 From colors to keywords: C A D A B C D A B C D U2 U1 Transition matrix Previous State Key output Previous Color Next Color Next State Input B For example: Is a transition from B to D and gives a key 2

12 Table of Keys for previous Example:

13 Observations on the H-K method: Flexibility in selecting the partition and the code Key=f(PS,IN) NS=g(PS,IN) Keys and Next State are both functions of PS and IN Key output Logic Error Detecting convolutional Decoder Fault IN PS IDEA: Share some of the next state logic when making the key Perhaps we could have one key bit equal a next state bit NS

14 Example with limited key logic: Clever selection of a coloring: C A D B A B C D A B C D Clever selection of code

15 Example with limited key logic: Notice that K1=NS1!

16 Mathematical Formulation: The problem of having a next state bit equal to a output key can be solved as a mixed linear integer program. It is not guaranteed that we can always find a solution. More details on the mathematical formulation are provided in the final report.

17 Limitation: Faults on output logic State Register (D Flip-Flops) Combinational Next State Logic Next State Input Previous State Key output Logic Error Detecting convolutional Decoder Fault OUT Faults on the output will not be detected!

18 Detecting output faults- Solution A IDEA: Share some of the output logic when making key Perhaps we could have one key bit equal the output bit (just like we did with the next state bit before!) Let’s try an example: An FSM with an output Is shown on the right: Then an incorrect Output will give us an Incorrect key and the Error may be detected! (and we will save h/w)

19 Detecting output faults- Solution A Graph of faulty transitions: C A D B A B C D A B C D Clever selection of code: Clever selection of a coloring:

20 Table of Keys: Notice that OUT=K0! Detects 58% of output errors.

21 Detecting output faults- Solution B Previous method had less than 100% efficiency IDEA: Treat the FSM’s output as a state bit. All output faults will be detected, since all state faults are detected Let’s work through the previous example: Consider the first three bits to designate the state and the fourth bit to designate the output For example, can be written as: State=011 Output=0

22 Detecting output faults- Solution B Fault set Fault coloring:

23 Table: 100% of faults will be detected!

24 Conclusion: Overview: 1)We have limited the hardware overhead for the key logic 2)Using the same methodology we can detect output faults 3)Alternatively, output faults can be detected by treating output bits like state bits Future work: Possible expansion for codes with latency greater than one (this could minimize further the number of key output bits)