<i>Foundations of Information Theory</i>

Feinstein, Amiel; Weiss, George H.

doi:10.1063/1.3062338

Cited by 180 publications

(90 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Stocks has used information theory to show how stochastic resonance can occur in such a system, for signals of arbitrary magnitude. If the array is considered as a semicontinuous channel [28], then the transmitted information through such a channel is given by…”

Section: Ssr -A New Type Of Sr Occurring In Arrays Of Neuronsmentioning

confidence: 99%

Open Questions For Suprathreshold Stochastic Resonance In Sensory Neural Models for Motion Detection Using Artificial Insect Vision

McDonnell¹,

Abbott²

2003

AIP Conference Proceedings

View full text Add to dashboard Cite

Abstract. Stochastic Resonance (SR) occurs when the presence of noise in a nonlinear system can induce an optimal output from that system, and has been observed in a diverse range of physical and biological systems, including neurons. Despite this widespread observation of SR, to date very few engineering applications inspired by SR have been proposed, and one of the goals of our research is to explore possible new practical applications designed to replicate the benefits of SR. In particular, since about 1991, our group has designed and implemented a number of motion detection VLSI chips based on insect vision. We are currently investigating the possibility of replicating the benefits of SR in artificial insect-vision based motion detection systems, in particular a newly described form of SR called Suprathreshold Stochastic Resonance (SSR). The current paper is intended to review and identify the key open questions and avenues for future research relating to SR and SSR in such systems.

show abstract

Section: Ssr -A New Type Of Sr Occurring In Arrays Of Neuronsmentioning

confidence: 99%

Open Questions For Suprathreshold Stochastic Resonance In Sensory Neural Models for Motion Detection Using Artificial Insect Vision

McDonnell¹,

Abbott²

2003

AIP Conference Proceedings

View full text Add to dashboard Cite

show abstract

“…then, by the law of large numbers, P(5n)->1 for every e>0. Therefore, if n is large enough, 3 The assumption 2^P>= 1 m W, can of course be replaced by 2~Lp<= 1-(8) P(An r\ Bn) §= P(An) + P(Bn) -1 > J.…”

Section: Nit) Mmentioning

confidence: 99%

The Capacity of a General Noiseless Channel and Its Connection with Hausdorff Dimension

Smorodinsky¹

1968

Proceedings of the American Mathematical Society

View full text Add to dashboard Cite

“…. , x N } be encoded using alphabet of D symbols, then it has been shown by Feinstien [6] that there is a uniquely decipherable code with lengths n 1 , n 2 , . .…”

Section: Introductionmentioning

confidence: 99%

“…is also fulfilled and equality holds if and only if 5) and that by suitable encoded into words of long sequences, the average length can be made arbitrarily close to H (P ), (see Feinstein [6]). This is Shannon's noiseless coding theorem.…”

Section: Introductionmentioning

confidence: 99%