Hobson, Stephen John and Austin, Jim orcid.org/0000-0001-5762-8614 (2009) Improved storage capacity in correlation matrix memories storing fixed weight codes. In: Lecture Notes in Computer Science. Lecture Notes in Computer Science . Springer , ICANN 2009 , pp. 728-736.
Abstract
In this paper we introduce an improved binary correlation matrix memory (CMM) with better storage capacity when storing sparse fixed weight codes generated with the algorithm of Baum et al. We outline associative memory, and describe the binary correlation matrix memory- a specific example of a distributed associative memory. The importance of the representation used in a CMM for input and output codes is discussed, with specific regard to sparse fixed weight codes. We present an algorithm for generating of fixed weight codes, originally given by Baum et al. The properties of this algorithm are briefly discussed, including possible thresholding functions which could be used when storing these codes in a CMM; L-max and L-wta. Finally, results generated from a series of simulations are used to demonstrate that the use of L-wta as a thresholding function provides an increase in storage capacity over L-max.
Metadata
Item Type: | Proceedings Paper |
---|---|
Authors/Creators: |
|
Keywords: | associative memory, correlation matrix memory, storage capacity, fixed weight codes, pattern recognition |
Dates: |
|
Institution: | The University of York |
Academic Units: | The University of York > Faculty of Sciences (York) > Computer Science (York) |
Depositing User: | Pure (York) |
Date Deposited: | 07 Jun 2012 18:11 |
Last Modified: | 16 Oct 2024 10:35 |
Status: | Published |
Publisher: | Springer |
Series Name: | Lecture Notes in Computer Science |
Related URLs: | |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:68013 |
Download
Filename: ImprovedCmmStorage.pdf
Description: Improved storage capacity in correlation matrix memories storing fixed weight codes