This article discusses a synthesis procedure of a discrete-time asynchronous neural network whose information is a limit cycle. The synthesis procedure uses a novel connection matrix and can be reduced into a linear epuation. If all elements of desired limit cycles are independent at each transition step, the equation can be solved and all desired limit cycles can be stored. In some experiments, our procedure exhibits much better storing performance than previous ones.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Kenji NOWARA, Toshimichi SAITO, "Guaranteed Storing of Limit Cycles into a Discrete-Time Asynchronous Neural Network" in IEICE TRANSACTIONS on Fundamentals,
vol. E75-A, no. 11, pp. 1579-1582, November 1992, doi: .
Abstract: This article discusses a synthesis procedure of a discrete-time asynchronous neural network whose information is a limit cycle. The synthesis procedure uses a novel connection matrix and can be reduced into a linear epuation. If all elements of desired limit cycles are independent at each transition step, the equation can be solved and all desired limit cycles can be stored. In some experiments, our procedure exhibits much better storing performance than previous ones.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e75-a_11_1579/_p
Copy
@ARTICLE{e75-a_11_1579,
author={Kenji NOWARA, Toshimichi SAITO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Guaranteed Storing of Limit Cycles into a Discrete-Time Asynchronous Neural Network},
year={1992},
volume={E75-A},
number={11},
pages={1579-1582},
abstract={This article discusses a synthesis procedure of a discrete-time asynchronous neural network whose information is a limit cycle. The synthesis procedure uses a novel connection matrix and can be reduced into a linear epuation. If all elements of desired limit cycles are independent at each transition step, the equation can be solved and all desired limit cycles can be stored. In some experiments, our procedure exhibits much better storing performance than previous ones.},
keywords={},
doi={},
ISSN={},
month={November},}
Copy
TY - JOUR
TI - Guaranteed Storing of Limit Cycles into a Discrete-Time Asynchronous Neural Network
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1579
EP - 1582
AU - Kenji NOWARA
AU - Toshimichi SAITO
PY - 1992
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E75-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 1992
AB - This article discusses a synthesis procedure of a discrete-time asynchronous neural network whose information is a limit cycle. The synthesis procedure uses a novel connection matrix and can be reduced into a linear epuation. If all elements of desired limit cycles are independent at each transition step, the equation can be solved and all desired limit cycles can be stored. In some experiments, our procedure exhibits much better storing performance than previous ones.
ER -