ENGS4 2004 Assignment 3 ENGS 4 – Assignment 3 Technology of Cyberspace Winter 2004 Thayer School of Engineering Dartmouth College Assignment 3 – Due Sunday,

Slides:

Advertisements

Similar presentations

EE 4780 Huffman Coding Example. Bahadir K. Gunturk2 Huffman Coding Example Suppose X is a source producing symbols; the symbols comes from the alphabet.

Advertisements

Data Compression CS 147 Minh Nguyen.

Sampling and Pulse Code Modulation

Michael Alves, Patrick Dugan, Robert Daniels, Carlos Vicuna

Analogue to Digital Conversion (PCM and DM)

SIMS-201 Compressing Information. 2  Overview Chapter 7: Compression Introduction Entropy Huffman coding Universal coding.

ENGS Lecture 8 ENGS 4 - Lecture 8 Technology of Cyberspace Winter 2004 Thayer School of Engineering Dartmouth College Instructor: George Cybenko,

Lecture 6: Huffman Code Thinh Nguyen Oregon State University.

Fundamental limits in Information Theory Chapter 10 :

Spatial and Temporal Data Mining

SWE 423: Multimedia Systems Chapter 7: Data Compression (2)

Information Theory Eighteenth Meeting. A Communication Model Messages are produced by a source transmitted over a channel to the destination. encoded.

Losslessy Compression of Multimedia Data Hao Jiang Computer Science Department Sept. 25, 2007.

CEG3185 : Introduction to Computer Networks SEG3155 : Communication and Networking Tutorial 4.

Lossless Compression - I Hao Jiang Computer Science Department Sept. 13, 2007.

Department of Computer Engineering University of California at Santa Cruz Data Compression (2) Hai Tao.

EEE377 Lecture Notes1 EEE436 DIGITAL COMMUNICATION Coding En. Mohd Nazri Mahmud MPhil (Cambridge, UK) BEng (Essex, UK) Room 2.14.

UCB Source Coding Jean Walrand EECS. UCB Outline Compression Losless: Huffman Lempel-Ziv Audio: Examples Differential ADPCM SUBBAND CELP Video: Discrete.

Source Coding Hafiz Malik Dept. of Electrical & Computer Engineering The University of Michigan-Dearborn

Digital audio. In digital audio, the purpose of binary numbers is to express the values of samples that represent analog sound. (contrasted to MIDI binary.

ENGS Lecture 1 ENGS 4 - Lecture 11 Technology of Cyberspace Winter 2004 Thayer School of Engineering Dartmouth College Instructor: George Cybenko,

Huffman Encoding Veronica Morales.

Signal Digitization Analog vs Digital Signals An Analog Signal A Digital Signal What type of signal do we encounter in nature?

Prof. Amr Goneid Department of Computer Science & Engineering

1 Lecture 17 – March 21, 2002 Content-delivery services. Multimedia services Reminder  next week individual meetings and project status report are due.

Status of the compression/transmission electronics for the SDD. Cern, march Torino group, Bologna group.

MPEG Audio coders. Motion Pictures Expert Group(MPEG) The coders associated with audio compression part of MPEG standard are called MPEG audio compressor.

CIS679: Multimedia Basics r Multimedia data type r Basic compression techniques.

Linawati Electrical Engineering Department Udayana University

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ć,

Huffman Code and Data Decomposition Pranav Shah CS157B.

Outline Transmitters (Chapters 3 and 4, Source Coding and Modulation) (week 1 and 2) Receivers (Chapter 5) (week 3 and 4) Received Signal Synchronization.

Source Coding Efficient Data Representation A.J. Han Vinck.

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

IT-101 Section 001 Lecture #9 Introduction to Information Technology.

STATISTIC & INFORMATION THEORY (CSNB134) MODULE 11 COMPRESSION.

ELE 488 F06 ELE 488 Fall 2006 Image Processing and Transmission ( ) Image Compression Review of Basics Huffman coding run length coding Quantization.

Huffman Coding The most for the least. Design Goals Encode messages parsimoniously No character code can be the prefix for another.

21 Audio Signal Processing -- Quantization Shyh-Kang Jeng Department of Electrical Engineering/ Graduate Institute of Communication Engineering.

1 What is Multimedia? Multimedia can have a many definitions Multimedia means that computer information can be represented through media types: – Text.

Fundamentals of Multimedia Chapter 6 Basics of Digital Audio Ze-Nian Li and Mark S. Drew 건국대학교 인터넷미디어공학부 임 창 훈.

Huffman Coding (2 nd Method). Huffman coding (2 nd Method)  The Huffman code is a source code. Here word length of the code word approaches the fundamental.

1 st semester 1436 / Modulation Continuous wave (CW) modulation AM Angle modulation FM PM Pulse Modulation Analog Pulse Modulation PAMPPMPDM Digital.

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.

An introduction to audio/video compression Prepared by :: Bhatt shivani ( )

Entropy vs. Average Code-length Important application of Shannon’s entropy measure is in finding efficient (~ short average length) code words The measure.

UNIT I. Entropy and Uncertainty Entropy is the irreducible complexity below which a signal cannot be compressed. Entropy is the irreducible complexity.

Information Theory Information Suppose that we have the source alphabet of q symbols s 1, s 2,.., s q, each with its probability p(s i )=p i. How much.

Data Compression: Huffman Coding in Weiss (p.389)

CSI-447: Multimedia Systems

Increasing Information per Bit

Data Compression.

Analog to digital conversion

DATA COMMUNICATION Lecture-16.

PCM (Pulse Code Modulation)

Data Compression.

Data Compression CS 147 Minh Nguyen.

Context-based Data Compression

The Huffman Algorithm We use Huffman algorithm to encode a long message as a long bit string - by assigning a bit string code to each symbol of the alphabet.

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.

Image Transforms for Robust Coding

Sampling and Quantization

Image Compression Purposes Requirements Types

Analog to Digital Encoding

Electrical Communications Systems ECE

Presentation transcript:

ENGS Assignment 3 ENGS 4 – Assignment 3 Technology of Cyberspace Winter 2004 Thayer School of Engineering Dartmouth College Assignment 3 – Due Sunday, March 7 midnight

ENGS Assignment 3 1.Consider a source with alphabet { a, b, c, d, e, f } and probabilities listed below. a. What is fixed length code for this source? b. What is the average bits per symbol for this code? c. What is the entropy of this source? d. What is a Huffman code for this source? e. What is the average bits per symbol for the Huffman code? f. What is the Huffman code for the 2 symbol per block source model? That is, consider the source as consisting of pairs of symbols with corresponding probabilities. Symbolabcdef Probability

ENGS Assignment 3 2.Perform a Lempel-Ziv encoding of the message (show your work): aaababacdeffeddbca 3.An audio signal is known to be between 0 and 12,000 Hz. 16 bit quantization is to be used. How many seconds of the digitized audio can be stored on a 256 Mbyte memory card? Assume Nyquist sampling but no compression. 4.How much bandwidth will be needed between Dartmouth’s campus and the rest of the Internet if all students decided to listen to streaming audio digitized as in Question 3?