Information Theory Links

Back Home Up

Here are some starting points for exploration of Information Theory on the Web.   

Information Theory Society Home Page

Entropy on the Web

Information Theory in the real world

The real world and mathematical models
Review of Information Theory
Quantization
Error correcting codes
Block codes
Convolutional codes
Waveform channels and modulation schemes
Trellis coded modulation
Information sources:
Text and data
Speech and music
Images
Black and white (FAX)
Gray scale and color images
Video
Communication Channels: Storage Channels
Magnetic storage
Optical storage: Compact Disks
Communication Channels: Information Transmission
Infinite bandwidth and the death of information theory.
Low bandwidth channels
Telephone wires
Cellular telephones: TDMA vs CDMA
High bandwidth channels:
Coaxial cable
Optical fiber
Putting it all together: The telephone network.

Mathematical models of the real world

Physics

Mathematics

Information Theory is a branch of mathematics

Funadamental Concepts

Entropy

displaymath501

Relative Entropy

displaymath502

Mutual Information

displaymath503

Entropy Rate

displaymath504

Fundamental Properties

tex2html_wrap_inline523 .
tex2html_wrap_inline525 .
tex2html_wrap_inline527 .
H(X) is a concave function of p(x), and is maximized by the uniform distribution
D(p||q) is convex function of (p,q).
Data Processing inequality: tex2html_wrap_inline537 forms a Markov Chain, then tex2html_wrap_inline539 .
Fano's inequality:

displaymath505

Fundamental Results: AEP

displaymath506

Typical set

displaymath507

tex2html_wrap_inline541 for n large enough.
tex2html_wrap_inline545 .

Lossless Source Coding

Any instantaneous (U.D.) code satisfies the Kraft inequality tex2html_wrap_inline547 .
Source coding theorem: The entropy H(X) is a fundamental lower bound on the average length of any instantaneous (U.D.) code, and it is possible to construct codes with average length within one bit of the entropy.
The Huffman coding algorithm produces the instantaneous (U.D.) code with the shortest expected length.
Coding of r.v. tex2html_wrap_inline551 with respect to an incorrect distribution q(x) incurs an additional cost of D(p||q) in average length.
Kolmogorov Complexity: Fundamental limit on description length

displaymath508

Universal Source Coding

Lempel-Ziv schemes: Adaptive dictionary building compression schemes
LZ77: Sliding window
LZ78: Tree structured dictionary
Adaptive Huffman
Arithmetic coding

Fundamental results: Channel Capacity

Capacity of a channel tex2html_wrap_inline557 is defined

displaymath509

Channel Coding theorem There exist codes with probability of error arbitrarily small for all rates less than the capacity of the channel, and all rates above capacity have a non-vanishing probability of error.

Feedback does not increase capacity
A source can be transmitted reliably over a channel if and only if the entropy rate of the source is less than the capacity of the channel.

Examples of Channel Capacity

Binary Symmetric Channel

C= 1-H(p)

Gaussian Channel

displaymath510

Fundamental Results: Rate Distortion Theory

Distortion measure tex2html_wrap_inline561 - eg. Hamming distortion or mean square distortion

Represent random variable X to within average distortion D.

R(D) = minimum rate of code that achieves distortion tex2html_wrap_inline569 .

Rate Distortion Theorem:

displaymath511

Quantization and Vector Quantization

Quantization: The process of finding a discrete set of values to represent a real number.

Uniform quantization: Divide range into bins.

Non-uniform quanitzation: Lloyd algorithm

Vector quantization: Treat blocks of random variables as vectors in high dimensional space and divide the space into regions.

Sigma-delta modulation:

Coding Theory

 

Channel capacity theorem promises the existence of codes with rates less than capacity with an arbitrarily low probability of error.

Coding theory: Find efficient coding and decoding techniques.

Block Codes

Hamming codes
BCH codes
Reed-Solomon codes
Algebraic Geometric codes

Key paremeters of block code: n: Block length, k: no. of information bits, d: minimum distance

Convolutional Codes

Block codes with memory

Parameters of a convolutional code: Free distance, constraint length

Viterbi Algorithm: Dynamic programming to find most likely path through trellis.

Real Information Sources

Model data by a stationary ergodic stochastic process.

Text and computer data: discrete valued process

Speech: one-dimensional continuous valued process

Images: two-dimensional continous valued process

Assumptions: Source is

stochastic: follows the laws of probability
stationary: the distributions do not change with time
ergodic: the average behaviour is the same as the long term behaviour.

Computer files

Computer files: Text, numbers, computer source code, binary files, etc.

English text has an entropy rate of about 1.5 bits/letter.

Compression algorithms:

Adaptive Huffman
Lempel-Ziv algorithms: Adaptive dictionary building algorithms
LZ77: used in GZIP, ZIP, STACKER, V32.bis high speed modems, etc.
LZ78: used in COMPRESS (UNIX), etc.
Arithmetic coding

Speech

Telephone quality speech is sampled at 8 kHz, with 8 bits/sample - 64,000 bits/second.

Compression schemes:

ADPCM: Adaptive Differential Pulse Code Modulation: Encode the difference between the present sample and the previous sample. (32 and 16 Kbits/sec.)
Linear Predictive Coding: Model the speech using an autoregressive filter and send the parameters of the model.
CELP - Code Excited Linear Predictive coding: 16 Kb/s, 8 Kb/s
VSELP - 6.7, 8 and 13 Kb/s
Vector Quantization of LPC parameters: 2.4 Kb/s.

Music

Human ear cannot hear above 20 KHz.

CD quality music is samples at 44.1 KHz, 16 bits/sample, stereo, for a bit rate of 176.4 KBytes/sec or 1.411 Mbits/sec.

CD's data capacity is about 800 MB.

The new Sony Minidisc and the Phillips DCC both incorporate audio compression algorithms.

MIDI: Musical Instrument Digital Interface

Images: FAX

8.5 by 11 inch paper tex2html_wrap_inline577 1728 by 1186 pixels = 2.05 MBits =430 seconds at 4800 bits/sec.

Run length encoding

READ (Relative Element Address Designate) code for vertical corellation.

Average transmission time after compression = 57 seconds.

Group 3/Group 4 coding

New standard: JBIG based on arithmetic coding using contexts. Uses progressive compression.

Images: Still Images

Typical images on a computer screen: 640 by 480 by 24 bit color is 921 KBytes. Compression could save a lot of space.

Noiseless compression: Arithmetic coding about 2:1
JPEG: Joint Photographic Experts Group:

Compression ratios: 2:1 for lossless, 20:1 to 50:1 with almost imperceptible distortion.

Wavelet based compression

JPEG Compression

Fractal Compression

Fractal: Fixed point of recursive mapping.

Video Compression: MPEG

Spatial and Time Correlation.

Uncompressed Video Stream: about 100 Mbits/sec.

MPEG-1: 1.5 Mbits/sec.

MPEG-2: 4-9 Mbits/sec

Communication Channels

Discrete channels:

Continuous input discrete time channels

Waveform channels

The promise of infinite bandwidth

Optical networks promise large bandwidth ( > 10 Gb/s) with extremely low error probability tex2html_wrap_inline587 .

Issues

Multiplexing a large number of connections on the same link
Delay and bandwidth tradeoffs
Control and management of the network

Storage channels

Storage channels transmit information over time.

Magnetic disks

Information stored in transitions

(d,k) constraints: The number of 0's between any two 1's is at least d and at most k.

Eg. (1,3) constraint - 0100100010010001

Capacity of the constraint tex2html_wrap_inline595 where N(t) is the number of sequences satisfying the constraint of length t.

State Splitting or Bounded Delay codes

100's of Mbits/sq. inch

Compact disks

Data is stored by mean of pits on the surface - under the layer of protective plastic.

Each disk stores about 800 MB, and can output information at a data rate of 175 kB/sec.

Uses a (2,10) run length limited code, and interleaved Reed-Solomon codes to correct bursts of up to 4000 errors.

Oversampling D/A converters

CD-ROM, CD-I, Photo-CD, CD-Video all use the same technology.

2x CD-ROM drives

Low bandwidth channels

Rates less than 1 MBit/sec

Deep space channels
Satellite channels
Telephone channels: upto 33,600 bits/sec bidirectional, 56,000 bits/sec one way
Cellular Telephone Channels: 4 Kb/s to 40 Kb/s
Infrared Links for Portable Computers: upto 1 Mb/sec.

High Speed Channels

Twisted Pair: Upto 3-4 Mb/sec
Coaxial Cable: 100's of Mb/sec
Optical Fiber: > 5 Gb/sec

Putting it all together: The telephone network

The Cellular Telephone Network: TDMA vs CDMA

The Information Age

Parkinson's Law for Communications: Demand will expand to exceed supply for

Bandwidth
Storage
Computing power

Information theory remains an active area of research and, in the information age, provides insight and direction for the design and analysis of communication and computer systems.


Joy Thomas
Sat Aug 15 06:26:30 EDT 1998


Questions or problems regarding this web site should be directed to [jat@isl.stanford.edu].
Copyright © 1997 . All rights reserved.
Last modified: Sunday August 16, 1998.