An Efficient, Low Power 256X8 T-SRAM Architecture

Authors(4) :-S. MD. Imran Ali, B. V. Ramana, J. Harishwariah, T. Shiva Shankara Vara Prasad

High-speed lookup operations are performed by Ternary Content addressable memories. But TCAMs are limited due to low storage density, relatively access time, low scalability, complex circuitry, and are very expensive in comparison with static random access memories (SRAMs).The benefits of SRAM are availed by configuring an additional logic to enable SRAM to behave like a TCAM. T-SRAM is proposed novel memory architecture that emulates the TCAM functionality with SRAM. T-SRAM logically partitions the classical TCAM table along columns and rows into hybrid TCAM sub tables, which are then processed to map on their corresponding memory blocks .A 256x8 T-SRAM is implemented that consumes 0.024 W.

Authors and Affiliations

S. MD. Imran Ali
Department of Electronics and Communication Engineering, Brindavan Institute of Tech & Science, Kurnool, Andhra Pradesh, India
B. V. Ramana
Department of Electronics and Communication Engineering, Brindavan Institute of Tech & Science, Kurnool, Andhra Pradesh, India
J. Harishwariah
Department of Electronics and Communication Engineering, Brindavan Institute of Tech & Science, Kurnool, Andhra Pradesh, India
T. Shiva Shankara Vara Prasad
Department of Electronics and Communication Engineering, Brindavan Institute of Tech & Science, Kurnool, Andhra Pradesh, India

CAM ,LUT, SRAM, TCAM,TLB

  1. N. Mohan, W. Fung, D. Wright, and M. Sachdev, “Design techniques and test methodology for low-power TCAMs,” IEEE Trans. Very Large Scale Integr. (VLSI) Syst., vol. 14, no. 6, pp. 573–586, Jun. 2006.
  2. P. Mahoney, Y. Savaria, G. Bois, and P. Plante, “Parallel hashing memories: An alternative to content addressable memories,” in Proc. 3rd Int. IEEE-NEWCAS Conf., Jun. 2005, pp. 223–226.
  3. S. Dharmapurikar, P. Krishnamurthy, and D. Taylor, “Longest prefix matching using bloom filters,” IEEE/ACM Trans. Netw., vol. 14, no. 2, pp. 397–409, Apr. 2006.
  4. D. E. Taylor, “Survey and taxonomy of packet classification techniques,” ACM Comput. Surveys, New York, NY, USA: Tech. Rep. WUCSE-2004-24, 2004.
  5. P. Mahoney, Y. Savaria, G. Bois, and P. Plante, “Transactions on highperformance embedded architectures and compilers II,” in Performance Characterization for the Implementation of Content Addressable Memories Based on Parallel Hashing Memories, P. Stenström, Ed. Berlin, Germany: Springer-Verlag, 2009, pp. 307–325.
  6. S. V. Kartalopoulos, “RAM-based associative content-addressable memory device, method of operation thereof and ATM communication switching system employing the same,” U.S. Patent 6 097 724, Aug. 1, 2000.
  7. W. Jiang and V. Prasanna, “Scalable packet classification on FPGA,” IEEE Trans. Very Large Scale Integr. (VLSI) Syst., vol. 20, no. 9, pp. 1668–1680, Sep. 2012

Publication Details

Published in : Volume 2 | Issue 2 | March-April 2016
Date of Publication : 2017-12-31
License:  This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 301-305
Manuscript Number : IJSRSET162290
Publisher : Technoscience Academy

Print ISSN : 2395-1990, Online ISSN : 2394-4099

Cite This Article :

S. MD. Imran Ali, B. V. Ramana, J. Harishwariah, T. Shiva Shankara Vara Prasad, " An Efficient, Low Power 256X8 T-SRAM Architecture, International Journal of Scientific Research in Science, Engineering and Technology(IJSRSET), Print ISSN : 2395-1990, Online ISSN : 2394-4099, Volume 2, Issue 2, pp.301-305, March-April-2016.
Journal URL : http://ijsrset.com/IJSRSET162290

Article Preview

Follow Us

Contact Us