Probabilistic Value-Deviation-Bounded Integer Codes for Approximate Communication

04/06/2018
by   Phillip Stanley-Marbell, et al.
0

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 μW.

READ FULL TEXT
research
09/16/2020

Probabilistic Value-Deviation-Bounded Source-Dependent Bit-Level Channel Adaptation for Approximate Communication

Computing systems that can tolerate effects of errors in their communica...
research
11/19/2022

Upper and Lower Bounds on Bit-Error Rate for Convolutional Codes

In this paper, we provide a new approach to the analytical estimation of...
research
11/11/2019

Optimizing short stabilizer codes for asymmetric channels

For a number of quantum channels of interest, phase-flip errors occur fa...
research
01/12/2023

Estimating the Sizes of Binary Error-Correcting Constrained Codes

In this paper, we study binary constrained codes that are resilient to b...
research
09/22/2018

Further Results on Circuit Codes

We present a new characterization of circuit codes of spread k based on ...
research
01/21/2018

Channel Input Adaptation via Natural Type Selection

For the model of communication through a discrete memoryless channel usi...

Please sign up or login with your details

Forgot password? Click here to reset