Sparse distributed memory: Difference between revisions

Revision as of 11:15, 18 May 2022

Revision as of 17:27, 31 May 2022

Line 153:

Where:

* <math>d</math>: is the distance to the target;

* <math>hN</math>: is the numbernormalized ofnormal hard-locationsdistribution activatedwith duringmean readzero and writevariance operations (this value depends on access radius values)one;

* <math>s</math>: is the number of total stored bitstrings in memory;

* <math>H</math>: is the number of hard-locations in memory;

* <math>w</math>: is the number of times the target bitstring was written in memory;

* <math>\theta</math>: is the total of random bitstrings in all <math>h</math> hard-locations activated by a read operation; i.e., the size of a cell assembly;

* <math>shared(d)</math>: is the mean number of shared hard-locations activated by two bitstrings <math>d</math> bits away from each other. One can find some values for a 1000-dimensional SDM in Kanerva's book, Table 7.1, p.&nbsp;63, or the equations to calculate to any SDM in Appendix B, p.&nbsp;125 of the same book.