Jump to content

Noise-based logic

From Wikipedia, the free encyclopedia

Noise-based logic (NBL)[1][2][3][4][5][6][7][8] is a class of multivalued deterministic logic schemes, developed in the twenty-first century, where the logic values and bits are represented by different realizations of a stochastic process. The concept of noise-based logic and its name was created by Laszlo B. Kish. In its foundation paper[3] it is noted that the idea was inspired by the stochasticity of brain signals and by the unconventional noise-based communication schemes, such as the Kish cypher.

The noise-based logic space and hyperspace

[edit]

The logic values are represented by multi-dimensional "vectors" (orthogonal functions) and their superposition, where the orthogonal basis vectors are independent noises. By the proper combination (products or set-theoretical products) of basis-noises, which are called noise-bit, a logic hyperspace can be constructed with D(N) = 2N number of dimensions, where N is the number of noise-bits. Thus N noise-bits in a single wire correspond to a system of 2N classical bits that can express 22N different logic values. Independent realizations of a stochastic process of zero mean have zero cross-correlation with each other and with other stochastic processes of zero mean. Thus the basis noise vectors are orthogonal not only to each other but they and all the noise-based logic states (superpositions) are orthogonal also to any background noises in the hardware. Therefore, the noise-based logic concept is robust against background noises, which is a property that can potentially offer a high energy-efficiency.

The types of signals used in noise-based logic

[edit]

In the paper,[3] where noise-based logic was first introduced, generic stochastic-processes with zero mean were proposed and a system of orthogonal sinusoidal signals were also proposed as a deterministic-signal version of the logic system. The mathematical analysis about statistical errors and signal energy was limited to the cases of Gaussian noises and superpositions as logic signals in the basic logic space and their products and superpositions of their products in the logic hyperspace (see also.[4] In the subsequent brain logic scheme,[5] the logic signals were (similarly to neural signals) unipolar spike sequences generated by a Poisson process, and set-theoretical unifications (superpositions) and intersections (products) of different spike sequences. Later, in the instantaneous noise-based logic schemes[6][7] and computation works,[8] random telegraph waves (periodic time, bipolar, with fixed absolute value of amplitude) were also utilized as one of the simplest stochastic processes available for NBL. With choosing unit amplitude and symmetric probabilities, the resulting random-telegraph wave has 0.5 probability to be in the +1 or in the -1 state which is held over the whole clock period.

The noise-based logic gates

[edit]

Noise-based logic gates can be classified according to the method the input identifies the logic value at the input. The first gates[3][4] analyzed the statistical correlations between the input signal and the reference noises. The advantage of these is the robustness against background noise. The disadvantage is the slow speed and higher hardware complexity. The instantaneous logic gates[5][6][7] are fast, they have low complexity but they are not robust against background noises. With either neural spike type signals or with bipolar random-telegraph waves of unity absolute amplitude, and randomness only in the sign of the amplitude offer very simple instantaneous logic gates. Then linear or analog devices unnecessary and the scheme can operate in the digital domain. However, whenever instantaneous logic must be interfaced with classical logic schemes, the interface must use correlator-based logic gates for an error-free signal.[6]

Universality of noise-based logic

[edit]

All the noise-based logic schemes listed above have been proven universal.[3][6][7] The papers typically produce the NOT and the AND gates to prove universality, because having both of them is a satisfactory condition for the universality of a Boolean logic.

Computation by noise-based logic

[edit]

The string verification work[8] over a slow communication channel shows a powerful computing application where the methods is inherently based on calculating the hash function. The scheme is based on random telegraph waves and it is mentioned in the paper[8] that the authors intuitively conclude that the intelligence of the brain is using similar operations to make a reasonably good decision based on a limited amount of information. The superposition of the first D(N) = 2N integer numbers can be produced with only 2N operations, which the authors call "Achilles ankle operation" in the paper.[4]

Computer chip realization of noise-based logic

[edit]

Preliminary schemes have already been published[8] to utilize noise-based logic in practical computers. However, it is obvious from these papers that this young field has yet a long way to go before it will be seen in everyday applications.

References

[edit]
  1. ^ David Boothroyd (22 February 2011). "Cover Story: What's this noise all about?". New Electronics. Archived from the original on 27 April 2011. Retrieved 10 May 2011.
  2. ^ Justin Mullins (7 October 2010). "Breaking the Noise Barrier: Enter the phonon computer". New Scientist. Archived from the original on 2016-04-13.
  3. ^ Jump up to: a b c d e Laszlo B. Kish (2009). "Noise-based logic: Binary, multi-valued, or fuzzy, with optional superposition of logic states". Physics Letters A. 373 (10): 911–918. arXiv:0808.3162. Bibcode:2009PhLA..373..911K. doi:10.1016/j.physleta.2008.12.068. S2CID 17537255.
  4. ^ Jump up to: a b c d Laszlo B. Kish; Sunil Khatri; Swaminathan Sethuraman (2009). "Noise-based logic hyperspace with the superposition of 2^N states in a single wire". Physics Letters A. 373 (22): 1928–1934. arXiv:0901.3947. Bibcode:2009PhLA..373.1928K. doi:10.1016/j.physleta.2009.03.059. S2CID 15254977.
  5. ^ Jump up to: a b c Sergey M. Bezrukov; Laszlo B. Kish (2009). "Deterministic multivalued logic scheme for information processing and routing in the brain". Physics Letters A. 373 (27–28): 2338–2342. arXiv:0902.2033. Bibcode:2009PhLA..373.2338B. doi:10.1016/j.physleta.2009.04.073. S2CID 119241496.
  6. ^ Jump up to: a b c d e Laszlo B. Kish; Sunil Khatri; Ferdinand Peper (2010). "Instantaneous noise-based logic". Fluctuation and Noise Letters. 09 (4): 323–330. arXiv:1004.2652. doi:10.1142/S0219477510000253. S2CID 17034438.
  7. ^ Jump up to: a b c d Peper, Ferdinand; Kish, Laszlo B. (2011). "Instantaneous, Non-Squeezed, Noise-Based Logic" (PDF). Fluctuation and Noise Letters. 10 (2): 231–237. arXiv:1012.3531. doi:10.1142/S0219477511000521. S2CID 1610981.
  8. ^ Jump up to: a b c d e Laszlo B. Kish; Sunil Khatri; Tamas Horvath (2011). "Computation using Noise-based Logic: Efficient String Verification over a Slow Communication Channel". The European Physical Journal B. 79 (1): 85–90. arXiv:1005.1560. Bibcode:2011EPJB...79...85K. doi:10.1140/epjb/e2010-10399-x. S2CID 15608951.
[edit]