pith. sign in

arxiv: 1204.2545 · v4 · pith:XDO5DE4Qnew · submitted 2012-04-11 · 💻 cs.OH · cs.ET

Noise based logic: why noise? A comparative study of the necessity of randomness out of orthogonality

classification 💻 cs.OH cs.ET
keywords logiccomplexitynoisecomputationalexponentiallynoise-basedorthogonalityrandomness
0
0 comments X
read the original abstract

Although noise-based logic shows potential advantages of reduced power dissipation and the ability of large parallel operations with low hardware and time complexity the question still persist: is randomness really needed out of orthogonality? In this Letter, after some general thermodynamical considerations, we show relevant examples where we compare the computational complexity of logic systems based on orthogonal noise and sinusoidal signals, respectively. The conclusion is that in certain special-purpose applications noise-based logic is exponentially better than its sinusoidal version: its computational complexity can be exponentially smaller to perform the same task.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.