Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Nyquist–Shannon sampling theorem
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Introduction== [[Sampling (signal processing)|Sampling]] is a process of converting a signal (for example, a function of continuous time or space) into a sequence of values (a function of discrete time or space). [[Claude Shannon|Shannon's]] version of the theorem states:<ref name="Shannon49">{{cite journal |ref=refShannon49 |author=Shannon, Claude E. |author-link =Claude Shannon |title =Communication in the presence of noise |journal =Proceedings of the Institute of Radio Engineers |volume =37 |issue =1 |pages =10–21 |date =January 1949 |doi=10.1109/jrproc.1949.232969|s2cid=52873253 }} [http://www.stanford.edu/class/ee104/shannonpaper.pdf Reprint as classic paper in: ''Proc. IEEE'', Vol. 86, No. 2, (Feb 1998)] {{webarchive| url=https://web.archive.org/web/20100208112344/http://www.stanford.edu/class/ee104/shannonpaper.pdf |date=2010-02-08 }} </ref> {{math theorem|If a function <math>x(t)</math> contains no frequencies higher than {{mvar|B}} [[hertz]], then it can be completely determined from its ordinates at a sequence of points spaced less than <math>1/(2B)</math> seconds apart.}} A sufficient sample-rate is therefore anything larger than <math>2B</math> samples per second. Equivalently, for a given sample rate <math>f_s</math>, perfect reconstruction is guaranteed possible for a bandlimit <math>B < f_s/2</math>. When the bandlimit is too high (or there is no bandlimit), the reconstruction exhibits imperfections known as [[aliasing]]. Modern statements of the theorem are sometimes careful to explicitly state that <math>x(t)</math> must contain no [[Sine wave|sinusoidal]] component at exactly frequency <math>B,</math> or that <math>B</math> must be strictly less than one half the sample rate. The threshold <math>2B</math> is called the [[Nyquist rate]] and is an attribute of the continuous-time input <math>x(t)</math> to be sampled. The sample rate must exceed the Nyquist rate for the samples to suffice to represent <math>x(t).</math> The threshold <math>f_s/2</math> is called the [[Nyquist frequency]] and is an attribute of the [[Analog-to-digital converter|sampling equipment]]. All meaningful frequency components of the properly sampled <math>x(t)</math> exist below the Nyquist frequency. The condition described by these inequalities is called the ''Nyquist criterion'', or sometimes the ''Raabe condition''. The theorem is also applicable to functions of other domains, such as space, in the case of a digitized image. The only change, in the case of other domains, is the units of measure attributed to <math>t,</math> <math>f_s,</math> and <math>B.</math> [[File:Sinc function (normalized).svg|thumb|right|250px|The normalized [[sinc function]]: {{nowrap|sin(π{{var|x}}) / (π{{var|x}})}} ... showing the central peak at {{nowrap|1={{var|x}} = 0}}, and zero-crossings at the other integer values of {{var|x}}.]] The symbol <math>T \triangleq 1/f_s</math> is customarily used to represent the interval between adjacent samples and is called the ''sample period'' or ''sampling interval''. The samples of function <math>x(t)</math> are commonly denoted by <math>x[n] \triangleq T\cdot x(nT)</math><ref> {{cite book |last1=Ahmed |first1=N. |url=https://books.google.com/books?id=F-nvCAAAQBAJ |title=Orthogonal Transforms for Digital Signal Processing |last2=Rao |first2=K.R. |date=July 10, 1975 |publisher=Springer-Verlag |isbn=9783540065562 |edition=1 |location=Berlin Heidelberg New York |language=English |doi=10.1007/978-3-642-45450-9}}</ref> (alternatively <math>x_n</math> in older signal processing literature), for all integer values of <math>n.</math> The multiplier <math>T</math> is a result of the transition from continuous time to discrete time (see [[Discrete-time Fourier transform#Relation to Fourier Transform]]), and it is needed to preserve the energy of the signal as <math>T</math> varies. A mathematically ideal way to interpolate the sequence involves the use of [[sinc function]]s. Each sample in the sequence is replaced by a sinc function, centered on the time axis at the original location of the sample <math>nT,</math> with the amplitude of the sinc function scaled to the sample value, <math>x(nT).</math> Subsequently, the sinc functions are summed into a continuous function. A mathematically equivalent method uses the [[Dirac comb#Sampling and aliasing|Dirac comb]] and proceeds by [[Convolution|convolving]] one sinc function with a series of [[Dirac delta]] pulses, weighted by the sample values. Neither method is numerically practical. Instead, some type of approximation of the sinc functions, finite in length, is used. The imperfections attributable to the approximation are known as ''interpolation error''. Practical [[digital-to-analog converter]]s produce neither scaled and delayed [[sinc function]]s, nor ideal [[Dirac pulse]]s. Instead they produce a [[Step function|piecewise-constant sequence]] of scaled and delayed [[rectangular function|rectangular pulses]] (the [[zero-order hold]]), usually followed by a [[lowpass filter]] (called an "anti-imaging filter") to remove spurious high-frequency replicas (images) of the original baseband signal.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)