New XOR & XNOR Operations in Instantaneous Noise-Based Logic

TL;DR

This paper introduces novel XOR and XNOR operations in Instantaneous Noise-Based Logic (INBL), enabling more flexible, faster, and hardware-efficient logic computations by avoiding direct reference noise manipulation, validated through simulations.

Contribution

It presents new INBL implementations of XOR and XNOR gates that operate directly on hyperspace vectors, improving flexibility and efficiency over previous methods.

Findings

Successful simulation of INBL XOR and XNOR gates

Enhanced computational speed and hardware efficiency

Avoidance of direct reference noise manipulation

Abstract

Instantaneous Noise-Based Logic (INBL) presents a classical noise-based computing framework as an alternative to quantum computation, though some logic gates remain unimplemented for achieving universality over superpositions. INBL encodes M noise-bits using 2M orthogonal stochastic reference noises to construct a 2^M-dimensional product-based Hilbert space (hyperspace). Vectors in this hyperspace correspond to products of reference noises representing bit values in M-bit binary strings. This work introduces INBL implementations of XOR and XNOR operations targeting specific bits, facilitating pairwise operations directly between strings of equal length or hyperspace vectors, which are the longest strings. These operations naturally extend to superpositions, potentially delivering significant improvements in computational speed and hardware complexity. Diverging from previous methods by Khreishah et al., our approach avoids direct manipulation of the reference noise system, enabling more flexible and general-purpose implementations. We validate INBL operations-including NOT, XOR, and XNOR-through simulation using random telegraph waves, demonstrating practical feasibility without explicit reference noise manipulation.