اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOne-bit stochastic resonance storage device
276
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The increasing capacity of modern computers, driven by Moores Law, is accompanied by smaller noise margins and higher error rates. In this paper we propose a memory device, consisting of a ring of two identical overdamped bistable forward-coupled oscillators, which may serve as a building block in a larger scale solution to this problem. We show that such a system is capable of storing one bit and its performance improves with the addition of noise. The proposed device can be regarded as asynchronous, in the sense that stored information can be retrieved at any time and, after a certain synchronization time, the probability of erroneous retrieval does not depend on the interrogated oscillator. We characterize memory persistence time and show it to be maximized for the same noise range that both minimizes the probability of error and ensures synchronization. We also present experimental results for a hard-wired version of the proposed memory, consisting of a loop of two Schmitt triggers. We show that this device is capable of storing one bit and does so more efficiently in the presence of noise.
قيم البحث
اقرأ أيضاً
In this paper we extend our investigations on noise-assisted storage devices through the experimental study of a loop composed of a single Schmitt trigger and an element that introduces a finite delay. We show that such a system allows the storage of
several bits and does so more efficiently for an intermediate range of noise intensities. Finally, we study the probability of erroneous information retrieval as a function of elapsed time and show a way for predicting device performance independently of the number of stored bits.
We consider a two-layer multiplex network of diffusively coupled FitzHugh-Nagumo (FHN) neurons in the excitable regime. It is shown, in contrast to SISR in a single isolated FHN neuron, that the maximum noise amplitude at which SISR occurs in the net
work of coupled FHN neurons is controllable, especially in the regime of strong coupling forces and long time delays. In order to use SISR in the first layer of the multiplex network to control CR in the second layer, we first choose the control parameters of the second layer in isolation such that in one case CR is poor and in another case, non-existent. It is then shown that a pronounced SISR cannot only significantly improve a poor CR, but can also induce a pronounced CR, which was non-existent in the isolated second layer. In contrast to strong intra-layer coupling forces, strong inter-layer coupling forces are found to enhance CR. While long inter-layer time delays just as long intra-layer time delays, deteriorates CR. Most importantly, we find that in a strong inter-layer coupling regime, SISR in the first layer performs better than CR in enhancing CR in the second layer. But in a weak inter-layer coupling regime, CR in the first layer performs better than SISR in enhancing CR in the second layer. Our results could find novel applications in noisy neural network dynamics and engineering.
Stochastic gradient descent (SGD) is one of the most widely used optimization methods for parallel and distributed processing of large datasets. One of the key limitations of distributed SGD is the need to regularly communicate the gradients between
different computation nodes. To reduce this communication bottleneck, recent work has considered a one-bit variant of SGD, where only the sign of each gradient element is used in optimization. In this paper, we extend this idea by proposing a stochastic variant of the proximal-gradient method that also uses one-bit per update element. We prove the theoretical convergence of the method for non-convex optimization under a set of explicit assumptions. Our results indicate that the compressed method can match the convergence rate of the uncompressed one, making the proposed method potentially appealing for distributed processing of large datasets.
We study thermal instability in NbN superconducting stripline resonators. The system exhibits extreme nonlinearity near a bifurcation, which separates a monostable zone and an astable one. The lifetime of the metastable state, which is locally stable
in the monostable zone, is measure near the bifurcation and the results are compared with a theory. Near bifurcation, where the lifetime becomes relatively short, the system exhibits strong amplification of a weak input modulation signal. We find that the frequency bandwidth of this amplification mechanism is limited by the rate of thermal relaxation. When the frequency of the input modulation signal becomes comparable or larger than this rate the response of the system exhibits sub-harmonics of various orders.
Is it possible to obliviously construct a set of hyperplanes H such that you can approximate a unit vector x when you are given the side on which the vector lies with respect to every h in H? In the sparse recovery literature, where x is approximatel
y k-sparse, this problem is called one-bit compressed sensing and has received a fair amount of attention the last decade. In this paper we obtain the first scheme that achieves almost optimal measurements and sublinear decoding time for one-bit compressed sensing in the non-uniform case. For a large range of parameters, we improve the state of the art in both the number of measurements and the decoding time.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
