Analog Error-Correcting Codes

被引:9
|
作者
Roth, Ron M. [1 ]
机构
[1] Technion Israel Inst Technol, Dept Comp Sci, IL-3200003 Haifa, Israel
关键词
Decoding; Redundancy; Computational modeling; Quantization (signal); Linear codes; Conductors; Analog arithmetic circuits; approximate computation; fault-tolerant computing; linear codes over the real field; vector-matrix multiplication; RECOVERY; REPRESENTATIONS;
D O I
10.1109/TIT.2020.2977918
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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 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 C. While error values within +/- delta in the entries of the result are tolerable (for some prescribed delta > 0), outlying errors, with values outside the range +/-Delta (for a prescribed Delta >= delta) should be located and corrected. As a design and analysis tool for such a setting, a certain functional is defined for the code 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.
引用
收藏
页码:4075 / 4088
页数:14
相关论文
共 50 条
  • [21] Error-correcting codes and cryptography
    Hideki Imai
    Manabu Hagiwara
    Applicable Algebra in Engineering, Communication and Computing, 2008, 19 : 213 - 228
  • [22] Error-Correcting Codes for Multipermutations
    Buzaglo, Sarit
    Yaakobi, Eitan
    Etzion, Tuvi
    Bruck, Jehoshua
    2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2013, : 724 - +
  • [23] ERROR-CORRECTING AND DETECTING CODES
    TARBELL, DW
    IEEE SPECTRUM, 1965, 2 (05) : 162 - &
  • [24] BINOID ERROR-CORRECTING CODES
    SAMOYLENKO, SI
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1973, 19 (01) : 95 - 101
  • [25] SHORT ERROR-CORRECTING CODES
    BELL, DA
    ELECTRONICS LETTERS, 1969, 5 (16) : 367 - &
  • [26] THE TECHNOLOGY OF ERROR-CORRECTING CODES
    BERLEKAMP, ER
    PROCEEDINGS OF THE IEEE, 1980, 68 (05) : 564 - 593
  • [27] On the trustworthiness of error-correcting codes
    Faldum, Andreas
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (12) : 4777 - 4784
  • [28] The Beauty of Error-Correcting Codes
    Spielman, Daniel A.
    COMMUNICATIONS OF THE ACM, 2009, 52 (03) : 86 - 86
  • [29] Error-correcting codes and cryptography
    Imai, Hideki
    Hagiwara, Manabu
    APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2008, 19 (03) : 213 - 228
  • [30] Pseudorandom Error-Correcting Codes
    Christ, Miranda
    Gunn, Sam
    ADVANCES IN CRYPTOLOGY - CRYPTO 2024, PT VI, 2024, 14925 : 325 - 347