避免某些时间复杂度问题的新的基于噪声的逻辑表示
New noise-based logic representations to avoid some problems with time complexity
摘要：
基于瞬时噪声的逻辑可以避免时间平均，这意味着在超越摩尔定律的芯片中低功耗并行操作的巨大潜力。然而，在随机电报波表示中，全域（均匀叠加）将以高概率为零（非零以指数低概率），因此对全域的操作将需要指数时间复杂度。为了解决这个问题，我们修改了L和H状态的信号幅度，并实现了与旧情况相比的指数加速。另一个改进涉及单个产品（超空间）状态的识别。我们介绍了一个时移噪声为基础的逻辑，这是通过移动每个参考信号与一个小的时间延迟。与前一种情况相比，这种修改意味着单个超空间向量识别的指数加速，并且它需要与量子计算相同的O（N）复杂度。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
