02.02.20 Sybille Hellebrand Computer Engineering Group University of Paderborn, Germany Are Robust Circuits Really Robust? 2 Erlangen – January 31, 2011 Outline Motivation “Robustness Checking” Self-Checking Circuits – Theory and Practice Technical Challenges and Solutions Yield and Quality “Fault Tolerant Yield” “Quality Binning” Conclusions
23
Embed
Are Robust Circuits Really Robust? fileErlangen – January 31, 2011 9 Example: Random Dopant Fluctuations Threshold voltage V th Determined by the concentration of dopant atoms in
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
02.02.20
Sybille Hellebrand
Computer Engineering Group
University of Paderborn, Germany
Are Robust Circuits Really
Robust?
2 Erlangen – January 31, 2011
Outline
Motivation
“Robustness Checking”
Self-Checking Circuits – Theory and Practice
Technical Challenges and Solutions
Yield and Quality
“Fault Tolerant Yield”
“Quality Binning”
Conclusions
02.02.20
3 Erlangen – January 31, 2011
Electronic is everywhere more than 80 Processors to
control various functions (ABS, ..., Infotainment, ...)
4 Erlangen – January 31, 2011
Major Problem so far
„Spot defects“, „random defects“ during
manufacturing
[http://www.icyield.com]
Short
02.02.20
5 Erlangen – January 31, 2011
Nanoscale Integration
Potential for integrating highly complex innovative
products into single chip (SoC) or package (SiP)
Problems
Soft errors
Parameter variations
cf. Borkar, IEEE Micro 2005
6 Erlangen – January 31, 2011
Soft Errors
Caused by
Alpha particles, cosmic radiation
Measures
SER (Soft Error Rate) given in
FIT (Failure in Time)
1 FIT = 1 failure in 109 hours ( 114,155 years)
Example
SER for Processor with embedded SRAM is 50,000 FIT
(1 soft error every 2 years)
But: Multiprocessor system with 100 chips has 1 failure per week
02.02.20
7 Erlangen – January 31, 2011
SRAM bit SER with
error-correcting code
Technology (nm)
1000 100
10
1
10-1
10-2
10-3
10-4
10-5
Norm
aliz
ed s
oft e
rror
rate
SRAM bit SER
Logic SER (data)
Logic SER (simulation)
[Baumann, IEEE Design&Test 2005]
SER for Latches/Flipflops in Random Logic
8 Erlangen – January 31, 2011
Parameter Variations
Static variations
Systematic
Random
Dynamic variations
Variations over time (aging)
02.02.20
9 Erlangen – January 31, 2011
Example: Random Dopant Fluctuations
Threshold voltage Vth
Determined by the
concentration of dopant
atoms in the channel
Only a few dopant atoms
in nano scale transitors
Law of large numbers is
no longer valid,
quantum effects must be
considered [Borkar, IEEE Micro 2005]
10 Erlangen – January 31, 2011
Dynamic Parameter Variations
„Power density“ in a
Processor chip
Problems
Hot spots
Varying supply voltage
...
y
W/cm2
x
[Borkar, IEEE Micro 2005]
250
200
150
100
50
0
02.02.20
11 Erlangen – January 31, 2011
Consequences
a
b
g
c
d
e
f
Most parameter variations result in timing variations
1ns
1ns
2ns
2ns
2ns
Traditional view:
nominal or worst
case delay
Now: probability
density functions
(PDF) for delay
12 Erlangen – January 31, 2011
Variation-Aware and Robust Design
Statistical timing analysis
More and more commercial
EDA support
Redundancy
Hardware
Time
Information
Algorithmic
Self-calibrating architectures
a
b
g
c
d
e
f
02.02.20
13 Erlangen – January 31, 2011
Example
[D. Ernst et al., IEEE Micro, 2004]
Razor
14 Erlangen – January 31, 2011
Razor – Error Rates
[D. Ernst et al., IEEE Micro, 2004]
02.02.20
15 Erlangen – January 31, 2011
Robust Systems
Classical fault tolerant architectures
(Self-checking circuits, TMR, …)
New self-calibrating, self-adaptive solutions
System
Robust
implementation compensates
static and/or dynamic
parameter
variations and/or soft errors
You‘re kidding guys ???????
02.02.20
17 Erlangen – January 31, 2011
Challenges
Design validation/verification must take into account
fault tolerance and robustness properties
(‚robustness checking“)
How much robustness is left after manufacturing?
Fault tolerant yield
Quality binning
18 Erlangen – January 31, 2011
Outline
Motivation
„Robustness Checking“
Self-Checking Circuits – Theory and Practice
Technical Challenges and Solutions
Yield and Quality
“Fault Tolerant Yield”
“Quality Binning”
Conclusions
02.02.20
19 Erlangen – January 31, 2011
Self-Checking Circuits
CUT Checker Error
Indication
Encoded
Outputs Encoded
Inputs
20 Erlangen – January 31, 2011
Self-Checking Circuits
An error is detected, if and only if it produces an erroneous
output outside the output code (non code word)
Input Code
Output
Code
f(x) x
02.02.20
21 Erlangen – January 31, 2011
Properties
Totally self-checking (TSC) goal
Faults must be detected when they produce the first
erroneous output
Fault secure (FS)
Faults are detected or do not propagate to outputs
Self-Testing (ST)
Every fault can be detected with at least one input