Probabilistic Value-Deviation-Bounded Integer Codes for Approximate Communication

When computing systems can tolerate the effects of errors or erasures in their communicated data values, they can trade this tolerance for improved resource efficiency. One method for enabling this tradeoff in the I/O subsystems of computing systems, is to use channel codes that reduce the power needed to send bits on a channel in exchange for bounded errors and erasures on numeric program values---value-deviation-bounded (VDB) codes. Unlike rate distortion codes, which guarantee a bound on the expected value of channel distortion, the probabilistic VDB codes we present guarantee any desired tail distribution on integer distances of words transmitted over a channel. We extend prior work to present tighter upper bounds on the efficiency for VDB codes. We present a new probabilistic VDB encoder that lowers power dissipation in exchange for bounded channel integer distortions. The code we present takes the peculiar approach of changing the channel bit error rate across the ordinal bit positions in a word to reduce power dissipation. We implement the code table generator in a software tool built on the dReal SMT solver and we validate the generated codes using Monte Carlo simulation. We present one realization of hardware to implement the technique, requiring 2 mm$^2$ of circuit board area and dissipating less than 0.5 $\mu$W.

[1]  Martin C. Rinard,et al.  Efficiency Limits for Value-Deviation-Bounded Approximate Communication , 2015, IEEE Embedded Systems Letters.

[2]  Edmund M. Clarke,et al.  dReal: An SMT Solver for Nonlinear Theories over the Reals , 2013, CADE.

[3]  P. Stanley-Marbell,et al.  Encoding efficiency of digital number representations under deviation constraints , 2009, 2009 IEEE Information Theory Workshop.

[4]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[5]  Gary M. Weiss,et al.  Activity recognition using cell phone accelerometers , 2011, SKDD.

[6]  Diana Marculescu,et al.  Deviation-tolerant computation in concurrent failure-prone hardware , 2008 .

[7]  Lara Dolecek,et al.  ACOCO: Adaptive Coding for Approximate Computing on Faulty Memories , 2015, IEEE Transactions on Communications.

[8]  Anand Raghunathan,et al.  AXSERBUS: A quality-configurable approximate serial bus for energy-efficient sensing , 2017, 2017 IEEE/ACM International Symposium on Low Power Electronics and Design (ISLPED).

[9]  Martin C. Rinard,et al.  Reducing serial I/O power in error-tolerant applications by efficient lossy encoding , 2016, 2016 53nd ACM/EDAC/IEEE Design Automation Conference (DAC).

[10]  Martin C. Rinard,et al.  Encoder logic for reducing serial I/O power in sensors and sensor hubs , 2016, 2016 IEEE Hot Chips 28 Symposium (HCS).

[11]  James E. Jaussi,et al.  The future of electrical I/O for microprocessors , 2009, 2009 International Symposium on VLSI Design, Automation and Test.

[12]  Aaron D. Wyner,et al.  Coding Theorems for a Discrete Source With a Fidelity CriterionInstitute of Radio Engineers, International Convention Record, vol. 7, 1959. , 1993 .

[13]  Christoforos E. Kozyrakis,et al.  Towards energy-proportional datacenter memory with mobile DRAM , 2012, 2012 39th Annual International Symposium on Computer Architecture (ISCA).

[14]  Andrew S. Cassidy,et al.  A million spiking-neuron integrated circuit with a scalable communication network and interface , 2014, Science.