By the same authors

Improved storage capacity in correlation matrix memories storing fixed weight codes

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Author(s)

Department/unit(s)

Publication details

Title of host publicationLecture Notes in Computer Science
DatePublished - 16 Sep 2009
Pages728-736
Number of pages9
PublisherSpringer
Place of PublicationICANN 2009
Volume5768
EditionPART 1
Original languageEnglish
ISBN (Print)978-3-642-04273-7

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

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.

    Research areas

  • associative memory, correlation matrix memory, storage capacity, fixed weight codes, pattern recognition

Discover related content

Find related publications, people, projects, datasets and more using interactive charts.

View graph of relations