Information theory in the Modern Information Society A.J. Han Vinck University of Duisburg/Essen January 2003

Slides:



Advertisements
Similar presentations
DIGITAL COMMUNICATION Packet error detection (CRC) November 2011 A.J. Han Vinck.
Advertisements

15-583:Algorithms in the Real World
15 Data Compression Foundations of Computer Science ã Cengage Learning.
Data Compression CS 147 Minh Nguyen.
Entropy and Information Theory
Time-Frequency Analysis Analyzing sounds as a sequence of frames
RMAUG Professional Development Series 2/11/09 Dwight Reifsnyder.
Source Coding Data Compression A.J. Han Vinck. DATA COMPRESSION NO LOSS of information and exact reproduction (low compression ratio 1:4) general problem.
SIMS-201 Compressing Information. 2  Overview Chapter 7: Compression Introduction Entropy Huffman coding Universal coding.
Department of Computer Engineering University of California at Santa Cruz Data Compression (1) Hai Tao.
CMPE 80N - Introduction to Networks and the Internet 1 CMPE 80N Winter 2004 Lecture 4 Introduction to Networks and the Internet.
SWE 423: Multimedia Systems Chapter 7: Data Compression (1)
Department of Information Engineering1 What is a bit? –the basic unit in computer –represent a binary number : 0 and 1 a group of bits can represent any.
2/28/03 1 The Virtues of Redundancy An Introduction to Error-Correcting Codes Paul H. Siegel Director, CMRR University of California, San Diego The Virtues.
1 Chapter 1 Introduction. 2 Outline 1.1 A Very Abstract Summary 1.2 History 1.3 Model of the Signaling System 1.4 Information Source 1.5 Encoding a Source.
CP Multimedia Internet Communication1 CP Multimedia Computer Communication Lecture 1 - Communication.
EE2F1 Speech & Audio Technology Sept. 26, 2002 SLIDE 1 THE UNIVERSITY OF BIRMINGHAM ELECTRONIC, ELECTRICAL & COMPUTER ENGINEERING Digital Systems & Vision.
Department of Electrical Engineering Systems. What is Systems? The study of mathematical and engineering tools used to analyze and implement engineering.
©Brooks/Cole, 2003 Chapter 15 Data Compression. ©Brooks/Cole, 2003 Realize the need for data compression. Differentiate between lossless and lossy compression.
Applications of Signals and Systems Fall 2002 Application Areas Control Communications Signal Processing.
SIMS-201 Audio Digitization. 2  Overview Chapter 12 Digital Audio Digitization of Audio Samples Quantization Reconstruction Quantization error.
On Error Preserving Encryption Algorithms for Wireless Video Transmission Ali Saman Tosun and Wu-Chi Feng The Ohio State University Department of Computer.
ELG5126 Source Coding and Data Compression
Spring 2015 Mathematics in Management Science Binary Linear Codes Two Examples.
Management Information Systems Lection 06 Archiving information CLARK UNIVERSITY College of Professional and Continuing Education (COPACE)
Image Compression - JPEG. Video Compression MPEG –Audio compression Lossy / perceptually lossless / lossless 3 layers Models based on speech generation.
©2003/04 Alessandro Bogliolo Background Information theory Probability theory Algorithms.
Media File Formats Jon Ivins, DMU. Text Files n Two types n 1. Plain text (unformatted) u ASCII Character set is most common u 7 bits are used u This.
Lecture 10 Data Compression.
ECE242 L30: Compression ECE 242 Data Structures Lecture 30 Data Compression.
Chapter 2, Exploring the Digital Domain
DIGITAL COMMUNICATION Error - Correction A.J. Han Vinck.
Applications of Signals and Systems Application Areas Control Communications Signal Processing (our concern)
CMPD273 Multimedia System Prepared by Nazrita Ibrahim © UNITEN2002 Multimedia System Characteristic Reference: F. Fluckiger: “Understanding networked multimedia,
Computer Architecture Lecture 30 Fasih ur Rehman.
1 Lecture 17 – March 21, 2002 Content-delivery services. Multimedia services Reminder  next week individual meetings and project status report are due.
1 i206: Lecture 2: Computer Architecture, Binary Encodings, and Data Representation Marti Hearst Spring 2012.
Introduction to Information theory A.J. Han Vinck University of Duisburg-Essen April 2012.
Multimedia Specification Design and Production 2012 / Semester 1 / L3 Lecturer: Dr. Nikos Gazepidis
Image Processing and Computer Vision: 91. Image and Video Coding Compressing data to a smaller volume without losing (too much) information.
Addressing Image Compression Techniques on current Internet Technologies By: Eduardo J. Moreira & Onyeka Ezenwoye CIS-6931 Term Paper.
DIGITAL SYSTEMS 2004 Rudolf Tracht and A.J. Han Vinck.
Computer Vision – Compression(1) Hanyang University Jong-Il Park.
Information & Communication INST 4200 David J Stucki Spring 2015.
Information Theory The Work of Claude Shannon ( ) and others.
Engineering and Physics University of Central Oklahoma Dr. Mohamed Bingabr Chapter 1 Introduction ENGR 4323/5323 Digital and Analog Communication.
Advances in digital image compression techniques Guojun Lu, Computer Communications, Vol. 16, No. 4, Apr, 1993, pp
Source Coding Efficient Data Representation A.J. Han Vinck.
Marwan Al-Namari 1 Digital Representations. Bits and Bytes Devices can only be in one of two states 0 or 1, yes or no, on or off, … Bit: a unit of data.
MPEG-1Standard By Alejandro Mendoza. Introduction The major goal of video compression is to represent a video source with as few bits as possible while.
Coding technology Lecturer: Prof. Dr. János LEVENDOVSZKY Course website:
COMP135/COMP535 Digital Multimedia, 2nd edition Nigel Chapman & Jenny Chapman Chapter 2 Lecture 2 – Digital Representations.
Multimedia in Web Introduction. Multimedia Elements in Web Page Images Voice Music Animation Video Text & Numbers.
Chapter Five Making Connections Efficient: Multiplexing and Compression Data Communications and Computer Networks: A Business User’s Approach Eighth Edition.
CompSci 314 S2 C Modern Data Communications Revision of lectures #2 to #11 Clark Thomborson 12 August 2010.
1587: COMMUNICATION SYSTEMS 1 Digital Signals, modulation and noise Dr. George Loukas University of Greenwich,
Submitted To-: Submitted By-: Mrs.Sushma Rani (HOD) Aashish Kr. Goyal (IT-7th) Deepak Soni (IT-8 th )
Fundamentals of Data Representation Yusung Kim
8 Coding Theory Discrete Mathematics: A Concept-based Approach.
CS644 Advanced Topics in Networking
Data Compression.
Chapter Five Making Connections Efficient: Multiplexing and Compression Data Communications and Computer Networks: A Business User’s Approach Eighth Edition.
Multimedia Outline Compression RTP Scheduling Spring 2000 CS 461.
Introduction to Information theory
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.
Digital Communication Chapter 1: Introduction
15 Data Compression Foundations of Computer Science ã Cengage Learning.
15 Data Compression Foundations of Computer Science ã Cengage Learning.
Presentation transcript:

Information theory in the Modern Information Society A.J. Han Vinck University of Duisburg/Essen January 2003

content What is Information theory ? Why is it important ? Where do we find it ?

Claude Elwood Shannon: April 30, February 24, 2001 Shannon (1948), Information theory, The Mathematical theory of Communication

What is Information theory about ? Information: knowledge that can be used Communication: exchange of Information Our goal: efficient; reliable; secure

Express everything in 0 and 1 Discrete ensemble: a,b,c,d  00, 01, 10, 11 in general: k binary digits specify 2 k messages Analogue signal: 1) sample and 2) represent sample value binary t v Output 00, 10, 01, 01, 11

Shannon‘s contributions Modeling: Modeling: how to go from analogue to digital fundamental communication models Bounds: Bounds: how far can we go? achievability impossibility Constructions: Constructions: constructive communication methods with optimum performance and many more!!! 1011 R P

efficient: efficient: general problem statement remove redundancy exact, no errors !! remove irrelevance distortion !! Topics: how ? how good ? how fast ?how complex ? + + +

efficient: efficient: text represent every symbol with 8 bit  1 book: 8 * (500 pages) * 1000 symbols = 4 Mbit  1 book  compression possible to 1 Mbit (1:4)

efficient: efficient: speech sampling speed 8000 samples/sec; accuracy 8 bits/sample; speed 64 kBit/s;  45 minutes lecture = 45*60*64k =180Mbit  45 books  compression possible to 4.8 kBit/s (1:10)

efficient: efficient: CD music sampling speed 44.1 k samples/sec; accuracy 16 bits/sample  storage capacity for one hour stereo: 5 Gbit  1250 books  compression possible to 4 bits/sample ( 1:4 )

efficient: efficient: digital pictures 300 x 400 pixels x 3 colors x 8 bit/sample  2.9 Mbit/picture; for 25 images/second we need 75 Mb/s 2 hour pictures need 540 Gbit  books  compression needed (1:100)

efficient: summary text:  1 book storage: = 4 Mbit  1 book speech:  45 minutes lecture = 45*60*64k =180Mbit  45 books CD music:  storage capacity for one hour stereo: 5 Gbit  1250 books digital pictures:  2 hour pictures need 540 Gbit  books

efficient: general idea represent likely symbols with short length binary words where likely is derived from -prediction of next symbol in source output - context between the source symbols words sounds context in pictures qquq-ue, q-ua, q-ui, q-uo

Morse

efficient: applications  Text: Zip; GIF etc.  Music: MP3  Pictures: JPEG, MPEG Contributors in data reduction/compression: Information theorists: A. Lempel and Jacob Ziv : Huffman a.m.m.

efficient: example JPEG MB4.566MB3.267MB2.351MB

Secure: Secure: example 1 Problem: Is B the owner of the open lock?

Secure: Secure: classical Problem: Is the key present at B?

Secure: Secure: example 2

Reliable: Transmit 0 or 1 Receive 0 or correct 01 in - correct 11 correct 1 0 in - correct What can we do about it ?

Reliable: 2 examples Transmit A: = 0 0 B: = 1 1 Receive 0 0 or 1 1 OK 0 1 or 1 0 NOK 1 error detected! A: = B: =  000, 001, 010, 100  A  111, 110, 101, 011  B 1 error corrected!

Error Sensitivity: Illustration Error sensitivity: =0.01%Error sensitivity: =0.05%

Optical Storage DVD's seven-fold increase in data capacity over the CD has been largely achieved by tightening up the tolerances throughout the predecessor system The data structure was made more efficient by using a better, more efficient error correction code system.

Errors in networking

no- comment

a meshed structure 3 links down partial Fundamental Fundamental problems to consider fast re-routing of information how to include redundancy ? how much redundancy? Cost versus reliability

The success story Qualcomm CDMA Founding information theorists: Irwin Jacobs and Andrew Viterbi

narrow-band and broad-band noise SOLUTION SOLUTION: FREQUENCY and TIME DIVISION time frequency

PPM Code Example 6 code words: distance: =

Code Division Multiple Access (CDMA) 6 users: – transmit at the same time /3 5/6 5 1/2 2/4 4/5 2/5 2 2

Why IT at this university? It is fundamental. The theory is well established Based on –Discrete Mathematics; algorithms –Physics Applications: –Communications; networking; Computer science –Multi-media; medical imaging; biology; languages –Information retrieval; information control

Other application: powerline communications

Information Theory In 1948, Bell Labs scientist Claude Shannon developed Information Theory, and the world of communications technology has never been the same.