By Topic

Data driven approach for low-power pre-computation-based content addressable memory

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Tsung-Sheng Lai ; Dept. of Comput. Sci. & Inf. Eng., Nat. Taiwan Univ., Taipei, Taiwan ; Chin-Hung Peng ; Feipei Lai

Content addressable memory (CAM) plays an important role in the performance of many applications such as DCT transforms, processor caches, database accelerators, and network routers because it enables high-speed search operations with hardware acceleration. However, the power consumption of CAM is rather high because within CAM, searching is conducted in parallel for all registered words. Hence, pre-computation-based CAM, i.e., PB-CAM, was proposed in [1] in order to reduce the number of parallel-operated words by first filtering using a precomputation circuit called the parameter extractor. In this work, we propose a data driven algorithm - local grouping (LG) - to synthesize a parameter extractor for PB-CAM such that the registered data can be uniformly mapped to construct parameters; the cost of implementing the parameter extractor is also decreased. Moreover, we also adopt a discard and interlace (DAI) method that can further reduce the impact on non-uniform cases, which happens when most data are identical in some data blocks before LG processing. In experiments, average power consumption reduction of 60.4% was achieved and the number of CMOSs used was also reduced by 0.52%, when compared with the conventional gate-block selection algorithm [2].

Published in:

Computers & Informatics (ISCI), 2011 IEEE Symposium on

Date of Conference:

20-23 March 2011