| Literature DB >> 15089576 |
Olivia L White1, Daniel D Lee, Haim Sompolinsky.
Abstract
We study the ability of linear recurrent networks obeying discrete time dynamics to store long temporal sequences that are retrievable from the instantaneous state of the network. We calculate this temporal memory capacity for both distributed shift register and random orthogonal connectivity matrices. We show that the memory capacity of these networks scales with system size.Mesh:
Year: 2004 PMID: 15089576 DOI: 10.1103/PhysRevLett.92.148102
Source DB: PubMed Journal: Phys Rev Lett ISSN: 0031-9007 Impact factor: 9.161