论文信息 - Network response time for a general class of WTA

Network response time for a general class of WTA

| In 1] we proposed a simple circuit of Winner-Take-All neural network and derived an analytical equation for its network response time 2]. In this paper, we explore this analytical equation for a more general class of winner-take-all circuits. We show that this equation for network response time is indeed an upper bound for a general class of WTA.

John Sum | Lai-Wan Chan | Peter Kwong-Shun Tam | Cyril S. K. Leung

[1] Alan L. Yuille,et al. A Winner-Take-All Mechanism Based on Presynaptic Inhibition Feedback , 1989, Neural Computation.

[2] Yoh-Han Pao,et al. Adaptive pattern recognition and neural networks , 1989 .

[3] J. A. Nossek,et al. Winner-take-all cellular neural networks , 1993 .

[4] Lin-Bao Yang,et al. Cellular neural networks: theory , 1988 .

[5] R. Lippmann,et al. An introduction to computing with neural nets , 1987, IEEE ASSP Magazine.

[6] J J Hopfield,et al. Neurons with graded response have collective computational properties like those of two-state neurons. , 1984, Proceedings of the National Academy of Sciences of the United States of America.

[7] G. L. Dempsey,et al. Circuit implementation of a peak detector neural network , 1993 .