Analog Error-Correcting Codes

Abstract

Coding schemes are presented that provide the ability to locate computational errors above a prescribed threshold while using analog resistive devices for approximate real vector–matrix multiplication. In such devices, the matrix is programmed into the device by setting an array of resistors to have conductances proportional to the respective entries in the matrix. In the coding scheme that is considered in this work, redundancy columns are appended so that each row in the programmed matrix forms a codeword of a prescribed linear code ${\mathcal {C}}$ over the real field; the result of the multiplication of any input real row vector by the matrix is then also a codeword of ${\mathcal {C}}$ . While error values within $\pm \delta $ in the entries of the result are tolerable (for some prescribed $\delta > 0$ ), outlying errors, with values outside the range $\pm \Delta $ (for a prescribed $\Delta \ge \delta $ ) should be located and corrected. As a design and analysis tool for such a setting, a certain functional is defined for the code ${\mathcal {C}}$ , through which a characterization is obtained for the number of outlying errors that can be handled, as a function of the ratio $\Delta /\delta $ . Several code constructions are then presented, primarily for the case of single outlying error handling. For this case, the coding problem is shown to be related to certain extremal problems on convex polygons.