Using Kolmogorov Inspired Gates for Low Power Nanoelectronics

Based on explicit numerical constructions for Kolmogorov's superpositions (KS) linear size circuits are possible. Because classical Boolean as well as threshold logic implementations require exponential size in the worst case, it follows that size-optimal solutions for arbitrary Boolean functions (BFs) should rely (at least partly) on KS. In this paper, we will present previous theoretical results while examining the particular case of 3-input BFs in detail. This shows that there is still room for improvement on the synthesis of BFs. Such size reductions (which can be achieved systematically) could help alleviate the challenging power consumption problem, and advocate for the design of Kolmogorov-inspired gates, as well as for the development of the theory, the algorithms, and the CAD tools that would allow taking advantage of such optimal combinations of different logic styles.

[1]  Valeriu Beiu,et al.  Constructive Threshold Logic Addition A Synopsis of the Last Decade , 2003, ICANN.

[2]  Khaled Ben Letaief,et al.  An efficient resource-allocation scheme for spatial multiuser access in MIMO/OFDM systems , 2005, IEEE Transactions on Communications.

[3]  Valeriu Beiu,et al.  VLSI implementations of threshold logic-a comprehensive survey , 2003, IEEE Trans. Neural Networks.

[4]  José M. Quintana,et al.  A threshold logic synthesis tool for RTD circuits , 2004 .

[5]  V. Brattka.  A Computable Kolmogorov Superposition Theorem Vasco Brattka , 2022 .

[6]  V. Tikhomirov.  On the Representation of Continuous Functions of Several Variables as Superpositions of Continuous Functions of one Variable and Addition , 1991 .

[7]  Ian Flood,et al.  Neural networks in civil engineering. II: Systems and application , 1994 .

[8]  Vra Krkov.  Kolmogorov's Theorem Is Relevant , 1991, Neural Computation.

[9]  David C. Sterratt,et al.  Does Morphology Influence Temporal Plasticity? , 2002, ICANN.

[10]  Saburo Muroga,et al.  Threshold logic and its applications , 1971 .

[11]  V. Beiu,et al.  Optimal neural computations require analog processors , 1998 .

[12]  Hidefumi Katsuura,et al.  Computational aspects of Kolmogorov's superposition theorem , 1994, Neural Networks.

[13]  William H. Kautz,et al.  On the Size of Weights Required for Linear-Input Switching Functions , 1961, IRE Transactions on Electronic Computers.

[14]  Rahul Sarpeshkar,et al.  Analog Versus Digital: Extrapolating from Electronics to Neurobiology , 1998, Neural Computation.

[15]  Valeriu Beiu,et al.  On Kolmogorov's superpositions and Boolean functions , 1998, Proceedings 5th Brazilian Symposium on Neural Networks (Cat. No.98EX209).

[16]  Rahul Sarpeshkar,et al.  Scalable Hybrid Computation with Spikes , 2002, Neural Computation.

[17]  Valeriu Beiu,et al.  Optimization of circuits using a constructive learning algorithm , 1997 .

[18]  Kenneth C. Smith,et al.  A multiple valued logic: a tutorial and appreciation , 1988, Computer.

[19]  Tomaso A. Poggio,et al.  Representation Properties of Networks: Kolmogorov's Theorem Is Irrelevant , 1989, Neural Computation.

[20]  D. Sprecher.  On the structure of continuous functions of several variables , 1965 .

[21]  M. Nees.  Approximative versions of Kolmogorov's superposition theorem, proved constructively , 1994 .

[22]  Mario Köppen,et al.  On the Training of a Kolmogorov Network , 2002, ICANN.

[23]  Peter Hertling,et al.  Computability & Complexity in Analysis , 2001 .

[24]  David A. Sprecher,et al.  A Numerical Implementation of Kolmogorov's Superpositions , 1996, Neural Networks.

[25]  Niraj K. Jha,et al.  Threshold network synthesis and optimization and its application to nanotechnologies , 2005 .

[26]  David A. Sprecher,et al.  A Numerical Implementation of Kolmogorov's Superpositions II , 1996, Neural Networks.

[27]  Thanh A. Diep.  Capacity of Multilevel Threshold Devices , 1998, IEEE Trans. Inf. Theory.

[28]  U. Ruckert,et al.  On nanoelectronic architectural challenges and solutions , 2004, 4th IEEE Conference on Nanotechnology, 2004..

[29]  David A. Sprecher,et al.  A universal mapping for kolmogorov's superposition theorem , 1993, Neural Networks.

[30]  Donald R. Haring,et al.  Multi-threshold threshold elements , 1966, IEEE Trans. Electron. Comput..

[31]  Johan Håstad,et al.  On the Size of Weights for Threshold Gates , 1994, SIAM J. Discret. Math..

[32]  Erkki Oja,et al.  Artificial Neural Networks and Neural Information Processing — ICANN/ICONIP 2003 , 2003, Lecture Notes in Computer Science.

[33]  Valeriu Beiu.  A novel highly reliable low-power nano architecture when von Neumann augments Kolmogorov , 2004 .

[34]  Vladik Kreinovich,et al.  Guaranteed Intervals for Kolmogorov’s Theorem (and Their Possible Relation to Neural Networks) , 2004 .

[35]  Stanley L. Hurst,et al.  Multiple-Valued Logic—its Status and its Future , 1984, IEEE Transactions on Computers.

[36]  Valeriu Beiu,et al.  Deeper Sparsely Nets can be Optimal , 1998, Neural Processing Letters.

[37]  Vera Kurková,et al.  Kolmogorov's theorem and multilayer neural networks , 1992, Neural Networks.

[38]  Rolf Unbehauen,et al.  On the Realization of a Kolmogorov Network , 1993, Neural Computation.

[39]  Jens Blanck,et al.  Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis , 2000 .

[40]  D. Sprecher.  On the structure of representations of continuous functions of several variables as finite sums of continuous functions of one variable , 1966 .

[41]  R. D. Figueiredo.  Implications and applications of Kolmogorov's superposition theorem , 1980 .