Implementing Boolean Function by Ternary Content Addressable Memory with Approximate Match

Ternary content addressable memory (TCAM) is a widely used component for high-speed lookup operation. In this work, we advocate a novel use of TCAM, i.e., for implementing a Boolean function. We further leverage approximate match to reduce the resource usage. To achieve this, two extra columns are added to the TCAM-based architecture. The experimental results show that to support the implementation of any 4-input Boolean functions, the proposed architecture can reduce 37.5% rows and 12.5% bit cells over the conventional architecture.