.png){kind=icon}
Return
Bit Truncation Optimal Value Setting Considering Bit Failures
.png){kind=icon}
PRE
AI
DOI：10.1142/s021812662650218x.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Bit truncation is one of the widely applied techniques to enable quality-adaptive computing systems. In this paper, we take bit failures into consideration and give a probabilistic analysis of bit truncation. Given the index set of truncated bits, we propose a data-driven approach to obtain the dummy value setting for the truncated bits such that the expected mean-squared error of data stream is minimized. Specifically, if the original binary data are evenly distributed, the approach can be greatly simplified. Our method works for any given truncation index set, instead of merely the traditional index set in which only continuous least-significant bits are truncated. Numerical experiments on multimedia applications show that the proposed algorithm can greatly reduce the data noise and meanwhile save storage space, compared with the traditional all-zeros value setting method and the intuitive heuristic method.
Keywords:
Bit truncation
data failure
optimization
expected mean-squared error
Journal
IF:
1
Papers:
387
Citations:
2.3K
Organization
Cited Papers
No cited papers available