Title :
On the existence and design of the best stack filter based associative memory
Author :
Yu, Pao-Ta ; Coyle, Edward J.
Author_Institution :
Inst. of Comput. Sci. & Inf. Eng., Nat. Chung Cheng Univ., Chiayi, Taiwan
Abstract :
The design of the best stack filter-based associative memory is discussed in detail. Definitions for stack filters and associative memory are given. This method of constructing associative memories does not require the desired set of patterns to be orthogonal. Algorithms for designing stack filters which have root sets that contain the smallest possible superset of a prespecified set of patterns are developed. Since only binary inputs are considered, this problem reduces to finding the positive Boolean function that preserves a specified set of binary inputs
Keywords :
content-addressable storage; best stack filter-based associative memory; binary inputs; method of constructing associative memories; root sets; smallest possible superset; stack filters; Algorithm design and analysis; Associative memory; Boolean functions; Computer science; Information filtering; Information filters; Neurons;
Conference_Titel :
Circuits and Systems, 1990., IEEE International Symposium on
Conference_Location :
New Orleans, LA
DOI :
10.1109/ISCAS.1990.112517
