Title: An Analytical Approach for Dynamic Range Estimation
1An Analytical Approach for Dynamic Range
Estimation
- Bin Wu, Jianwen Zhu, Farid N. Najm
- Dept. of Electrical and Computer Engineering
- University of Toronto
2Motivation
- Data-path bit-width
- An important design decision
- Significant impact on area, speed, and power
- Bit-width determined by signal dynamic range
- Min/Max bound
- Detailed distribution
-
Probability
Value
Min
Max
3State of the Art
- Profiling (simulation) is the extensively used
method. Cao01, Kum01 - Some analytical methods proposed, such as
- Lp norm Jackson70, Carletta03
- Moment propagation Ortiz03
- Bitwidth / interval propagation Mahlke01
- Affine arithmetic method Fang03
4Problems of Previous Approaches
5Problems of Previous Approaches
6A New Problem Formulation
- Input data stream modeled as discrete timerandom
process. - C programs systems
- All program variables random processes(
response to random input) - Dynamic range estimation problemsolve the
random response and obtain its statistics.
7Outline
- Introduction
- Extraction of Random Process Model
- Random Response of Linear System
- Statistics of System Variables
- Experiment Conclusions
-
8Extraction of Random Process Model
- Use Karhunen-Loeve Expansion (KLE) to extract
input random process model from sample data. - Capture temporal correlation
- Dimension reduction
- Computation involved
- Compute autocorrelation matrix fromsample data
- Solve eigensystem problem
9Karhunen-Loeve Expansion
- Discrete-time Karhunen-Loeve Expansion
zero-mean discrete time random process.
eigenvalue and eigenfunction of
autocorrelation function of pk
a set of orthogonal random variables with zero
mean unity variance.
10Karhunen-Loeve Expansion
obtained from sample data
11Random Response of Linear System
- Observation two parts in KLE
- Deterministic part deterministic
functions in time domain - Random part has no dependence in time
domain - Superposition property of Linear system
- Solution Transform a random response problem
into m deterministic response problems
12Random Response of Linear System
13Statistics of System Variables
- System variable X has KLE
- Its second order moments
- Arbitrary N order moments of Xk can be obtained
from its KLE.
14Statistics of System Variables
- Probability Density Function (PDF) of Random
Variable X can be constructed from its moments. - For Gaussian distribution, 2-order moment can
determine the whole pdf. - For more general distribution, the pdf can be
recovered by approximation methods - such as Edgeworth expansion and generalized
lambda distribution
15Workflow
16Experiments
- Experiment Setup
- Experiments conducted on a set of benchmarks(
including FIRs, IIRs, FFT) - Input sample data from Auto-Regression Moving
Average (ARMA) model - Goal
- Computation time, accuracy of KLE methods
- Trade-off between SNR and bitwidth
- Impact of input temporal correlation on the
dynamic range estimation
17KLE Extraction
- Sample set size 10,000 traces of 100-time-point
- From most noisy sample to highly correlated
- Noisy sample set needs more terms kept
18KLE versus Profiling
- Accuracy (variance comparison, for rp1)
19KLE versus Profiling
- Accuracy (variance comparison, for rp4)
20KLE versus Profiling
21KLE versus Profiling
22Bitwidth and SNR Tradeoff
- Signal-to-noise ratio can be computed from
variable distribution for every specific range
(for benchmark FFT128)
23Impact of Temporal Correlation
- Probability density function from KLE and other
oversimplified models
24Impact of Temporal Correlation
- Variance from KLE and other oversimplified models
25Conclusions
- Speed of KLE method
- Much faster than profiling
- As fast as other analytical approaches
- KLE method is accurate.
- No oversimplified assumption made, input model
directly from sample data - Fully considers both temporal and spatial
correlation - KLE provides complete info of dynamic range
- All statistics and pdf available
- Enables the tradeoff between SNR and reliability
- Future work
- Extend this analytic method to nonlinear systems