Skip to content Skip to navigation

Connexions

You are here: Home » Content » Introduction

Navigation

Recently Viewed

This feature requires Javascript to be enabled.

Introduction

Module by: Anders Gjendemsjø, Behnaam Aazhang. E-mail the authors

User rating (How does the rating system work?)
Ratings

Ratings allow you to judge the quality of modules. If other users have ranked the module then its average rating is displayed below. Ratings are calculated on a scale from one star (Poor) to five stars (Excellent).

How to rate a module

Hover over the star that corresponds to the rating you wish to assign. Click on the star to add your rating. Your rating should be based on the quality of the content. You must have an account and be logged in to rate content.

:
(0 ratings)

Summary: Introduction to Information and Entropy

Note: Your browser may not currently support MathML. See our browser support page for additional details. You can always view the correct math in the PDF version.

In this and the following modules the basic concepts of information theory will be introduced. For simplicity we assume that the signals are time discrete. Time discrete signals often arise from sampling a time continous signal. The assumption of time discrete signal is valid because we will only be looking at bandlimited signals. (Which can, as we know, be perfectly reconstructed).

In treating time discrete signal and their information content we have to distinguish between two types of signals:

  • signals have amplitude levels belonging to a finite set
  • signals that have amplitudes taken from the real line
In the first case we can measure the information content in terms of entropy, while in the second case the entropy is infinte and we must resort to characterise the source by means of differential entropy.

Examples of information sources

The signals treated are mainly of a stochastic nature, i.e. the signal is unknown to us. Since the signal is not known to the destination (because of it's stochastic nature), it is then best modeled as a random process, discrete-time or continuous time. Examples of information sources that we model as random processes are:

  • Digital data source (e.g. a text) can be modeled as a random process.
  • Video signals can be modeled as a random process. Such signals are mainly bandlimited to around 5 MHz (the value depends on the standards used to raster the frames of image).
  • Audio signals can be modeled as a random process. Speech is typically between 300 Hz and 3400 Hz, see Figure 1.
Figure 1: Power spectral density plot of speech
Figure 1 (voiceband.png)

Video and speech are analog information signals are bandlimited. Therefore, if sampled faster than two times the highest fequency component, they can be reconstructed from their sample values.

Example 1

A speech signal with bandwidth of 3100 Hz can be sampled at the rate of 6.2 KHz. If the samples are quantized with a 8 level quantizer then the speech signal can be represented with a binary sequence with bit rate

6200log28=18600 bits/sec 6200 2 8 18600 bits/sec (1)

Figure 2: Analog speech signal sampled and quantised
Figure 2 (voicesamp.png)

The sampled real values can be quantized to create a discrete-time discrete-valued random process.

The Core of Information theory

The key observation from the discussion above is that for a reveiver the signals are unknown. It is exact this uncertainty that enables the signal to transmit information. This is the core of information theory:

Information transfer:

Information transfer happens when the receiver is unable to know or predict at message before it is received.

Some statistics

Here we present some statistics with the intent of reviewing a few basic concepts and to introduce the notation.

Let X be a stochastic variable. Let X=xi X xi and X=xj X xj denote two outcomes of X.

  • Dependent outcomes implies: PrX=xiX=xj=PrX=xiPrX=xj|xi=PrX=xjPrX=xi|xj X xi X xj X xi xi X xj X xj xj X xi
  • Independent outcomes implies PrX=xiX=xj=PrX=xiPrX=xj X xi X xj X xi X xj
  • Bayes' rule: PrX=xj|xi=PrX=xi|xjPrX=xjPrX=xi xi X xj xj X xi X xj X xi
More about basic probability theory and a derivation of Bayes' rule can be found here.

Content actions

Give Feedback:

E-mail the module authors | Rate module ( How does the rating system work?)

Rating system

Ratings

Ratings allow you to judge the quality of modules. If other users have ranked the module then its average rating is displayed below. Ratings are calculated on a scale from one star (Poor) to five stars (Excellent).

How to rate a module

Hover over the star that corresponds to the rating you wish to assign. Click on the star to add your rating. Your rating should be based on the quality of the content. You must have an account and be logged in to rate content.

(0 ratings)

Download:

Module PDF

Add module to:

My Favorites (?)

'My Favorites' is a special kind of lens which you can use to bookmark modules and collections directly in Connexions. 'My Favorites' can only be seen by you, and collections saved in 'My Favorites' can remember the last module you were on. You need a Connexions account to use 'My Favorites'.

| A lens (?)

Definition of a lens

Lenses

A lens is a custom view of Connexions content. You can think of it as a fancy kind of list that will let you see Connexions through the eyes of organizations and people you trust.

What is in a lens?

Lens makers point to Connexions materials (modules and collections), creating a guide that includes their own comments and descriptive tags about the content.

Who can create a lens?

Any individual Connexions member, a community, or a respected organization.

What are tags? tag icon

Tags are descriptors added by lens makers to help label content, attaching a vocabulary that is meaningful in the context of the lens.

| External bookmarks