Two optimal encodings for three-layer BAMs

Dilip Sarkar

doi:10.1117/12.342915

22 March 1999 Two optimal encodings for three-layer BAMs

Dilip Sarkar

Proceedings Volume 3722, Applications and Science of Computational Intelligence II; (1999) https://doi.org/10.1117/12.342915
Event: AeroSense '99, 1999, Orlando, FL, United States

Abstract

Kosko proposed Bidirectional Associative Memory (BAM), where pairs of patterns (A_i,B_i) are encoded. When one of a pair of patterns is presented, the other is expected to be recalled. Irrespective of the number of pattern-pairs encoded, if dimensions of A_i and B_i are n and m respectively, a correlation matrix with (mn) elements is required to encode them; and at least O(mn) computation-time is required for recalling a pattern. It is believed that for practical applications (mn) is a large number. Moreover, to guarantee correct recalling of every encoded pattern, the correlation matrix may need to be augmented, which will increase the size of the matrix further. To overcome these problems, we propose a Three Layer BAM (TLBAM) and two novel encoding methods that require smaller size correlation-matrices. To encode p-pair of patterns, only p(m + n) elements are necessary. Thus, recalling time is also reduced. For instance, to encode three pattern-pairs from a recent paper (with n equals 288, m equals 280, and p equals 3) a correlation matrix of (288 X 280 equals) 80,640 elements is required. This encoding does not recall all three pairs correctly. Using one augmentation method the modified correlation matrix will have 89,600 elements for correct recall of all three pairs. Another augmentation method requires modified correlation matrix of 81,208 elements. Our novel encodings proposed here require two correlation matrices with only (288 X 3 + 3 X 280 equals) 1,704 elements.

Citation Download Citation

Dilip Sarkar "Two optimal encodings for three-layer BAMs", Proc. SPIE 3722, Applications and Science of Computational Intelligence II, (22 March 1999); https://doi.org/10.1117/12.342915

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members: $17.00

Non-members: $21.00 ADD TO CART

PROCEEDINGS
11 PAGES

DOWNLOAD PAPER SAVE TO MY LIBRARY

GET CITATION

RIGHTS & PERMISSIONS

Get copyright permission Get copyright permission on Copyright Marketplace

KEYWORDS

Computer programming

Content addressable memory

Matrices

Binary data

Switches

Astatine

Argon

Show All Keywords

Keywords/Phrases

Search In:

Publication Years