Lookup Table Optimization for Sensor Linearization in Small Embedded Systems
Author(s) -
Lars Bengtsson
Publication year - 2012
Publication title -
journal of sensor technology
Language(s) - English
Resource type - Journals
eISSN - 2161-1238
pISSN - 2161-122X
DOI - 10.4236/jst.2012.24025
Subject(s) - lookup table , table (database) , interpolation (computer graphics) , linearization , computer science , algorithm , artificial intelligence , nonlinear system , data mining , physics , quantum mechanics , programming language , motion (physics)
This paper treats the problem of designing an optimal size for a lookup table used for sensor linearization. In small embedded systems the lookup table must be reduced to a minimum in order to reduce the memory footprint and intermediate table values are estimated by linear interpolation. Since interpolation introduces an estimation uncertainty that increases with the sparseness of the lookup table there is a trade-off between lookup table size and estimation precision. This work will present a theory for finding the minimum allowed size of a lookup table that does not affect the overall precision, i.e. the overall precision is determined by the lookup table entries’ precision, not by the interpolation error
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom