Shannon wavelet

Shannon wavelet

Shannon wavelet or sinc wavelet

Two kinds of Shannon wavelets can be implemented:

*Real Shannon wavelet
*Complex Shannon wavelet
The signal analysis by ideal pass-band filters define a decomposition known as Shannon wavelets (or sinc wavelets). The Haar and sinc systems are Fourier duals of each other.

Real Shannon wavelet

The spectrum of the Shannon mother wavelet is given by:

: Psi^{(operatorname{Sha}) }(w) = prod left( frac {w- 3 pi /2} {pi} ight)+prod left( frac {w+ 3 pi /2} {pi} ight).

where the (normalised) gate function is defined by

: prod ( x):= egin{cases}1, & mbox{if } {|x| le 1/2}, \0 & mbox{if } mbox{otherwise}. \end{cases}

The analytical expression of the real Shannon wavelet can be found by taking the inverse Fourier transform:

: psi^{(operatorname{Sha}) }(t) = operatorname{Sa} left( frac {pi t} {2} ight)cdot cos left( frac {3 pi t} {2} ight)or alternatively as

: psi^{(Sha)}(t)=2 cdot operatorname{sinc}(2t)-operatorname{sinc}(t),

where

: operatorname{sinc}(t):= frac {sin {pi t {pi t}

is the usual sinc function that appears in Shannon sampling theorem.

This wavelet belongs to C^infty-class, but it decreases slowly at infinity and has no bounded support (see Function of compact support), since band-limited signals cannot be time-limited.

The scaling function for the Shannon MRA (or "Sinc"-MRA) is given by the sample function:

: phi^{(Sha)}(t)= frac {sin pi t} {pi t} = operatorname{sinc}(t).

Complex Shannon wavelet

In the case of complex continuous wavelet, the Shannon wavelet is defined by: psi^{(CSha) }(t)=sinc(t).e^{-j2 pi t},

References

* S.G. Mallat, "A Wavelet Tour of Signal Processing", Academic Press, 1999, ISBN 012466606X

* C.S. Burrus, R.A. Gopinath, H. Guo, "Introduction to Wavelets and Wavelet Transforms: A Primer", Prentice-Hall, 1988, ISBN 0124896009.

* http://www.cmap.polytechnique.fr/~mallat/book.html


Wikimedia Foundation. 2010.

Игры ⚽ Поможем сделать НИР

Look at other dictionaries:

  • Wavelet — A wavelet is a mathematical function used to divide a given function or continuous time signal into different frequency components and study each component with a resolution that matches its scale. A wavelet transform is the representation of a… …   Wikipedia

  • Shannon-Hartley-Theorem — Das Shannon Hartley Gesetz beschreibt in der Nachrichtentechnik die theoretische Obergrenze der Bitrate eines Übertragungskanals in Abhängigkeit von Bandbreite und Signal zu Rausch Verhältnis über den mit einer gewissen Wahrscheinlichkeit eine… …   Deutsch Wikipedia

  • Shannon Grenze — Das Shannon Hartley Gesetz beschreibt in der Nachrichtentechnik die theoretische Obergrenze der Bitrate eines Übertragungskanals in Abhängigkeit von Bandbreite und Signal zu Rausch Verhältnis über den mit einer gewissen Wahrscheinlichkeit eine… …   Deutsch Wikipedia

  • Shannon Limit — Das Shannon Hartley Gesetz beschreibt in der Nachrichtentechnik die theoretische Obergrenze der Bitrate eines Übertragungskanals in Abhängigkeit von Bandbreite und Signal zu Rausch Verhältnis über den mit einer gewissen Wahrscheinlichkeit eine… …   Deutsch Wikipedia

  • Shannon-Hartley-Gesetz — Das Shannon Hartley Gesetz beschreibt in der Nachrichtentechnik die theoretische Obergrenze der Bitrate eines Übertragungskanals in Abhängigkeit von Bandbreite und Signal zu Rausch Verhältnis, über den mit einer gewissen Wahrscheinlichkeit eine… …   Deutsch Wikipedia

  • Continuous wavelet — In numerical analysis, continuous wavelets are functions used by the continuous wavelet transform. These functions are defined as analytical expressions, as functions either of time or of frequency. Most of the continuous wavelets are used for… …   Wikipedia

  • Nyquist–Shannon sampling theorem — Fig.1: Hypothetical spectrum of a bandlimited signal as a function of frequency The Nyquist–Shannon sampling theorem, after Harry Nyquist and Claude Shannon, is a fundamental result in the field of information theory, in particular… …   Wikipedia

  • List of mathematics articles (S) — NOTOC S S duality S matrix S plane S transform S unit S.O.S. Mathematics SA subgroup Saccheri quadrilateral Sacks spiral Sacred geometry Saddle node bifurcation Saddle point Saddle surface Sadleirian Professor of Pure Mathematics Safe prime Safe… …   Wikipedia

  • Data compression — Source coding redirects here. For the term in computer programming, see Source code. In computer science and information theory, data compression, source coding or bit rate reduction is the process of encoding information using fewer bits than… …   Wikipedia

  • Lossless data compression — is a class of data compression algorithms that allows the exact original data to be reconstructed from the compressed data. The term lossless is in contrast to lossy data compression, which only allows an approximation of the original data to be… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”