Abstract :
A method of determining the number of responders to a search in an associative memory is presented. It is shown that less than one full adder per memory cell is required and that the maximum delay in establishing the count is proportional to n, where n is the log to the base 3 of the number of memory cells.
Keywords :
Associative memory, carry showers, content-addressable memory, distributed logic, multiple responses, number of responders, response counting, search techniques.; Adders; Associative memory; Civil engineering; Computer science; Counting circuits; Logic; Programming profession; Propagation delay; Relays; Associative memory, carry showers, content-addressable memory, distributed logic, multiple responses, number of responders, response counting, search techniques.;
