New noise-based logic representations to avoid some problems with time complexity

Details New noise-based logic representations to avoid some problems with time complexity New noise-based logic representations to avoid some problems with time complexity

2011-11-11

arxiv.org/abs/1111.3859v3

Computer Science

Other Computer Science

submitted for publication

Scientific paper

Instantaneous noise-based logic can avoid time-averaging, which implies significant potential for low-power parallel operations in beyond-Moore-law-chips. However, the universe (uniform superposition) will be zero with high probability (non-zero with exponentially low probability) in the random-telegraph-wave representation thus the operations with the universe would require exponential time-complexity. To fix this deficiency, we modify the amplitudes of the signals of the L and H states and achieve an exponential speedup compared to the old situation. Another improvement concerns the identification of a single product (hyperspace) state. We introduce a time shifted noise-based logic, which is constructed by shifting each reference signal with a small time delay. This modification implies an exponential speedup of single hyperspace vector identification compared to the former case and it requires the same, O(N) complexity as in quantum computing.

Affiliated with

Also associated with

No associations

Rating

New noise-based logic representations to avoid some problems with time complexity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with New noise-based logic representations to avoid some problems with time complexity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and New noise-based logic representations to avoid some problems with time complexity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-140277