Unified Interval Classification and Unified 3-Classification for Associative Memories

Algorithms for a unified interval classification and a unified 3-classification for use in associative memories are presented. The former, which is more generally known as between-limits classification, achieves the classification of the words of an associative memory into those within and those without an interval marked by two given limits; the latter achieves the classification of the words into the three classes, between the given limits, above the upper limit, and below the lower limit. The term "unified," used for both, denotes the contraction of the two limit classifications which are required in the straightforward approach to either classification into one carried out simultaneously with respect to both given limits. Due to this unification, the presented algorithms are capable of achieving considerable time savings in associative memories of a frequent type. The designs of cryogenic associative memories of this type, containing certain circuit requirements for the performance of the algorithms, are also presented.