DOCSLIB.ORG

5.5 Data Compression

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
5.5 Data Compression 5.5 Data Compression ‣ basics ‣ run-length coding ‣ Huffman compression ‣ LZW compression Algorithms, 4th Edition · Robert Sedgewick and Kevin Wayne · Copyright © 2002–2010 · February 8, 2011 2:50:01 PM Data compression Compression reduces the size of a file: • To save space when storing it. • To save time when transmitting it. • Most files have lots of redundancy. Who needs compression? • Moore's law: # transistors on a chip doubles every 18-24 months. • Parkinson's law: data expands to fill space available. • Text, images, sound, video, … “ All of the books in the world contain no more information than is broadcast as video in a single large American city in a single year. Not all bits have equal value. ” — Carl Sagan Basic concepts ancient (1950s), best technology recently developed. 2 Applications Generic file compression. • Files: GZIP, BZIP, BOA. • Archivers: PKZIP. • File systems: NTFS. Multimedia. • Images: GIF, JPEG. • Sound: MP3. • Video: MPEG, DivX™, HDTV. Communication. • ITU-T T4 Group 3 Fax. • V.42bis modem. Databases. Google. 3 Lossless compression and expansion uses fewer bits (you hope) Message. Binary data B we want to compress. Compress. Generates a "compressed" representation C (B). Expand. Reconstructs original bitstream B. Compress Expand bitstream B compressed version C(B) original bitstream B 0110110101... 1101011111... 0110110101... Basic model for data compression Compression ratio. Bits in C (B) / bits in B. Ex. 50-75% or better compression ratio for natural language. 4 Food for thought Data compression has been omnipresent since antiquity: • Number systems. • Natural languages. • Mathematical notation. has played a central role in communications technology, • Braille. • Morse code. • Telephone system. and is part of modern life. • MP3. • MPEG. Q. What role will it play in the future? 5 ‣ basics ‣ run-length coding ‣ Huffman compression ‣ LZW compression 6 Data representation: genomic code Genome. String over the alphabet { A, C, T, G }. Goal. Encode an N-character genome: ATAGATGCATAG... Standard ASCII encoding. Two-bit encoding. • 8 bits per char. • 2 bits per char. • 8 N bits. • 2 N bits. char hex binary char binary A 41 01000001 A 00 C 43 01000011 C 01 T 54 01010100 T 10 G 47 01000111 G 11 Amazing but true. Initial genomic databases in 1990s did not use such a code! Fixed-length code. k-bit code supports alphabet of size 2k. 7 664 CHAPTER 6 Q Strings Binary input and output. Most systems nowadays, including Java, base their I/O on Q 664 CHAPTER8-bit bytestreams, 6 Strings so we might decide to read and write bytestreams to match I/O for- mats with the internal representations of primitive types, encoding an 8-bit char with 1 byte, a 16-bit short with 2 bytes, a 32-bit int with 4 bytes, and so forth. Since bit- streams are the primary abstraction for data compression, we go a bit further to allow Binary input and output. Most systems nowadays, including Java, base their I/O on clients to read and write individual bits, intermixed with data of various types (primi- Reading and writing8-bit bytestreams, binary so wedata might decide to read and write bytestreams to match I/O for- tive types and String). The goal is to minimize the necessity for type conversion in mats with the internal representations of primitive types, encoding an 8-bit char with client programs and also to take care of operating-system conventions for representing 1 byte, a 16-bit short with 2 bytes, a 32-bit int with 4 bytes, and so forth. Since bit- data.We use the following API for reading a bitstream from standard input: Binary standardstreams input are the and primary standard abstraction output.for data compression, Libraries we go toa bit read further and to allow write bits clientspublic to readclass and BinaryStdIn write individual bits, intermixed with data of various types (primi- from standardtive input types and and String to ).standard The goal is to output. minimize the necessity for type conversion in boolean readBoolean() read 1 bit of data and return as a boolean value client programs and also to take care of operating-system conventions for representing data.Wechar use thereadChar() following API for readingread 8 bits a bitstream of data and from return standard as a char input: value publicchar classreadChar(int BinaryStdIn r) read r bits of data and return as a char value boolean[similar methodsreadBoolean() for byte (8 bits); shortread 1 (16 bit bits);of data int and (32 return bits); longas a boolean and double value (64 bits)] booleanchar readChar()isEmpty() readis the 8 bitstreambits of data empty? and return as a char value void close() char readChar(int r) readclose r the bits bitstream of data and return as a char value API for static methods that read from a bitstream on standard input [similar methods for byte (8 bits); short (16 bits); int (32 bits); long and double (64 bits)] Aboolean key featureisEmpty() of the abstraction is isthat, the bitstreamin marked empty? constrast to StdIn, the data on stan- dard voidinput isclose() not necessarily alignedclose on the byte bitstream boundaries. If the input stream is a single byte, a client could read it 1 bit at a time with 8 calls to readBoolean(). The close() API for static methods that read from a bitstream on standard input method is not essential, but, for clean termination, clients should call close() to in- dicate that no more bits are to be read. As with StdIn/StdOut, we use the following A key feature of the abstraction is that, in marked constrast to StdIn, the data on stan- complementary API for writing bitstreams to standard output: dard input is not necessarily aligned on byte boundaries. If the input stream is a single byte,public a client class could BinaryStdOut read it 1 bit at a time with 8 calls to readBoolean(). The close() method is not essential, but, for clean termination, clients should call close() to in- void write(boolean b) write the speci!ed bit dicate that no more bits are to be read. As with StdIn/StdOut, we use the following complementaryvoid write(char API for writing c) bitstreamswrite to the standard speci!ed output:8-bit char publicvoid classwrite(char BinaryStdOut c, int r) write the r least signi!cant bits of the speci!ed char [similar methods for byte (8 bits); short (16 bits); int (32 bits); long and double (64 bits)] void write(boolean b) write the speci!ed bit void close() close the bitstream void write(char c) write the speci!ed 8-bit char API for static methods that write to a bitstream on standard output void write(char c, int r) write the r least signi!cant bits of the speci!ed char 8 [similar methods for byte (8 bits); short (16 bits); int (32 bits); long and double (64 bits)] void close() close the bitstream API for static methods that write to a bitstream on standard output Writing binary data Date representation. Different ways to represent 12/31/1999. A character stream (StdOut) StdOut.print(month + "/" + day + "/" + year); 00110001001100100010111100110111001100010010111100110001001110010011100100111001 1 2 / 3 1 / 1 9 9 9 80 bits Three ints (BinaryStdOut) BinaryStdOut.write(month); BinaryStdOut.write(day); BinaryStdOut.write(year); 000000000000000000000000000011000000000000000000000000000001111100000000000000000000011111001111 12 31 1999 96 bits Two chars and a short (BinaryStdOut) A 4-bit !eld, a 5-bit !eld, and a 12-bit !eld (BinaryStdOut) BinaryStdOut.write((char) month); BinaryStdOut.write(month, 4); BinaryStdOut.write((char) day); BinaryStdOut.write(day, 5); BinaryStdOut.write((short) year); BinaryStdOut.write(year, 12); 00001100000111110000011111001111 110011111011111001111000 12 31 1999 32 bits 12 31 1999 21 bits ( + 3 bits for byte alignment at close) Four ways to put a date onto standard output 9 628 CHAPTER 5 Q Strings to open a file with an edi- public class BinaryDump { tor or view it in the manner public static void bits(String[] args) you view text files (or just { run a program that uses int width = Integer.parseInt(args[0]); BinaryStdOut), you are int cnt; likely to see gibberish, de- for (cnt = 0; !BinaryStdIn.isEmpty(); cnt++) pending on the system you { use. BinaryStdIn allows if (cnt % width == 0) StdOut.println(); us to avoid such system de- if (BinaryStdIn.readBoolean()) StdOut.print("1"); pendencies by writing our else StdOut.print("0"); own programs to convert } bitstreams such that we can StdOut.println(cnt + " bits"); see them with our standard } tools. For example, the pro- } gram BinaryDump at left is BinaryStdIn Printing a bitstream on standard (character) output a client that prints out the bits from standard input, encoded with the characters 0 and 1. This program is useful for debug- ging when working with small inputs. We use a slightly more complicated version that Binary dumpsjust prints the count when the width argument is 0 (see !"#$%&'# (.(.)). The similar client HexDump groups the data into 8-bit bytes and prints each as two hexadecimal digits that each represent 4 bits. The client PictureDump displays the bits in a Picture. Q. HowYou to can examine download the HexDump contents and PictureDump of a bitstream? from the booksite. Typically, we use pip- ing and redirection at the command-line level when working with binary files: we can pipe the output of an encoder to BinaryDump, HexDump, or PictureDump, or redirect it to a file. Standard character stream Bitstream represented with hex digits % more abra.txt % java HexDump 4 < abra.txt ABRACADABRA! 41 42 52 41 43 41 44 41 Bitstream represented as 0 and 1 characters 42 52 41 21 12 bytes % java BinaryDump 16 < abra.txt 0100000101000010 Bitstream represented as pixels in a Picture 0101001001000001 % java PictureDump 16 6 < abra.txt 0100001101000001 0100010001000001 16-by-6 pixel 0100001001010010 window, magnified 0100000100100001 6.5 Q Data Compression 667 96 bits 96 bits Four ways to look at a bitstream ASCII encoding.
Load more

Recommended publications
  • Data Compression for Remote Laboratories
    Paper—Data Compression for Remote Laboratories Data Compression for Remote Laboratories https://doi.org/10.3991/ijim.v11i4.6743 Olawale B. Akinwale Obafemi Awolowo University, Ile-Ife, Nigeria [email protected] Lawrence O. Kehinde Obafemi Awolowo University, Ile-Ife, Nigeria [email protected] Abstract—Remote laboratories on mobile phones have been around for a few years now. This has greatly improved accessibility of these remote labs to students who cannot afford computers but have mobile phones. When money is a factor however (as is often the case with those who can’t afford a computer), the cost of use of these remote laboratories should be minimized. This work ad- dressed this issue of minimizing the cost of use of the remote lab by making use of data compression for data sent between the user and remote lab. Keywords—Data compression; Lempel-Ziv-Welch; remote laboratory; Web- Sockets 1 Introduction The mobile phone is now the de facto computational device of choice. They are quite powerful, connected devices which are almost always with us. This is so much so that about every important online service has a mobile version or at least a version compatible with mobile phones and tablets (for this paper we would adopt the phrase mobile device to represent mobile phones and tablets). This has caused online labora- tory developers to develop online laboratory solutions which are mobile device- friendly [1, 2, 3, 4, 5, 6, 7, 8]. One of the main benefits of online laboratories is the possibility of using fewer re- sources to serve more people i.e.
    [Show full text]
  • Incompressibility and Lossless Data Compression: an Approach By
    Incompressibility and Lossless Data Compression: An Approach by Pattern Discovery Incompresibilidad y compresión de datos sin pérdidas: Un acercamiento con descubrimiento de patrones Oscar Herrera Alcántara and Francisco Javier Zaragoza Martínez Universidad Autónoma Metropolitana Unidad Azcapotzalco Departamento de Sistemas Av. San Pablo No. 180, Col. Reynosa Tamaulipas Del. Azcapotzalco, 02200, Mexico City, Mexico Tel. 53 18 95 32, Fax 53 94 45 34 [email protected], [email protected] Article received on July 14, 2008; accepted on April 03, 2009 Abstract We present a novel method for lossless data compression that aims to get a different performance to those proposed in the last decades to tackle the underlying volume of data of the Information and Multimedia Ages. These latter methods are called entropic or classic because they are based on the Classic Information Theory of Claude E. Shannon and include Huffman [8], Arithmetic [14], Lempel-Ziv [15], Burrows Wheeler (BWT) [4], Move To Front (MTF) [3] and Prediction by Partial Matching (PPM) [5] techniques. We review the Incompressibility Theorem and its relation with classic methods and our method based on discovering symbol patterns called metasymbols. Experimental results allow us to propose metasymbolic compression as a tool for multimedia compression, sequence analysis and unsupervised clustering. Keywords: Incompressibility, Data Compression, Information Theory, Pattern Discovery, Clustering. Resumen Presentamos un método novedoso para compresión de datos sin pérdidas que tiene por objetivo principal lograr un desempeño distinto a los propuestos en las últimas décadas para tratar con los volúmenes de datos propios de la Era de la Información y la Era Multimedia.
    [Show full text]
  • A Machine Learning Perspective on Predictive Coding with PAQ
    A Machine Learning Perspective on Predictive Coding with PAQ Byron Knoll & Nando de Freitas University of British Columbia Vancouver, Canada fknoll,[email protected] August 17, 2011 Abstract PAQ8 is an open source lossless data compression algorithm that currently achieves the best compression rates on many benchmarks. This report presents a detailed description of PAQ8 from a statistical machine learning perspective. It shows that it is possible to understand some of the modules of PAQ8 and use this understanding to improve the method. However, intuitive statistical explanations of the behavior of other modules remain elusive. We hope the description in this report will be a starting point for discussions that will increase our understanding, lead to improvements to PAQ8, and facilitate a transfer of knowledge from PAQ8 to other machine learning methods, such a recurrent neural networks and stochastic memoizers. Finally, the report presents a broad range of new applications of PAQ to machine learning tasks including language modeling and adaptive text prediction, adaptive game playing, classification, and compression using features from the field of deep learning. 1 Introduction Detecting temporal patterns and predicting into the future is a fundamental problem in machine learning. It has gained great interest recently in the areas of nonparametric Bayesian statistics (Wood et al., 2009) and deep learning (Sutskever et al., 2011), with applications to several domains including language modeling and unsupervised learning of audio and video sequences. Some re- searchers have argued that sequence prediction is key to understanding human intelligence (Hawkins and Blakeslee, 2005). The close connections between sequence prediction and data compression are perhaps under- arXiv:1108.3298v1 [cs.LG] 16 Aug 2011 appreciated within the machine learning community.
    [Show full text]
  • Adaptive On-The-Fly Compression
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 17, NO. 1, JANUARY 2006 15 Adaptive On-the-Fly Compression Chandra Krintz and Sezgin Sucu Abstract—We present a system called the Adaptive Compression Environment (ACE) that automatically and transparently applies compression (on-the-fly) to a communication stream to improve network transfer performance. ACE uses a series of estimation techniques to make short-term forecasts of compressed and uncompressed transfer time at the 32KB block level. ACE considers underlying networking technology, available resource performance, and data characteristics as part of its estimations to determine which compression algorithm to apply (if any). Our empirical evaluation shows that, on average, ACE improves transfer performance given changing network types and performance characteristics by 8 to 93 percent over using the popular compression techniques that we studied (Bzip, Zlib, LZO, and no compression) alone. Index Terms—Adaptive compression, dynamic, performance prediction, mobile systems. æ 1 INTRODUCTION UE to recent advances in Internet technology, the networking technology available changes regularly, e.g., a Ddemand for network bandwidth has grown rapidly. user connects her laptop to an ISDN link at home, takes her New distributed computing technologies, such as mobile laptop to work and connects via a 100Mb/s Ethernet link, and computing, P2P systems [10], Grid computing [11], Web attends a conference or visits a coffee shop where she uses the Services [7], and multimedia applications (that transmit wireless communication infrastructure that is available. The video, music, data, graphics files), cause bandwidth compression technique that performs best for this user will demand to double every year [21].
    [Show full text]
  • Benefits of Hardware Data Compression in Storage Networks Gerry Simmons, Comtech AHA Tony Summers, Comtech AHA SNIA Legal Notice
    Benefits of Hardware Data Compression in Storage Networks Gerry Simmons, Comtech AHA Tony Summers, Comtech AHA SNIA Legal Notice The material contained in this tutorial is copyrighted by the SNIA. Member companies and individuals may use this material in presentations and literature under the following conditions: Any slide or slides used must be reproduced without modification The SNIA must be acknowledged as source of any material used in the body of any document containing material from these presentations. This presentation is a project of the SNIA Education Committee. Oct 17, 2007 Benefits of Hardware Data Compression in Storage Networks 2 © 2007 Storage Networking Industry Association. All Rights Reserved. Abstract Benefits of Hardware Data Compression in Storage Networks This tutorial explains the benefits and algorithmic details of lossless data compression in Storage Networks, and focuses especially on data de-duplication. The material presents a brief history and background of Data Compression - a primer on the different data compression algorithms in use today. This primer includes performance data on the specific compression algorithms, as well as performance on different data types. Participants will come away with a good understanding of where to place compression in the data path, and the benefits to be gained by such placement. The tutorial will discuss technological advances in compression and how they affect system level solutions. Oct 17, 2007 Benefits of Hardware Data Compression in Storage Networks 3 © 2007 Storage Networking Industry Association. All Rights Reserved. Agenda Introduction and Background Lossless Compression Algorithms System Implementations Technology Advances and Compression Hardware Power Conservation and Efficiency Conclusion Oct 17, 2007 Benefits of Hardware Data Compression in Storage Networks 4 © 2007 Storage Networking Industry Association.
    [Show full text]
  • The Deep Learning Solutions on Lossless Compression Methods for Alleviating Data Load on Iot Nodes in Smart Cities
    sensors Article The Deep Learning Solutions on Lossless Compression Methods for Alleviating Data Load on IoT Nodes in Smart Cities Ammar Nasif *, Zulaiha Ali Othman and Nor Samsiah Sani Center for Artificial Intelligence Technology (CAIT), Faculty of Information Science & Technology, University Kebangsaan Malaysia, Bangi 43600, Malaysia; [email protected] (Z.A.O.); [email protected] (N.S.S.) * Correspondence: [email protected] Abstract: Networking is crucial for smart city projects nowadays, as it offers an environment where people and things are connected. This paper presents a chronology of factors on the development of smart cities, including IoT technologies as network infrastructure. Increasing IoT nodes leads to increasing data flow, which is a potential source of failure for IoT networks. The biggest challenge of IoT networks is that the IoT may have insufficient memory to handle all transaction data within the IoT network. We aim in this paper to propose a potential compression method for reducing IoT network data traffic. Therefore, we investigate various lossless compression algorithms, such as entropy or dictionary-based algorithms, and general compression methods to determine which algorithm or method adheres to the IoT specifications. Furthermore, this study conducts compression experiments using entropy (Huffman, Adaptive Huffman) and Dictionary (LZ77, LZ78) as well as five different types of datasets of the IoT data traffic. Though the above algorithms can alleviate the IoT data traffic, adaptive Huffman gave the best compression algorithm. Therefore, in this paper, Citation: Nasif, A.; Othman, Z.A.; we aim to propose a conceptual compression method for IoT data traffic by improving an adaptive Sani, N.S.
    [Show full text]
  • On Prediction Using Variable Order Markov Models
    Journal of Arti¯cial Intelligence Research 22 (2004) 385-421 Submitted 05/04; published 12/04 On Prediction Using Variable Order Markov Models Ron Begleiter [email protected] Ran El-Yaniv [email protected] Department of Computer Science Technion - Israel Institute of Technology Haifa 32000, Israel Golan Yona [email protected] Department of Computer Science Cornell University Ithaca, NY 14853, USA Abstract This paper is concerned with algorithms for prediction of discrete sequences over a ¯nite alphabet, using variable order Markov models. The class of such algorithms is large and in principle includes any lossless compression algorithm. We focus on six prominent prediction algorithms, including Context Tree Weighting (CTW), Prediction by Partial Match (PPM) and Probabilistic Su±x Trees (PSTs). We discuss the properties of these algorithms and compare their performance using real life sequences from three domains: proteins, English text and music pieces. The comparison is made with respect to prediction quality as measured by the average log-loss. We also compare classi¯cation algorithms based on these predictors with respect to a number of large protein classi¯cation tasks. Our results indicate that a \decomposed" CTW (a variant of the CTW algorithm) and PPM outperform all other algorithms in sequence prediction tasks. Somewhat surprisingly, a di®erent algorithm, which is a modi¯cation of the Lempel-Ziv compression algorithm, signi¯cantly outperforms all algorithms on the protein classi¯cation problems. 1. Introduction Learning of sequential data continues to be a fundamental task and a challenge in pattern recognition and machine learning. Applications involving sequential data may require pre- diction of new events, generation of new sequences, or decision making such as classi¯cation of sequences or sub-sequences.
    [Show full text]
  • Data Compression for Remote Laboratories
    CORE Metadata, citation and similar papers at core.ac.uk Provided by Online-Journals.org (International Association of Online Engineering) Paper—Data Compression for Remote Laboratories Data Compression for Remote Laboratories https://doi.org/10.3991/ijim.v11i4.6743 Olawale B. Akinwale Obafemi Awolowo University, Ile-Ife, Nigeria [email protected] Lawrence O. Kehinde Obafemi Awolowo University, Ile-Ife, Nigeria [email protected] Abstract—Remote laboratories on mobile phones have been around for a few years now. This has greatly improved accessibility of these remote labs to students who cannot afford computers but have mobile phones. When money is a factor however (as is often the case with those who can’t afford a computer), the cost of use of these remote laboratories should be minimized. This work ad- dressed this issue of minimizing the cost of use of the remote lab by making use of data compression for data sent between the user and remote lab. Keywords—Data compression; Lempel-Ziv-Welch; remote laboratory; Web- Sockets 1 Introduction The mobile phone is now the de facto computational device of choice. They are quite powerful, connected devices which are almost always with us. This is so much so that about every important online service has a mobile version or at least a version compatible with mobile phones and tablets (for this paper we would adopt the phrase mobile device to represent mobile phones and tablets). This has caused online labora- tory developers to develop online laboratory solutions which are mobile device- friendly [1, 2, 3, 4, 5, 6, 7, 8].
    [Show full text]
  • Data Compression Algorithms for Energy-Constrained Devices in Delay Tolerant Networks
    Data Compression Algorithms for Energy-Constrained Devices in Delay Tolerant Networks Christopher M. Sadler and Margaret Martonosi Department of Electrical Engineering Princeton University {csadler, mrm}@princeton.edu Abstract 1 Introduction Sensor networks are fundamentally constrained by the In both mobile and stationary sensor networks, collect- difficulty and energy expense of delivering information ing and interpreting useful data is the fundamental goal, and from sensors to sink. Our work has focused on garner- this goal is typically achieved by percolating data back to a ing additional significant energy improvements by devising base station where larger-scale calculations or coordination computationally-efficient lossless compression algorithms are most feasible. The typical sensor node design includes on the source node. These reduce the amount of data that sensors as needed for the application, a small processor, and must be passed through the network and to the sink, and thus a radio whose range and power characteristics match the con- have energy benefits that are multiplicative with the number nectivity needs and energy constraints of the particular de- of hops the data travels through the network. sign space targeted. Currently, if sensor system designers want to compress Energy is a primary constraint in the design of sensor net- acquired data, they must either develop application-specific works. This fundamental energy constraint further limits ev- compression algorithms or use off-the-shelf algorithms not erything from data sensing rates and link bandwidth, to node designed for resource-constrained sensor nodes. This pa- size and weight. In most cases, the radio is the main energy per discusses the design issues involved with implementing, consumer of the system.
    [Show full text]
  • Data Compression in Solid State Storage
    Data Compression in Solid State Storage John Fryar [email protected] Santa Clara, CA August 2013 1 Acknowledgements This presentation would not have been possible without the counsel, hard work and graciousness of the following individuals and/or organizations: Raymond Savarda Sandgate Technologies Santa Clara, CA August 2013 2 Disclaimers The opinions expressed herein are those of the author and do not necessarily represent those of any other organization or individual unless specifically cited. A thorough attempt to acknowledge all sources has been made. That said, we’re all human… Santa Clara, CA August 2013 3 Learning Objectives At the conclusion of this tutorial the audience will have been exposed to: • The different types of Data Compression • Common Data Compression Algorithms • The Deflate/Inflate (GZIP/GUNZIP) algorithms in detail • Implementation Options (Software/Hardware) • Impacts of design parameters in Performance • SSD benefits and challenges • Resources for Further Study Santa Clara, CA August 2013 4 Agenda • Background, Definitions, & Context • Data Compression Overview • Data Compression Algorithm Survey • Deflate/Inflate (GZIP/GUNZIP) in depth • Software Implementations • HW Implementations • Tradeoffs & Advanced Topics • SSD Benefits and Challenges • Conclusions Santa Clara, CA August 2013 5 Definitions Item Description Comments Open A system which will compress Must strictly adhere to standards System data for use by other entities. on compress / decompress I.E. the compressed data will algorithms exit the system Interoperability among vendors mandated for Open Systems Closed A system which utilizes Can support a limited, optimized System compressed data internally but subset of standard. does not expose compressed Also allows custom algorithms data to the outside world No Interoperability req’d.
    [Show full text]
  • Algorithms for Compression on Gpus
    Algorithms for Compression on GPUs Anders L. V. Nicolaisen, s112346 Tecnical University of Denmark DTU Compute Supervisors: Inge Li Gørtz & Philip Bille Kongens Lyngby , August 2013 CSE-M.Sc.-2013-93 Technical University of Denmark DTU Compute Building 321, DK-2800 Kongens Lyngby, Denmark Phone +45 45253351, Fax +45 45882673 [email protected] www.compute.dtu.dk CSE-M.Sc.-2013 Abstract This project seeks to produce an algorithm for fast lossless compression of data. This is attempted by utilisation of the highly parallel graphic processor units (GPU), which has been made easier to use in the last decade through simpler access. Especially nVidia has accomplished to provide simpler programming of GPUs with their CUDA architecture. I present 4 techniques, each of which can be used to improve on existing algorithms for compression. I select the best of these through testing, and combine them into one final solution, that utilises CUDA to highly reduce the time needed to compress a file or stream of data. Lastly I compare the final solution to a simpler sequential version of the same algorithm for CPU along with another solution for the GPU. Results show an 60 time increase of throughput for some files in comparison with the sequential algorithm, and as much as a 7 time increase compared to the other GPU solution. i ii Resumé Dette projekt søger en algoritme for hurtig komprimering af data uden tab af information. Dette forsøges gjort ved hjælp af de kraftigt parallelisérbare grafikkort (GPU), som inden for det sidste årti har åbnet op for deres udnyt- telse gennem simplere adgang.
    [Show full text]
  • Lossless Decompression Accelerator for Embedded Processor with GUI
    micromachines Article Lossless Decompression Accelerator for Embedded Processor with GUI Gwan Beom Hwang, Kwon Neung Cho, Chang Yeop Han, Hyun Woo Oh, Young Hyun Yoon and Seung Eun Lee * Department of Electronic Engineering, Seoul National University of Science and Technology, Seoul 01811, Korea; [email protected] (G.B.H.); [email protected] (K.N.C.); [email protected] (C.Y.H.); [email protected] (H.W.O.); [email protected] (Y.H.Y.) * Correspondence: [email protected]; Tel.: +82-2-970-9021 Abstract: The development of the mobile industry brings about the demand for high-performance embedded systems in order to meet the requirement of user-centered application. Because of the limitation of memory resource, employing compressed data is efficient for an embedded system. However, the workload for data decompression causes an extreme bottleneck to the embedded processor. One of the ways to alleviate the bottleneck is to integrate a hardware accelerator along with the processor, constructing a system-on-chip (SoC) for the embedded system. In this paper, we propose a lossless decompression accelerator for an embedded processor, which supports LZ77 decompression and static Huffman decoding for an inflate algorithm. The accelerator is implemented on a field programmable gate array (FPGA) to verify the functional suitability and fabricated in a Samsung 65 nm complementary metal oxide semiconductor (CMOS) process. The performance of the accelerator is evaluated by the Canterbury corpus benchmark and achieved throughput up to 20.7 MB/s at 50 MHz system clock frequency. Keywords: lossless compression; inflate algorithm; hardware accelerator; graphical user interface; Citation: Hwang, G.B.; Cho, K.N.; embedded processor; system-on-chip Han, C.Y.; Oh, H.W.; Yoon, Y.H.; Lee, S.E.
    [Show full text]