On the complexity of encoding in analog circuits

被引：1
|
作者：
Wegener, I
机构：
[1] FB Informatik, LS II, Universität Dortmund
来源：
INFORMATION PROCESSING LETTERS | 1996年 / 60卷 / 01期
关键词：
computational complexity; analog circuits; Boolean functions;
D O I：
10.1016/S0020-0190(96)00137-8
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Fan-in 2 analog circuits over the basis {+, -, *, /} are investigated. The problem of encoding a Boolean vector is the problem of computing a one-to-one mapping f : {0, 1}(n) --> R. It is proved that the optimal encoding formula has size [(3n - 1)/2] and that encoding circuits have at least 5n/4 - 0(1) gates.
引用
收藏
页码：49 / 52
页数：4
相关论文
共 50 条
  • [41] Analog Circuits Test by Using Principal Component Analysis
    Zhang, Chaojie
    Chang, Guanghui
    ADVANCES IN MECHATRONICS AND CONTROL ENGINEERING, PTS 1-3, 2013, 278-280 : 709 - 713
  • [42] New Aspects of Fault Diagnosis of Nonlinear Analog Circuits
    Tadeusiewicz, Michal
    Halgas, Stanislaw
    Kuczynski, Andrzej
    INTERNATIONAL JOURNAL OF ELECTRONICS AND TELECOMMUNICATIONS, 2015, 61 (01) : 83 - 93
  • [43] DESIGN AND OPERATION OF POLY-SI ANALOG CIRCUITS
    REITA, C
    FLUXMAN, S
    IEE PROCEEDINGS-CIRCUITS DEVICES AND SYSTEMS, 1994, 141 (01): : 60 - 64
  • [44] Fault Diagnosis of Analog Circuits Based on Evidence Theory
    Cheng Cheng
    MECHATRONICS ENGINEERING, COMPUTING AND INFORMATION TECHNOLOGY, 2014, 556-562 : 2149 - 2152
  • [45] Blind Source Separation of Interfering Signals in Analog Circuits
    Li Hao
    Chen Zhiyong
    Zhang Ruixue
    Dong Yonggui
    PROCEEDINGS OF 2013 2ND INTERNATIONAL CONFERENCE ON MEASUREMENT, INFORMATION AND CONTROL (ICMIC 2013), VOLS 1 & 2, 2013, : 462 - 466
  • [46] Approximate Symbolic Analysis of Hierarchically Decomposed Analog Circuits
    O. Guerra
    E. Roca
    F. V. Fernández
    A. Rodríguez-Vázquez
    Analog Integrated Circuits and Signal Processing, 2002, 31 : 131 - 145
  • [47] Sorting Rates in Video Encoding Process for Complexity Reduction
    Moecke, Marcos
    Seara, Rui
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, 2010, 20 (01) : 88 - 101
  • [48] The complexity of membership problems for circuits over sets of integers
    Travers, Stephen
    THEORETICAL COMPUTER SCIENCE, 2006, 369 (1-3) : 211 - 229
  • [49] DNA origami and the complexity of Eulerian circuits with turning costs
    Ellis-Monaghan, Joanna A.
    McDowell, Andrew
    Moffatt, Iain
    Pangborn, Greta
    NATURAL COMPUTING, 2015, 14 (03) : 491 - 503
  • [50] A note on the complexity of k-ary threshold circuits
    Sung, SC
    Hiraishi, K
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 1997, E80D (08) : 767 - 773
12345