论布尔函数在内容寻址存储器上的实现
On the Implementation of Boolean Functions on Content-Addressable Memories
AI总结:
本文研究在内容寻址存储器(CAMs)上实现布尔函数的问题,针对决策树推理中的整数比较等场景,提出了多种输入与状态字母表下的映射方案,并证明其均能达到最小单元数 $n$ 的最优性。
摘要:
设 $[q\rangle$ 表示整数集 $\{0,1,\ldots,...,q-1\}$,并设 $\mathbb{B}=\{0,1\}$。本文考虑在内容寻址存储器(CAMs)上实现函数 $[q\rangle\rightarrow\mathbb{B}$ 的问题。CAMs 可以根据其单元的输入字母表和状态字母表进行分类;例如,在二进制 CAMs 中,这两个字母表均为 $\mathbb{B}$,而在三进制 CAM(TCAM)中,这两个字母表都被赋予了一个“无关”符号。\n这项工作的动机源于近期关于使用 CAMs 对决策树进行快速推理的提议。在此类学习模型中,树节点执行整数比较,例如测试相等性($x=t$?)或不等性($x\le t$?),其中 $x \in [q\rangle$ 是节点的输入,$t \in [q\rangle$ 是节点参数。此类比较的 CAM 实现包括将 $t$ 映射(即编码)到数量为 $n$ 的单元的内部状态中,并将 $x$ 映射到这些单元的输入中,目标是最小化 $n$。\n本文针对各种比较族以及所有函数 $[q\rangle\rightarrow\mathbb{B}$ 的集合,在 CAM 单元的输入和状态字母表的几种场景下,提出了此类映射。所有这些映射都被证明是最优的,因为它们对于任何给定的 $q$ 都能达到最小的可能 $n$。
英文摘要:
Let $[q\rangle$ denote the integer set $\{0,1,\ldots,...,q-1\}$ and let $\mathbb{B}=\{0,1\}$. The problem of implementing functions $[q\rangle\rightarrow\mathbb{B}$ on content-addressable memories (CAMs) is considered. CAMs can be classified by the input alphabet and the state alphabet of their cells; for example, in binary CAMs, those alphabets are both $\mathbb{B}$, while in a ternary CAM (TCAM), both alphabets are endowed with a "don't care" symbol. This work is motivated by recent proposals for using CAMs for fast inference on decision trees. In such learning models, the tree nodes carry out integer comparisons, such as testing equality ($x=t$?) or inequality ($x\le t$?), where $x \in [q\rangle$ is an input to the node and $t \in [q\rangle$ is a node parameter. A CAM implementation of such comparisons includes mapping (i.e., encoding) $t$ into internal states of some number $n$ of cells and mapping $x$ into inputs to these cells, with the goal of minimizing $n$. Such mappings are presented for various comparison families, as well as for the set of all functions $[q\rangle\rightarrow\mathbb{B}$, under several scenarios of input and state alphabets of the CAM cells. All those mappings are shown to be optimal in that they attain the smallest possible $n$ for any given $q$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。