Accession Number : ADP002338

Title :   On the Number of Location Required in the Content-Addressable Memory Implementation of Multiple-Valued Functions,

Corporate Author : NORTHWESTERN UNIV EVANSTON IL DEPT OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCE

Personal Author(s) : Butler,J. T.

Report Date : MAY 1983

Pagination or Media Count : 9

Abstract : A multiple-valued function can be realized by a binary content addressable memory (CAM), a decoder which converts multiple-valued inputs to binary addresses, and a decoder which converts the binary CAM outputs to a multiple-valued output. Of particular interest is the number of CAM locations required in a specific implementation. In this paper, an upper bound on the storage requirements is derived for m-valued n-input functions. This is compared with the storage requirements for specific functions, such as the MIN and MAX functions. Also, the average number of locations is computed for m-valued n-input functions and is shown to be somewhat more than one-half of the upper bound. (Author)

Descriptors :   *Memory devices, *Logic circuits, *Addressing, *Storage, *Symposia, Functions, Position(Location), Multiple operation, Requirements, Output

Distribution Statement : APPROVED FOR PUBLIC RELEASE