Accelerated Updating Mechanisms for FPGA-Based Ternary Content-Addressable Memory

被引:3
|
作者
Irfan, Muhammad [1 ]
Ullah, Zahid [2 ]
Sanka, Abdurrashid I. [1 ]
Cheung, Ray C. C. [1 ]
机构
[1] City Univ Hong Kong, Dept Elect Engn, Hong Kong, Peoples R China
[2] Inst Appl Sci & Technol, Pak Austria Fachhsch, Dept Elect & Comp Engn, Haripur 22621, Pakistan
关键词
Field-programmable gate array (FPGA); logic gate; ternary content-addressable memory (CAM); update-latency; SRAM; TCAM; ALGORITHM; DESIGN;
D O I
10.1109/LES.2020.2999471
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Field-programmable gate array (FPGA)-based ternary content-addressable memories (TCAMs) are constantly evolving in terms of hardware, power consumption, and speed. One disadvantage of these emulated TCAMs is its poor update-latency. Traditional FPGA-based TCAMs have an update-latency of N clock cycles compared to the lookup-latency of one clock cycle, where N is the depth of TCAM. Later, the update-latency is improved to t clock cycles, where t is the number of don't care bits. In this letter, we presented two mechanisms for updating FPGA-based TCAM and successfully implemented on Xilinx Virtex-6 FPGA: an accelerated MUX-Update mechanism and a cost-effective LUT-Update mechanism. MUX-Update provides an update-latency of W + 1 clock cycles by using only three input/output (I/O) pins, whereas W is the width of TCAM. LUT-Update yields a constant update-latency of 2 clock cycles, independent of the size of TCAM, by using W I/O pins.
引用
收藏
页码:37 / 40
页数:4
相关论文
共 50 条
  • [11] Impact of Initialization on Gate-based Area Efficient Ternary Content-Addressable Memory
    Irfan, Muhammad
    Ahmad, Aftab
    2018 INTERNATIONAL CONFERENCE ON COMPUTING, ELECTRONICS & COMMUNICATIONS ENGINEERING (ICCECE), 2018, : 328 - 332
  • [12] FPGA Implementation of SRAM-based Ternary Content Addressable Memory
    Ullah, Zahid
    Jaiswal, Manish Kumar
    Chan, Y. C.
    Cheung, Ray C. C.
    2012 IEEE 26TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS & PHD FORUM (IPDPSW), 2012, : 383 - 389
  • [13] An Efficient I/O Architecture for RAM-Based Content-Addressable Memory on FPGA
    Xuan-Thuan Nguyen
    Trong-Thuc Hoang
    Hong-Thu Nguyen
    Inoue, Katsumi
    Cong-Kha Pham
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2019, 66 (03) : 472 - 476
  • [14] Ferroelectric ternary content-addressable memory for one-shot learning
    Ni, Kai
    Yin, Xunzhao
    Laguna, Ann Franchesca
    Joshi, Siddharth
    Duenkel, Stefan
    Trentzsch, Martin
    Mueeller, Johannes
    Beyer, Sven
    Niemier, Michael
    Hu, Xiaobo Sharon
    Datta, Suman
    NATURE ELECTRONICS, 2019, 2 (11) : 521 - 529
  • [15] Multiplexing in photonics as a resource for optical ternary content-addressable memory functionality
    London, Yanir
    Van Vaerenbergh, Thomas
    Ramini, Luca
    Descos, Antoine
    Buonanno, Luca
    Youn, Jinsung
    Li, Can
    Graves, Catherine E.
    Fiorentino, Marco
    Beausoleil, Raymond G.
    NANOPHOTONICS, 2023, 12 (22) : 4137 - 4155
  • [16] Ferroelectric ternary content-addressable memory for one-shot learning
    Kai Ni
    Xunzhao Yin
    Ann Franchesca Laguna
    Siddharth Joshi
    Stefan Dünkel
    Martin Trentzsch
    Johannes Müller
    Sven Beyer
    Michael Niemier
    Xiaobo Sharon Hu
    Suman Datta
    Nature Electronics, 2019, 2 : 521 - 529
  • [17] A flexible multiport content-addressable memory
    Kumaki, Takeshi
    Iwai, Keisuke
    Kurokawa, Takakazu
    Systems and Computers in Japan, 2006, 37 (11): : 57 - 67
  • [18] Content-addressable memory with spiking neurons
    Mueller, R
    Herz, AVM
    PHYSICAL REVIEW E, 1999, 59 (03): : 3330 - 3338
  • [19] An automatic cache generator based on content-addressable memory
    Hsiao, Shen-Fu
    Lin, Sze-Yun
    Cheng, Tze-Chorng
    Tsai, Ming-Yu
    2006 IEEE ASIA PACIFIC CONFERENCE ON CIRCUITS AND SYSTEMS, 2006, : 1313 - 1316
  • [20] Content-addressable memory with spiking neurons
    Mueller, R.
    Herz, A.V.M.
    Physical Review E - Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics, 1999, 59 (2-3): : 3330 - 3338