Three-stage architecture for bidirectional associative memory

Research output: Contribution to conferencePaper

3 Citations (Scopus)

Abstract

This paper proposes a method to compute exact amount of noise in recalling every encoded pattern. This can be used to find vectors for construction of augmented matrices for both Wang et al., and Wang-Lee methods. The computation of noise also gives a method for obtaining minimum dimension of augmented vectors. This information is used to construct augmented matrix for guaranteed recall of every encoded pattern. A three layer Bidirectional Associative Memory (TLBAM) that requires smaller size correlation matrices is also proposed. The number of elements in the correlation matrices are proportional to the number of pattern-pairs encoded. The TLBAM when encoded using the novel augmentation method guarantees correct recall of all stored pairs. The encoded network will also require much fewer elements than any other method.

Original languageEnglish (US)
StatePublished - Jan 1 1996
EventProceedings of the 1996 IEEE International Conference on Neural Networks, ICNN. Part 1 (of 4) - Washington, DC, USA
Duration: Jun 3 1996Jun 6 1996

Other

OtherProceedings of the 1996 IEEE International Conference on Neural Networks, ICNN. Part 1 (of 4)
CityWashington, DC, USA
Period6/3/966/6/96

Fingerprint

Data storage equipment

ASJC Scopus subject areas

  • Software

Cite this

Sarkar, D. (1996). Three-stage architecture for bidirectional associative memory. Paper presented at Proceedings of the 1996 IEEE International Conference on Neural Networks, ICNN. Part 1 (of 4), Washington, DC, USA, .

Three-stage architecture for bidirectional associative memory. / Sarkar, Dilip.

1996. Paper presented at Proceedings of the 1996 IEEE International Conference on Neural Networks, ICNN. Part 1 (of 4), Washington, DC, USA, .

Research output: Contribution to conferencePaper

Sarkar, D 1996, 'Three-stage architecture for bidirectional associative memory' Paper presented at Proceedings of the 1996 IEEE International Conference on Neural Networks, ICNN. Part 1 (of 4), Washington, DC, USA, 6/3/96 - 6/6/96, .
Sarkar D. Three-stage architecture for bidirectional associative memory. 1996. Paper presented at Proceedings of the 1996 IEEE International Conference on Neural Networks, ICNN. Part 1 (of 4), Washington, DC, USA, .
Sarkar, Dilip. / Three-stage architecture for bidirectional associative memory. Paper presented at Proceedings of the 1996 IEEE International Conference on Neural Networks, ICNN. Part 1 (of 4), Washington, DC, USA, .
@conference{74191242293548d68046cf4b8e8716d7,
title = "Three-stage architecture for bidirectional associative memory",
abstract = "This paper proposes a method to compute exact amount of noise in recalling every encoded pattern. This can be used to find vectors for construction of augmented matrices for both Wang et al., and Wang-Lee methods. The computation of noise also gives a method for obtaining minimum dimension of augmented vectors. This information is used to construct augmented matrix for guaranteed recall of every encoded pattern. A three layer Bidirectional Associative Memory (TLBAM) that requires smaller size correlation matrices is also proposed. The number of elements in the correlation matrices are proportional to the number of pattern-pairs encoded. The TLBAM when encoded using the novel augmentation method guarantees correct recall of all stored pairs. The encoded network will also require much fewer elements than any other method.",
author = "Dilip Sarkar",
year = "1996",
month = "1",
day = "1",
language = "English (US)",
note = "Proceedings of the 1996 IEEE International Conference on Neural Networks, ICNN. Part 1 (of 4) ; Conference date: 03-06-1996 Through 06-06-1996",

}

TY - CONF

T1 - Three-stage architecture for bidirectional associative memory

AU - Sarkar, Dilip

PY - 1996/1/1

Y1 - 1996/1/1

N2 - This paper proposes a method to compute exact amount of noise in recalling every encoded pattern. This can be used to find vectors for construction of augmented matrices for both Wang et al., and Wang-Lee methods. The computation of noise also gives a method for obtaining minimum dimension of augmented vectors. This information is used to construct augmented matrix for guaranteed recall of every encoded pattern. A three layer Bidirectional Associative Memory (TLBAM) that requires smaller size correlation matrices is also proposed. The number of elements in the correlation matrices are proportional to the number of pattern-pairs encoded. The TLBAM when encoded using the novel augmentation method guarantees correct recall of all stored pairs. The encoded network will also require much fewer elements than any other method.

AB - This paper proposes a method to compute exact amount of noise in recalling every encoded pattern. This can be used to find vectors for construction of augmented matrices for both Wang et al., and Wang-Lee methods. The computation of noise also gives a method for obtaining minimum dimension of augmented vectors. This information is used to construct augmented matrix for guaranteed recall of every encoded pattern. A three layer Bidirectional Associative Memory (TLBAM) that requires smaller size correlation matrices is also proposed. The number of elements in the correlation matrices are proportional to the number of pattern-pairs encoded. The TLBAM when encoded using the novel augmentation method guarantees correct recall of all stored pairs. The encoded network will also require much fewer elements than any other method.

UR - http://www.scopus.com/inward/record.url?scp=0029767527&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029767527&partnerID=8YFLogxK

M3 - Paper

ER -