In this letter, we present a distinct alternative of cross talk formulation of associative memory based on the outer product algorithm extended to the higher order and a performance evaluation in terms of the probability of exact data recall by using this formulation. The significant feature of these formulations is that both cross talk and the probability formulated are explicitly represented as the functional forms of Hamming distance between the memorized keys and the applied input key, and the degree of higher order correlation. Simulation results show that exact data retrieval ability of the associative memory using randomly generated data and keys is in well agreement with our theoretical estimation.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Yukio KUMAGAI, Joarder KAMRUZZAMAN, Hiromitsu HIKITA, "Peformance Formulation and Evaluation of Associative Memory Extended to Higher Order" in IEICE TRANSACTIONS on Fundamentals,
vol. E77-A, no. 4, pp. 736-741, April 1994, doi: .
Abstract: In this letter, we present a distinct alternative of cross talk formulation of associative memory based on the outer product algorithm extended to the higher order and a performance evaluation in terms of the probability of exact data recall by using this formulation. The significant feature of these formulations is that both cross talk and the probability formulated are explicitly represented as the functional forms of Hamming distance between the memorized keys and the applied input key, and the degree of higher order correlation. Simulation results show that exact data retrieval ability of the associative memory using randomly generated data and keys is in well agreement with our theoretical estimation.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e77-a_4_736/_p
Copy
@ARTICLE{e77-a_4_736,
author={Yukio KUMAGAI, Joarder KAMRUZZAMAN, Hiromitsu HIKITA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Peformance Formulation and Evaluation of Associative Memory Extended to Higher Order},
year={1994},
volume={E77-A},
number={4},
pages={736-741},
abstract={In this letter, we present a distinct alternative of cross talk formulation of associative memory based on the outer product algorithm extended to the higher order and a performance evaluation in terms of the probability of exact data recall by using this formulation. The significant feature of these formulations is that both cross talk and the probability formulated are explicitly represented as the functional forms of Hamming distance between the memorized keys and the applied input key, and the degree of higher order correlation. Simulation results show that exact data retrieval ability of the associative memory using randomly generated data and keys is in well agreement with our theoretical estimation.},
keywords={},
doi={},
ISSN={},
month={April},}
Copy
TY - JOUR
TI - Peformance Formulation and Evaluation of Associative Memory Extended to Higher Order
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 736
EP - 741
AU - Yukio KUMAGAI
AU - Joarder KAMRUZZAMAN
AU - Hiromitsu HIKITA
PY - 1994
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E77-A
IS - 4
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - April 1994
AB - In this letter, we present a distinct alternative of cross talk formulation of associative memory based on the outer product algorithm extended to the higher order and a performance evaluation in terms of the probability of exact data recall by using this formulation. The significant feature of these formulations is that both cross talk and the probability formulated are explicitly represented as the functional forms of Hamming distance between the memorized keys and the applied input key, and the degree of higher order correlation. Simulation results show that exact data retrieval ability of the associative memory using randomly generated data and keys is in well agreement with our theoretical estimation.
ER -