Production and Compression of Raw data for Time Projection Chamber Ajit Kumar Mohanty Dario Favretto Dario Favretto 9 September

Slides:



Advertisements
Similar presentations
T.Sharon-A.Frank 1 Multimedia Compression Basics.
Advertisements

15 Data Compression Foundations of Computer Science ã Cengage Learning.
Data Compression CS 147 Minh Nguyen.
Chapter 4: Representation of data in computer systems: Sound OCR Computing for GCSE © Hodder Education 2011.
Michael Alves, Patrick Dugan, Robert Daniels, Carlos Vicuna
Image Compression, Transform Coding & the Haar Transform 4c8 – Dr. David Corrigan.
Compression & Huffman Codes
Compression Techniques. Digital Compression Concepts ● Compression techniques are used to replace a file with another that is smaller ● Decompression.
SWE 423: Multimedia Systems
Spatial and Temporal Data Mining
DL Compression – Beeri/Feitelson1 Compression דחיסה Introduction Information theory Text compression IL compression.
Document and Query Forms Chapter 2. 2 Document & Query Forms Q 1. What is a document? A document is a stored data record in any form A document is a stored.
Fundamentals of Multimedia Chapter 7 Lossless Compression Algorithms Ze-Nian Li and Mark S. Drew 건국대학교 인터넷미디어공학부 임 창 훈.
Digital Communications I: Modulation and Coding Course
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.
Data dan Teknologi Multimedia Sesi 08 Nofriyadi Nurdam.
©Brooks/Cole, 2003 Chapter 15 Data Compression. ©Brooks/Cole, 2003 Realize the need for data compression. Differentiate between lossless and lossy compression.
Software Research Image Compression Mohamed N. Ahmed, Ph.D.
CSE Lectures 22 – Huffman codes
Basics of Compression Goals: to understand how image/audio/video signals are compressed to save storage and increase transmission efficiency to understand.
Compression Algorithms Robert Buckley MCIS681 Online Dr. Smith Nova Southeastern University.
1 Analysis of Algorithms Chapter - 08 Data Compression.
1 i206: Lecture 2: Computer Architecture, Binary Encodings, and Data Representation Marti Hearst Spring 2012.
Status of the compression/transmission electronics for the SDD. Cern, march Torino group, Bologna group.
Image Processing and Computer Vision: 91. Image and Video Coding Compressing data to a smaller volume without losing (too much) information.
Adviser:陳祝嵩 教授 Speaker: 劉宛靈 學號:R
8. 1 MPEG MPEG is Moving Picture Experts Group On 1992 MPEG-1 was the standard, but was replaced only a year after by MPEG-2. Nowadays, MPEG-2 is gradually.
Ajit and Dario ALICE offline week 10th June Dario Favretto Ajit Kumar Mohanty ALICE Raw Data Production.
Lossless Compression CIS 465 Multimedia. Compression Compression: the process of coding that will effectively reduce the total number of bits needed to.
1 High Level Processing & Offline event selecton event selecton event processing event processing offine Dieter Roehrich UiB Data volume and event rates.
An introduction to audio/video compression Dr. Malcolm Wilson.
Huffman coding Content 1 Encoding and decoding messages Fixed-length coding Variable-length coding 2 Huffman coding.
Design of Novel Two-Level Quantizer with Extended Huffman Coding for Laplacian Source Lazar Velimirović, Miomir Stanković, Zoran Perić, Jelena Nikolić,
9/26 디지털 영상통신 Mathematical Preliminaries Math Background Predictive Coding Huffman Coding Matrix Computation.
Additive White Gaussian Noise
Abdullah Aldahami ( ) April 6,  Huffman Coding is a simple algorithm that generates a set of variable sized codes with the minimum average.
Lecture 4: Lossless Compression(1) Hongli Luo Fall 2011.
CS654: Digital Image Analysis Lecture 34: Different Coding Techniques.
STATISTIC & INFORMATION THEORY (CSNB134) MODULE 11 COMPRESSION.
1Computer Sciences Department. 2 Advanced Design and Analysis Techniques TUTORIAL 7.
Characters CS240.
Chapter 7 Lossless Compression Algorithms 7.1 Introduction 7.2 Basics of Information Theory 7.3 Run-Length Coding 7.4 Variable-Length Coding (VLC) 7.5.
Lecture 12 Huffman Algorithm. In computer science and information theory, a Huffman code is a particular type of optimal prefix code that is commonly.
Fundamentals of Multimedia Chapter 6 Basics of Digital Audio Ze-Nian Li and Mark S. Drew 건국대학교 인터넷미디어공학부 임 창 훈.
An introduction to audio/video compression Prepared by :: Bhatt shivani ( )
1 SWE 423 – Multimedia System. 2 SWE Multimedia System Introduction  Compression is the process of coding that will effectively reduce the total.
Submitted To-: Submitted By-: Mrs.Sushma Rani (HOD) Aashish Kr. Goyal (IT-7th) Deepak Soni (IT-8 th )
Information theory Data compression perspective Pasi Fränti
Design & Analysis of Algorithm Huffman Coding
Compression & Huffman Codes
Assignment 6: Huffman Code Generation
Madivalappagouda Patil
Digital readout architecture for Velopix
Data Compression.
Algorithms in the Real World
Applied Algorithmics - week7
Data Compression.
Data Compression CS 147 Minh Nguyen.
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
Image Processing, Leture #16
UNIT IV.
CSE 589 Applied Algorithms Spring 1999
Direct Sequence Spread Spectrum Modulation and Demodulation using Compressive Sensing Under the guidance of M.Venugopala Rao Submitted by K.Y.K.Kumari.
Image Compression Purposes Requirements Types
15 Data Compression Foundations of Computer Science ã Cengage Learning.
File Compression Even though disks have gotten bigger, we are still running short on disk space A common technique is to compress files so that they take.
Thesis Presented By Mohammad Abul Kalam Azad C Shabbir Ahmad C Francis Palma Tony C Supervised by S. M. Kamruzzaman Assistant.
Hypothesis Testing - Chi Square
15 Data Compression Foundations of Computer Science ã Cengage Learning.
Presentation transcript:

Production and Compression of Raw data for Time Projection Chamber Ajit Kumar Mohanty Dario Favretto Dario Favretto 9 September

Summary " ALTRO data format " Data compression based on standard Huffman technique (ref. A. Nicolaucig, M. Mattavelli, S. Carrato) Using one table Using 5 tables " Preliminary results " Future developments Dario Favretto 9 September

Altro Data Format " ALTRO (Alice Tpc Read Out) Only the samples over a given threshold are considered (while the others are discarded) A Bunch is a group of adjacent over threshold samples coming from one pad (The signal can be represented bunch by bunch). Information relative to one pad is stored in one packet A packet is a sequence of 10 bit words (range ) followed by a trailer " Bunch length (number of samples in the bunch) " Time information (temporal position of the last sample in the bunch " Sequence of amplitude values Trailer " Number of words in the packet (10 bits) " Hardware and channel address (8 and 4 bit respectively) Dario Favretto 9 September

Compression " Lossless compression technique Static Huffman coding Variable length coding technique based on frequency of the symbols (symbols that appear more frequently are coded with a shorter sequence of bits respect to those symbol that appear less frequently in the source file Static means that the algorithm is based on one or more tables that are built before the compression phase according to the frequency of the symbols Dario Favretto 9 September

Compression using one table " Frequency distribution using one table (entropy: 4.97) Dario Favretto 9 September

Results " Compression applied on a source file generated simulating one event of 1000 primaries Threshold value: 2 (Source file dimension 6.5 MB) Huffman (Dimension of the compressed file: ~3.5 MB) 54% Gzip (Dimension of the compressed file: ~4.5 MB) 69% Threshold value: 5 (Source file dimension 1.4 MB) Huffman (Dimension of the compressed file: ~0.9 MB) 68% Gzip (Dimension of the compressed file: ~1.2 MB) 83% Threshold value: 10 (Source file dimension 1 MB) Huffman (Dimension of the compressed file: ~0.7 MB) 72% Gzip (Dimension of the compressed file: ~0.9 MB) 85% Dario Favretto 9 September

Compression using 5 tables Improvement in compression can be obtained considering the nature of the data. Most of the bunches have a pseudo Gaussian shape in which first and last sample have a smaller value with respect to those in central position. " Samples are classified in three categories (each category correspond to a table) Isolated samples Border samples Central samples " Two more tables are used to store the frequency for the Time-Bin values and bunch length values. Dario Favretto 9 September

Frequency distribution Dario Favretto 9 September Entropy " Bunch length: 1.00 " Bunch of 1 sample: 0.36 " Border samples:4.43 " Central Samples:6.95

" Compression applied on a source file generated simulating one event of 1000 primaries Threshold value: 2 (Source file dimension 6.5 MB) Huffman (Dimension of the compressed file: ~3.5 MB) 54% Huff. 5 Table (Dimension of the compressed file: ~2.8 MB) 42% Threshold value: 5 (Source file dimension 1.4 MB) Huffman (Dimension of the compressed file: ~0.9 MB) 68% Huff. 5 Table (Dimension of the compressed file: ~0.8 MB) 55% Threshold value: 10 (Source file dimension 1 MB) Huffman (Dimension of the compressed file: ~0.7 MB) 72% Huff. 5 Table (Dimension of the compressed file: ~0.6 MB) 57% Results Dario Favretto 9 September

" " Compression applied on a source file generated simulating one event of primaries Threshold value: 2 (Source file dimension 21.8 MB Gzip (Dimension of the compressed file: ~17.5 MB) 80% Huff. 5 Table (Dimension of the compressed file: ~10.7 MB) 49% Results Dario Favretto 9 September

Main Macros and Classes " StoreDigits.C is a macro that creates a binary file (DigitsData.dat) containing the sequence of digits (Amplitude, Time-bin, Sector, Row and Pad number) " AliTPCBuildAltroFormat.C is a macro used to generate the Altro format file (AltroFormat.dat) from DigitsData.dat. " AliTPCBuffer160 is a class used to read/write values according to the Altro data format (10 bits words) " AliTPCHNode and AliTPCHTable are classes used to create and manage the tables used by Huffman coding. " AliTPCHCompression class for the implementation of compression and decompression based on one table " AliTPCCompression class for the implementation of compression and decompression based on 5 table Dario Favretto 9 September

Future developments " Test phase using bigger source file (80000 primaries) " Complete the implementation of the Altro data format " Optimize frequency tables independently of a particular source file " Improve the compression factor " Abstract the classes to make them available for others detectors (ITS) Dario Favretto 9 September