Presenter: Cheng – Yeh Tsao

Slides:



Advertisements
Similar presentations
Data compression. INTRODUCTION If you download many programs and files off the Internet, we have probably encountered.
Advertisements

15 Data Compression Foundations of Computer Science ã Cengage Learning.
Data Compression CS 147 Minh Nguyen.
Arithmetic Coding. Gabriele Monfardini - Corso di Basi di Dati Multimediali a.a How we can do better than Huffman? - I As we have seen, the.
Wan Accelerators: Optimizing Network Traffic with Compression Introduction & Motivation Results for Trained Files Another Compression Method Approach &
A Memory-Efficient Reconfigurable Aho-Corasick FSM Implementation for Intrusion Detection Systems Authors: Seongwook Youn and Dennis McLeod Presenter:
Application of Generalized Representations for Image Compression Application of Generalized Representations for Image Compression using Vector Quantization.
1 Accelerating Multi-Patterns Matching on Compressed HTTP Traffic Authors: Anat Bremler-Barr, Yaron Koral Presenter: Chia-Ming,Chang Date: Publisher/Conf.
An Efficient and Scalable Pattern Matching Scheme for Network Security Applications Department of Computer Science and Information Engineering National.
Low Complexity Scalable DCT Image Compression IEEE International Conference on Image Processing 2000 Philips Research Laboratories, Eindhoven, Netherlands.
Data Compression Basics & Huffman Coding
©Brooks/Cole, 2003 Chapter 15 Data Compression. ©Brooks/Cole, 2003 Realize the need for data compression. Differentiate between lossless and lossy compression.
Lossless Compression Multimedia Systems (Module 2 Lesson 3)
Lecture 10 Data Compression.
Computer Vision – Compression(2) Hanyang University Jong-Il Park.
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.
Survey on Improving Dynamic Web Performance Guide:- Dr. G. ShanmungaSundaram (M.Tech, Ph.D), Assistant Professor, Dept of IT, SMVEC. Aswini. S M.Tech CSE.
A Memory-efficient Huffman Decoding Algorithm
Multimedia Data Introduction to Lossless Data Compression Dr Sandra I. Woolley Electronic, Electrical.
Hardware/Software Codesign Case Study : JPEG Compression.
1/14 Synthesis and Design of Parameter Extractors for Low-Power Pre-computation-Based Content-addressable Memory Using Gate- Block Selection Algorithm.
Hanyang University Hyunok Oh Energy Optimal Bit Encoding for Flash Memory.
Lossless Decomposition and Huffman Codes Sophia Soohoo CS 157B.
An Overview of Different Compression Algorithms Their application on compressing inverted files.
John Hamann Vickey Yeh Compression of Stereo Images.
SPIHT algorithm combined with Huffman encoding Wei Li, Zhen Peng Pang, Zhi Jie Liu, 2010 Third International Symposium on Intelligent Information Technology.
Lampel ZIV (LZ) code The Lempel-Ziv algorithm is a variable-to-fixed length code Basically, there are two versions of the algorithm LZ77 and LZ78 are the.
LZW (Lempel-Ziv-welch) compression method The LZW method to compress data is an evolution of the method originally created by Abraham Lempel and Jacob.
Computer Sciences Department1. 2 Data Compression and techniques.
Compression and Huffman Coding. Compression Reducing the memory required to store some information. Lossless compression vs lossy compression Lossless.
Page 1 Algorithms in the Real World Lempel-Ziv Burroughs-Wheeler ACB.
Efficient Huffman Decoding Aggarwal, M. and Narayan, A., International Conference on Image Processing, vol. 1, pp. 936 – 939, 2000 Presenter :Yu-Cheng.
UNIT I. Entropy and Uncertainty Entropy is the irreducible complexity below which a signal cannot be compressed. Entropy is the irreducible complexity.
IP Address Lookup Masoud Sabaei Assistant professor Computer Engineering and Information Technology Department, Amirkabir University of Technology.
Data Compression Michael J. Watts
FPGA IMPLEMENTATION OF TCAM Under the guidance of Dr. Hraziia Presented By Malvika ( ) Department of Electronics and Communication Engineering.
COMP261 Lecture 22 Data Compression 2.
Data Coding Run Length Coding
Assignment 6: Huffman Code Generation
Madivalappagouda Patil
Digital Image Processing Lecture 20: Image Compression May 16, 2005
Increasing Information per Bit
Lecture 7 Data Compression
CS644 Advanced Topics in Networking
Data Compression.
Multimedia Outline Compression RTP Scheduling Spring 2000 CS 461.
COMP261 Lecture 21 Data Compression.
Algorithms in the Real World
Applied Algorithmics - week7
Chapter 7 Special Section
Data Compression CS 147 Minh Nguyen.
Methodology of a Compiler that Compresses Code using Echo Instructions
Presentation Test. Second Slide Third Slide It worked.
Language-Model Based Text-Compression
Why Compress? To reduce the volume of data to be transmitted (text, fax, images) To reduce the bandwidth required for transmission and to reduce storage.
Chapter 11 Data Compression
UNIT IV.
Image Transforms for Robust Coding
15 Data Compression Foundations of Computer Science ã Cengage Learning.
A New String Matching Algorithm Based on Logical Indexing
Chapter 7 Special Section
Data Compression.
Huffman Coding Link Huffman Coding How will the following be decoded: ‘e’
Efficient Huffman Decoding
EarthTour Presentations
2019/5/14 New Shift table Algorithm For Multiple Variable Length String Pattern Matching Author: Punit Kanuga Presenter: Yi-Hsien Wu Conference: 2015.
Table of Contents Nurse Leader Volume 16, Issue 4, (August 2018)
Thesis Presented By Mohammad Abul Kalam Azad C Shabbir Ahmad C Francis Palma Tony C Supervised by S. M. Kamruzzaman Assistant.
CPS 296.3:Algorithms in the Real World
15 Data Compression Foundations of Computer Science ã Cengage Learning.
Presentation transcript:

Presenter: Cheng – Yeh Tsao 100 Mbits adaptive data compressor design using selectively shiftable content-addressable memory S. Jones, PhD, CEng Department of Electrical and Electronic Engineering, University of Nottingham, University Park, Nottingham NG7 2RD, United Kingdom, IEE PROCEEDINGS-G, Vol. 139, No. 4, AUGUST I992 Presenter: Cheng – Yeh Tsao

Outline Data compression BSTW algorithm Architecture Conclusions

Data compression Huffman coding Lempel – Ziv coding Arithmetic coding High probability of occurrence Lempel – Ziv coding Sliding window Arithmetic coding Creating a code string which represent a fractional value on the number line between 0 and 1

BSTW (Bentley, Sleator, Tarjan and Wei ) algorithm Data in Table length: -It is effect the match probability Tuple size: -It is effect the frequency of match Coding strategy: -It is effect the complexity DEFG n m LMON HIJK ABCD DEFG 1 2 3 ABCD DEFG 1 DEFG 1 ABCD 2 HIJK 2 HIJK 3 LMON 3 LMON Address Data

Architecture (1/2) Organization of selectively shiftable content-addressable memory

Architecture (2/2) Chip architecture

Conclusion The algorithm can reduce text and image data to around two-thirds of its original volume It is shown that a selectively shiftable CAM can support rapid data compression

END