Algebraic information theory and stochastic resonance for binary-input binary-output channels

2012 ◽  
Author(s):  
Ira S. Moskowitz ◽  
Paul Cotae ◽  
Pedro N. Safier
Keyword(s):  
Information Theory ◽  
Stochastic Resonance ◽  
Binary Output ◽  
Binary Input

Noise Induced Order: Stochastic Resonance

1998 ◽  
Vol 08 (05) ◽  
pp. 869-879 ◽  
Author(s):  
Lutz Schimansky-Geier ◽  
Jan A. Freund ◽  
Alexander B. Neiman ◽  
Boris Shulgin
Keyword(s):  
Information Theory ◽  
Stochastic Resonance ◽  
Noise Intensity ◽  
Electronic Circuit ◽  
Schmitt Trigger ◽  
Periodic Component ◽  
Large Signal ◽  
Input Signals

We investigate stochastic resonance in the framework of information theory. Input signals are taken from an electronic circuit and output signals are produced by a Schmitt trigger. These electronic signals are analyzed with respect to their informational contents. Conditional entropies and Kullback measures exhibit extrema for values of noise intensity in the range of stochastic resonance. However, it has to be noted that these extrema are related to synchronization effects, observed in stochastic resonance for large signal amplitudes, rather than to a peak in the related spectrum indicating some periodic component.

ON THE EQUIVALENCE OF TWO-LAYERED PERCEPTRONS WITH BINARY NEURONS

1995 ◽  
Vol 06 (03) ◽  
pp. 225-231 ◽  
Author(s):  
MARCELO BLATT ◽  
EYTAN DOMANY ◽  
IDO KANTER
Keyword(s):  
Boolean Function ◽  
Global Symmetries ◽  
Input Output ◽  
Output Unit ◽  
Binary Output ◽  
Linearly Independent ◽  
Input Layer ◽  
Binary Input

We consider two-layered perceptrons consisting of N binary input units, K binary hidden units and one binary output unit, in the limit N≫K≥1. We prove that the weights of a regular irreducible network are uniquely determined by its input-output map up to some obvious global symmetries. A network is regular if its K weight vectors from the input layer to the K hidden units are linearly independent. A (single layered) perceptron is said to be irreducible if its output depends on every one of its input units; and a two-layered perceptron is irreducible if the K+1 perceptrons that constitute such network are irreducible. By global symmetries we mean, for instance, permuting the labels of the hidden units. Hence, two irreducible regular two-layered perceptrons that implement the same Boolean function must have the same number of hidden units, and must be composed of equivalent perceptrons.

scholarly journals Nonlinear Trellis Codes for Binary-Input Binary-Output Multiple-Access Channels with Single-User Decoding

2012 ◽  
Vol 60 (2) ◽  
pp. 364-374 ◽  
Author(s):  
Miguel Griot ◽  
Andres I. Vila Casado ◽  
Wen-Yen Weng ◽  
Herwin Chan ◽  
Jiadong Wang ◽  
...  
Keyword(s):  
Multiple Access ◽  
Trellis Codes ◽  
Binary Output ◽  
Multiple Access Channels ◽  
Single User ◽  
Binary Input

scholarly journals Stochastic resonance in ion channels characterized by information theory

2000 ◽  
Vol 61 (4) ◽  
pp. 4272-4280 ◽  
Author(s):  
Igor Goychuk ◽  
Peter Hänggi
Keyword(s):  
Information Theory ◽  
Ion Channels ◽  
Stochastic Resonance
Sign in / Sign up

Export Citation Format

Share Document