A Low-Power CAM Design for LZ Data Compression Kun-Jin Lin and Cheng-Wen Wu, IEEE Trans. On computers, Vol. 49, No. 10, Oct. 2000. Presenter: Ming-Hsien.

Slides:

Advertisements

Similar presentations

Junzhou Huang, Shaoting Zhang, Dimitris Metaxas CBIM, Dept. Computer Science, Rutgers University Efficient MR Image Reconstruction for Compressed MR Imaging.

Advertisements

Figure (a) 8 * 8 array (b) 16 * 8 array.

LEVERAGING ACCESS LOCALITY FOR THE EFFICIENT USE OF MULTIBIT ERROR-CORRECTING CODES IN L2 CACHE By Hongbin Sun, Nanning Zheng, and Tong Zhang Joseph Schneider.

An On-Chip IP Address Lookup Algorithm Author: Xuehong Sun and Yiqiang Q. Zhao Publisher: IEEE TRANSACTIONS ON COMPUTERS, 2005 Presenter: Yu Hao, Tseng.

Chapter 12 Memory Organization

A Memory-Efficient Reconfigurable Aho-Corasick FSM Implementation for Intrusion Detection Systems Authors: Seongwook Youn and Dennis McLeod Presenter:

Pipelined Parallel AC-based Approach for Multi-String Matching Department of Computer Science and Information Engineering National Cheng Kung University,

An Efficient IP Address Lookup Algorithm Using a Priority Trie Authors: Hyesook Lim and Ju Hyoung Mun Presenter: Yi-Sheng, Lin ( 林意勝 ) Date: Mar. 11, 2008.

Bitmap Index Buddhika Madduma 22/03/2010 Web and Document Databases - ACS-7102.

1 The Basic Memory Element - The Flip-Flop Up until know we have looked upon memory elements as black boxes. The basic memory element is called the flip-flop.

Power Efficient IP Lookup with Supernode Caching Lu Peng, Wencheng Lu*, and Lide Duan Dept. of Electrical & Computer Engineering Louisiana State University.

Introduction to CMOS VLSI Design CAMs, ROMs, and PLAs

1 Single Reference Frame Multiple Current Macroblocks Scheme for Multiple Reference IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY Tung-Chien.

Die-Hard SRAM Design Using Per-Column Timing Tracking

An Efficient and Scalable Pattern Matching Scheme for Network Security Applications Department of Computer Science and Information Engineering National.

Pipelined Architecture For Multi-String Match Department of Computer Science and Information Engineering National Cheng Kung University, Taiwan R.O.C.

Chapter 1 Data Storage. 2 Chapter 1: Data Storage 1.1 Bits and Their Storage 1.2 Main Memory 1.3 Mass Storage 1.4 Representing Information as Bit Patterns.

A Low-Power VLSI Architecture for Full-Search Block-Matching Motion Estimation Viet L. Do and Kenneth Y. Yun IEEE Transactions on Circuits and Systems.

Adnan Ozsoy & Martin Swany DAMSL - Distributed and MetaSystems Lab Department of Computer Information and Science University of Delaware September 2011.

ECE 526 – Network Processing Systems Design Network Processor Architecture and Scalability Chapter 13,14: D. E. Comer.

PARALLEL TABLE LOOKUP FOR NEXT GENERATION INTERNET

Location-aware MapReduce in Virtual Cloud 2011 IEEE computer society International Conference on Parallel Processing Yifeng Geng1,2, Shimin Chen3, YongWei.

GLOBECOM (Global Communications Conference), 2012

1 Memory Hierarchy The main memory occupies a central position by being able to communicate directly with the CPU and with auxiliary memory devices through.

Digital Logic Design Instructor: Kasım Sinan YILDIRIM

Reconstructing shredded documents through feature matching Authors: Edson Justino, Luiz S. Oliveira, Cinthia Freitas Source: Forensic Science International.

Reconfigurable Computing Using Content Addressable Memory (CAM) for Improved Performance and Resource Usage Group Members: Anderson Raid Marie Beltrao.

Low-Power H.264 Video Compression Architecture for Mobile Communication Student: Tai-Jung Huang Advisor: Jar-Ferr Yang Teacher: Jenn-Jier Lien.

1/14 Synthesis and Design of Parameter Extractors for Low-Power Pre-computation-Based Content-addressable Memory Using Gate- Block Selection Algorithm.

+ CS 325: CS Hardware and Software Organization and Architecture Memory Organization.

Routing Prefix Caching in Network Processor Design Huan Liu Department of Electrical Engineering Stanford University

Smooth Side-Match Classified Vector Quantizer with Variable Block Size IEEE Transaction on image processing, VOL. 10, NO. 5, MAY 2001 Department of Applied.

1 Information Hiding Based on Search Order Coding for VQ Indices Source: Pattern Recognition Letters, Vol.25, 2004, pp.1253 – 1261 Authors: Chin-Chen Chang,

PARALLEL-SEARCH TRIE- BASED SCHEME FOR FAST IP LOOKUP Author: Roberto Rojas-Cessa, Lakshmi Ramesh, Ziqian Dong, Lin Cai Nirwan Ansari Publisher: IEEE GLOBECOM.

A Low-Power Precomputation-Based Parallel CAM Chi-Sheng Lin, Jui-Chang, Bin-Da Liu IEEE2003.

MEMORY ORGANIZATION - Memory hierarchy - Main memory - Auxiliary memory - Cache memory.

A Dynamic Longest Prefix Matching Content Addressable Memory for IP Routing Author: Satendra Kumar Maurya, Lawrence T. Clark Publisher: IEEE TRANSACTIONS.

COMP203/NWEN Memory Technologies 0 Plan for Memory Technologies Topic Static RAM (SRAM) Dynamic RAM (DRAM) Memory Hierarchy DRAM Accelerating Techniques.

1 Outline Bus Transfer Memory Transfer Microoperations.

11 Using Checksum to Reduce Power Consumption of Display Systems for Low-Motion Content Kyungtae Han*, Zhen Fang, Paul Diefenbaugh, Richard Forand, Ravi.

An Effective Three-step Search Algorithm for Motion Estimation

Improved Census Transforms for Resource-Optimized Stereo Vision

TEMPLATE DESIGN © A Comparison-Free Sorting Algorithm Saleh Abdel-hafeez 1 and Ann Gordon-Ross 2 1 Jordan University of.

Updating Designed for Fast IP Lookup Author : Natasa Maksic, Zoran Chicha and Aleksandra Smiljani´c Conference: IEEE High Performance Switching and Routing.

EE 466/586 VLSI Design Partha Pande School of EECS Washington State University

HIGH-PERFORMANCE LONGEST PREFIX MATCH LOGIC SUPPORTING FAST UPDATES FOR IP FORWARDING DEVICES Author: Arun Kumar S P Publisher/Conf.: 2009 IEEE International.

IP Routing table compaction and sampling schemes to enhance TCAM cache performance Author: Ruirui Guo a, Jose G. Delgado-Frias Publisher: Journal of Systems.

1 Space-Efficient TCAM-based Classification Using Gray Coding Authors: Anat Bremler-Barr and Danny Hendler Publisher: IEEE INFOCOM 2007 Present: Chen-Yu.

Static and Dynamic Memory

Efficient Huffman Decoding Aggarwal, M. and Narayan, A., International Conference on Image Processing, vol. 1, pp. 936 – 939, 2000 Presenter :Yu-Cheng.

IP Address Lookup Masoud Sabaei Assistant professor Computer Engineering and Information Technology Department, Amirkabir University of Technology.

FPGA IMPLEMENTATION OF TCAM Under the guidance of Dr. Hraziia Presented By Malvika ( ) Department of Electronics and Communication Engineering.

Two Dimensional Highly Associative Level-Two Cache Design

Accelerating Pattern Matching for DPI

Image camouflage by reversible image transformation

Computer Architecture & Operations I

Chapter 1 Data Storage.

Source :Journal of visual Communication and Image Representation

Semiconductor Memories

Jian Huang, Matthew Parris, Jooheung Lee, and Ronald F. DeMara

Memory Basics Chapter 8.

Memory Organization.

A Small and Fast IP Forwarding Table Using Hashing

Jason Klaus, Duncan Elliott Confidential

Memory Basics Chapter 7.

FIGURE 7-1 Block Diagram of Memory

The state in a stored-program digital computer

High Performance Pattern Matching using Bloom–Bloomier Filter

Authors: Ding-Yuan Lee, Ching-Che Wang, An-Yeu Wu Publisher: 2019 VLSI

Semiconductor memories are classified in different ways. A distinction is made between read-only (ROM) and read-write (RWM) memories. The contents RWMs.

Presentation transcript:

A Low-Power CAM Design for LZ Data Compression Kun-Jin Lin and Cheng-Wen Wu, IEEE Trans. On computers, Vol. 49, No. 10, Oct Presenter: Ming-Hsien Tsai

Outline 1. Introduction 2. CAM Structure 3. Removal of Redundant Comparisons ► Conditional Comparison Mechanism ► Redundancy Analysis 4. Conclusion

Outline 1. Introduction 2. CAM Structure 3. Removal of Redundant Comparisons ► Conditional Comparison Mechanism ► Redundancy Analysis 4. Conclusion

Introduction 1. CAM (Content Addressable Memory) has been considered the fastest architecture among all proposed hardware solutions for searching for a given string, as required in LZ LZ77 is the lossless data compression algorithm

Outline 1. Introduction 2. CAM Structure 3. Removal of Redundant Comparisons ► Conditional Comparison Mechanism ► Redundancy Analysis 4. Conclusion

CAM Structure Traditional SRAM Cell Cross-coupled XOR GatePull-down Transistor Fig. 1. A typical CAM cell

CAM Structure Fig. 1. A typical CAM cell “1”“1” “0”“0” “1”“1” “1”“1”“0”“0” offon off High-impedance “0”“0”

CAM Structure Fig. 1. A typical CAM cell “0”“0” “1”“1” “1”“1” “1”“1”“0”“0” offon low “1”“1”

Outline 1. Introduction 2. CAM Structure 3. Removal Of Redundant Comparisons ► Conditional Comparison Mechanism ► Redundancy Analysis 4. Conclusion

Outline 1. Introduction 2. CAM Structure 3. Removal Of Redundant Comparisons ► Conditional Comparison Mechanism ► Redundancy Analysis 4. Conclusion

Conditional Comparison Mechanism Fig. 4. A typical match logic The masking of unnecessary comparison results on the match nodes Only match node is in the high-impedance when the word identical to input symbols

Conditional Comparison Mechanism Fig. 4. A typical match logic When all the words do not match “1”“1” “0”“0” “0”“0” “0”“0” “0”“0” If all words match “1”“1” “0”“0” “0”“0”

Conditional Comparison Mechanism Fig. 5. Conditional comparison mechanism Difference between CCM and typical match logic

Conditional Comparison Mechanism Fig. 5. Conditional comparison mechanism When all the words do not match “1”“1” “0”“0” “0”“0”“0”“0” “0”“0” If all words match “1”“1” “0”“0” “1”“1” “1”“1” “ OFF ” “0”“0” The static current is totally blocked when “ m i ” is low

Outline 1. Introduction 2. CAM Structure 3. Removal Of Redundant Comparisons ► Conditional Comparison Mechanism ► Redundancy Analysis 4. Conclusion

Redundancy Analysis ► Consider a typical data compressor using a CAM of 2,048 8-bit words as the buffer ► Assume that the input symbols are randomly distributed. On average, only 2048 x1/256 = 8 words can match any input symbol. 8 words can match any input symbol. ► There are 2048 – 8 = 2,040 words that will require the power.

Redundancy Analysis TABLE 1. Experimental Results on the Files from the Calgary Corpus

Outline 1. Introduction 2. CAM Structure 3. Removal Of Redundant Comparisons ► Conditional Comparison Mechanism ► Redundancy Analysis 4. Conclusion

Conclusion ► We showed that the redundant comparisons in the compression process can be removed by turning off the power supply to those words that do not need to participate, saving about 80 percent of the power consumption of the comparison mechanism as compared with the conventional CAM.

END